Testing a class of methods for solving minimization problems with simple bounds on the variables
Mathematics of ComputationPublished 1 January 1988
Andrew R. Conn, Nicholas I. M. Gould, Philippe L. Toint
Citations205
SJR quartileQ1
SJR score1.84
SNIP1.96
Generate an AI Snapshot to get a quick, structured summary of this paper.
Study Snapshot
ObjectiveStudy objective
MethodsResearch methodology
PopulationPopulation studied
Sample sizeSample sizes
OutcomesStudy outcomes here
ResultsStudy results comes here
LimitationsResearch study limitations comes here
A concise AI-generated summary of the paper will appear here once you click Generate AI Snapshot.
Abstract
We describe the results of a series of tests for a class of new methods of trust region type for solving the simple bound constrained minimization problem. The results are encouraging and lead us to believe that the methods will prove useful in solving large-scale problems.
Keywords
Computer ScienceMathematics
Society for Industrial and Applied Mathematics eBooksNumerical Methods for Unconstrained Optimization and Nonlinear Equations
7,651 Citations1996J. E. Dennis, Robert B. Schnabel
Practical Methods of Optimization
6,403 Citations2000R. Ian Fletcher
SIAM Journal on Numerical AnalysisInexact Newton Methods
1,540 Citations1982Ron S. Dembo, Stanley C. Eisenstat +1 more
ACM Transactions on Mathematical SoftwareTesting Unconstrained Optimization Software
1,520 Citations1981Jorge J. Morè, B. S. Garbow +1 more
A relatwely large but easy-to-use collection of test functions and designed gmdelines for testing the reliability and robustness of unconstrained optimization software.
Lecture notes in economics and mathematical systemsMore Test Examples for Nonlinear Programming Codes
1,156 Citations1987Klaus Schittkowski
The purpose of this note is to point out how an interested mathematical programmer could obtain computer programs of more than 120 constrained nonlinear programming problems which have been used in the past to test and compare optimization codes.
SIAM Journal on Numerical AnalysisThe Conjugate Gradient Method and Trust Regions in Large Scale Optimization
830 Citations1983Trond Steihaug
It is shown in this paper that an approximate solution of the trust region problem may be found by the preconditioned conjugate gradient method, and it is shown that the method has the same convergence properties as existing methods based on the dogleg strategy using an approximate Hessian.
Elsevier eBooksA New Algorithm for Unconstrained Optimization
451 Citations1970M. J. D. Powell
A new algorithm is described for calculating the least value of a given differentiable function of several variables that may be preferable to current algorithms for solving many unconstrained minimization problems.
Recent Developments in Algorithms and Software for Trust Region Methods
354 Citations1983Jorge J. Morè
The theoretical and practical results available for trust region methods are surveyed and the relevance of these results to the implementation oftrust region methods is discussed.
SIAM Journal on Numerical AnalysisGlobal Convergence of a Class of Trust Region Algorithms for Optimization with Simple Bounds
319 Citations1988Andrew R. Conn, Nicholas I. M. Gould +1 more
It is shown that, when the strict complementarily condition holds, the proposed algorithms reduce to an unconstrained calculation after finitely many iterations, allowing a fast asymptotic rate of convergence.
Journal of Optimization Theory and ApplicationsTest examples for nonlinear programming codes
286 Citations1980Willi Hock, Klaus Schittkowski
The purpose of this note is to point out how an interested mathematical programmer could obtain computer programs of more than 120 constrained nonlinear programming problems which have been used in the past to test and compare optimization codes.
Mathematical ProgrammingMatrix conditioning and nonlinear optimization
231 Citations1978David F. Shanno, Kang -Hoh Phua
Results indicate strong superiority computationally for the Davidon and BFGS update over the self-scaling update, except on a special class of functions, the homogeneous functions.
Numerische MathematikPartitioned variable metric updates for large structured optimization problems
158 Citations1982Andreas Griewank, Philippe L. Toint
A minimization method based on the idea of partitioned updating of the Hessian matrix in the case where the objective function can be decomposed in a sum of convex “element” functions is presented.
Academic Press eBooksTowards an Efficient Sparsity Exploiting Newton Method for Minimization
157 Citations1981Philippe L. Toint
Mathematical ProgrammingHow bad are the BFGS and DFP methods when the objective function is quadratic?
96 Citations1986M. J. D. Powell
The results help to explain why the DFP method is often less suitable than the BFGS algorithm for general unconstrained optimization calculations, and they show that quadratic functions provide much information about efficiency when the current vector of variables is too far from the solution for an asymptotic convergence analysis.
Linear Algebra and its ApplicationsA generalized conjugate gradient algorithm for solving a class of quadratic programming problems
91 Citations1980Dianne P. O’Leary
This paper applies matrix splitting techniques and a conjugate gradient algorithm to the problem of minimizing a convex quadratic form subject to upper and lower bounds on the variables and presents the results of numerical experiments showing the effectiveness of the algorithm.
Journal of Optimization Theory and ApplicationsStudy on a supermemory gradient method for the minimization of functions
74 Citations1969E. E. Cragg, A. V. Levy
The memory gradient method and the supermemory gradient method are compared with the Fletcher-Reeves method andThe Fletcher-Powell-Davidon method and a comparison with quasilinearization is also presented.
Mathematics of ComputationSome numerical results using a sparse matrix updating formula in unconstrained optimization
72 Citations1978Philippe L. Toint
A numerical comparison between algorithms for unconstrained optimization that take account of sparsity in the second derivative matrix of the objective function and what method to use in what circumstances is shown.
SIAM ReviewPractical Methods of Optimization, Vol. 1: Unconstrained Optimization (R. Fletcher)
59 Citations1982J. E. Dennis
IMA Journal of Applied MathematicsMinimization of a Quadratic Function of Many Variables Subject only to Lower and Upper Bounds
54 Citations1974R. Fletcher, Marion Jackson
ACM SIGNUM NewsletterAn example concerning quasi-Newton estimation of a sparse hessian
35 Citations1981Danny C. Sorensen
Journal of Optimization Theory and ApplicationsAn algorithm for minimizing a differentiable function subject to box constraints and errors
19 Citations1979Robert K. Brayton, Jane Cullum
This work describes a quasi-Newton algorithm that handles the box constraints directly and approximates the given function locally by nonsingular quadratic functions and can tolerate the errors.
Journal of Optimization Theory and ApplicationsSome remarks on the symmetric rank-one update
13 Citations1979Jane Cullum, Robert K. Brayton
It is demonstrated that failures of definition correspond to either losses of independence in the directions of search being generated or to near-singularity of the Hessian approximation being generated, and a procedure is described that guarantees that these updates are well-defined for any nonsingular quadratic function.
Mathematics of ComputationSome Numerical Results Using a Sparse Matrix Updating Formula in Unconstrained Optimization
11 Citations1978Philippe L. Toint
SIAM Journal on Numerical AnalysisAnalogues of Dixon’s and Powell’s Theorems for Unconstrained Minimization with Inexact Line Searches
7 Citations1986J. L. Nazareth
By modifying the way in which search directions are defined, it is shown how to remove the restrictive assumption on line searches in these two theorems and shows also that the BFGS algorithm, modified in this way, is equivalent to the three-term-recurrence (TTR) method on quadratic functions.
Elsevier eBooksSUPERLINEARLY CONVERGENT ALGORITHMS FOR LINEARLY CONSTRAINED OPTIMIZATION PROBLEMS11Supported by NSF Grant GJ35292
6 Citations1975Ubaldo M. García‐Palomares
It is proved, that, under suitable conditions, the sequence of points generated by the algorithms converges Q-superlinearly from any initial feasible point to a stationary point, that is, a point which satisfies the Kuhn-Tucker conditions.