A trust region method for conic model to solve unconstraind optimizaions

A trust region method for conic models to solve unconstrained optimization problems is proposed. We analyze the trust region approach for conic models and present necessary and sufficient conditions for the solution of the associated trust region subproblems. A corresponding numerical algorithm is developed and has been tested for 19 standard test functions in unconstrained optimization. The numerical results show that this method is superior to some advanced methods in the current software libraries. Finally, we prove that the proposed method has global convergence and Q-superlinear convergence properties

[1]  Roger Fletcher,et al.  An algorithm for solving linearly constrained optimization problems , 1972, Math. Program..

[2]  P. Gill,et al.  Quasi-Newton Methods for Unconstrained Optimization , 1972 .

[3]  J. J. Moré,et al.  A Characterization of Superlinear Convergence and its Application to Quasi-Newton Methods , 1973 .

[4]  M. Powell.  CONVERGENCE PROPERTIES OF A CLASS OF MINIMIZATION ALGORITHMS , 1975 .

[5]  Mordecai Avriel,et al.  Nonlinear programming , 1976 .

[6]  J. Dennis,et al.  Two new unconstrained optimization algorithms which use function and gradient values , 1979 .

[7]  W. Davidon.  Conic Approximations and Collinear Scalings for Optimizers , 1980 .

[8]  D. Sorensen.  THE Q-SUPERLINEAR CONVERGENCE OF A COLLINEAR SCALING ALGORITHM FOR UNCONSTRAINED OPTIMIZATION* , 1980 .

[9]  David M. author-Gay.  Computing Optimal Locally Constrained Steps , 1981 .

[10]  Jorge J. Moré,et al.  Testing Unconstrained Optimization Software , 1981, TOMS.

[11]  Jorge J. Moré,et al.  Recent Developments in Algorithms and Software for Trust Region Methods , 1982, ISMP.

[12]  Richard H. Byrd,et al.  A Family of Trust Region Based Algorithms for Unconstrained Minimization with Strong Global Convergence Properties. , 1985 .

[13]  D. Sorensen.  Newton's method with a model trust region modification , 1982 .

[14]  Jorge J. Moré,et al.  Computing a Trust Region Step , 1983 .

[15]  M GayDavid,et al.  Algorithm 611: Subroutines for Unconstrained Minimization Using a Model/Trust-Region Approach , 1983 .

[16]  John E. Dennis,et al.  Numerical methods for unconstrained optimization and nonlinear equations , 1983, Prentice Hall series in computational mathematics.

[17]  M. J. D. Powell,et al.  On the global convergence of trust region algorithms for unconstrained minimization , 1984, Math. Program..

[18]  R. Fletcher.  Practical Methods of Optimization , 1988 .

[19]  Ya-Xiang Yuan,et al.  On a subproblem of trust region algorithms for constrained optimization , 1990, Math. Program..

[20]  K. A. Ariyawansa.  Deriving collinear scaling algorithms as extensions of quasi-Newton methods and the local convergence of DFP- and BFGS-related collinear scaling algorithms , 1990, Math. Program..

[21]  K. A. Ariyawansa,et al.  Local and Q-superlinear convergence of a class of collinear scaling algorithms that extends quasi-newton methods with broyden's bounded-⊘ class of updates† ‡ , 1992 .

[22]  L. Qi,et al.  An Iterative Method for the Minimax Problem , 1995 .