Testing a Class of Methods for Solving Minimization Problems with Simple Bounds on the Variables

DOI10.2307/2008615zbMath0645.65033OpenAlexW4256110696WikidataQ58185971 ScholiaQ58185971MaRDI QIDQ3788978

Andrew R. Conn, Nicholas I. M. Gould, Phillipe L. Toint

Publication date: 1988

Full work available at URL: https://doi.org/10.2307/2008615

zbMATH Keywords

bound constraintstest problemstrust region methodCauchy pointupdate algorithmssmooth minimization problemBFGS-quasi-Newton updateline search-based minimizationsymmetric rank-1 procedure

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Nonlinear programming (90C30)

Related Items

A limited memory quasi-Newton trust-region method for box constrained optimization, Trust region algorithm with two subproblems for bound constrained problems, A new direct search method based on separable fractional interpolation model, A new trust region algorithm for bound constrained minimization, An unconstrained optimization technique for large-scale linearly constrained convex minimization problems, On the convergence of interior-reflective Newton methods for nonlinear minimization subject to bounds, CBLIB 2014: a benchmark library for conic mixed-integer and continuous optimization, A trust-region strategy for minimization on arbitrary domains, Sparse noncommutative polynomial optimization, LMBOPT: a limited memory method for bound-constrained optimization, An interior-point affine-scaling trust-region method for semismooth equations with box constraints, On affine-scaling interior-point Newton methods for nonlinear minimization with bound constraints, Global convergence and the Powell singular function, Monotone projected gradient methods for large-scale box-constrained quadratic programming, Solving polynomial least squares problems via semidefinite programming relaxations, Parallel quasi-Newton methods for unconstrained optimization, Numerical experiments with the Lancelot package (Release \(A\)) for large-scale nonlinear optimization, Parallel Uzawa method for large-scale minimization of partially separable functions, Training multi-layered neural network with a trust-region based algorithm, Evaluating bound-constrained minimization software, Study of multiscale global optimization based on parameter space partition, Regularization of limited memory quasi-Newton methods for large-scale nonconvex minimization, An SR1/BFGS SQP algorithm for nonconvex nonlinear programs with block-diagonal Hessian matrix, Trust-region algorithms for training responses: machine learning methods using indefinite Hessian approximations, Augmented Lagrangian method with nonmonotone penalty parameters for constrained optimization, Global convergence of a modified gradient projection method for convex constrained problems, Approximate norm descent methods for constrained nonlinear systems, A combined class of self-scaling and modified quasi-Newton methods, Convergence properties of trust region methods for linear and convex constraints, Scaled projected-directions methods with application to transmission tomography, A globally convergent Lagrangian barrier algorithm for optimization with general inequality constraints and simple bounds, A Bregman extension of quasi-Newton updates. II: Analysis of robustness properties, Convergence of quasi-Newton matrices generated by the symmetric rank one update, Convergence of supermemory gradient method, A subspace limited memory quasi-Newton algorithm for large-scale nonlinear bound constrained optimization, A dual gradient-projection method for large-scale strictly convex quadratic problems, An active set quasi-Newton method with projected search for bound constrained minimization, An optimal algorithm and superrelaxation for minimization of a quadratic function subject to separable convex constraints with applications, A subspace implementation of quasi-Newton trust region methods for unconstrained optimization, A direct active set algorithm for large sparse quadratic programs with simple bounds, Exploiting Sparsity in SDP Relaxation of Polynomial Optimization Problems, On iterative algorithms for linear least squares problems with bound constraints, Correlative sparsity in primal-dual interior-point methods for LP, SDP, and SOCP, Unnamed Item, Unnamed Item, Nonmonotone conic trust region method with line search technique for bound constrained optimization, Impulse noise removal by an adaptive trust-region method, A primal-dual interior-point relaxation method with global and rapidly local convergence for nonlinear programs, An efficient implementation of a trust region method for box constrained optimization, Variationally derived scaling and variable metric updates from the preconvex part of the Broyden family, Generalized Polak-Ribière algorithm, Representations of quasi-Newton matrices and their use in limited memory methods, An affine scaling interior trust-region method combining with nonmonotone line search filter technique for linear inequality constrained minimization, A novel augmented Lagrangian method of multipliers for optimization with general inequality constraints

Uses Software

• ve08
• minpack

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Test examples for nonlinear programming codes
• A generalized conjugate gradient algorithm for solving a class of quadratic programming problems
• Partitioned variable metric updates for large structured optimization problems
• An algorithm for minimizing a differentiable function subject to box constraints and errors
• Some remarks on the symmetric rank-one update
• Study on a supermemory gradient method for the minimization of functions
• The Conjugate Gradient Method and Trust Regions in Large Scale Optimization
• How bad are the BFGS and DFP methods when the objective function is quadratic?
• Analogues of Dixon’s and Powell’s Theorems for Unconstrained Minimization with Inexact Line Searches
• Global Convergence of a Class of Trust Region Algorithms for Optimization with Simple Bounds
• Testing Unconstrained Optimization Software
• Inexact Newton Methods
• Minimization of a Quadratic Function of Many Variables Subject only to Lower and Upper Bounds
• Matrix conditioning and nonlinear optimization
• Some Numerical Results Using a Sparse Matrix Updating Formula in Unconstrained Optimization
• A New Algorithm for Unconstrained Optimization