Globally and superlinearly convergent algorithms for the solution of box-constrained optimi\-zation

DOI10.1016/S0898-1221(03)90002-2zbMath1065.90070MaRDI QIDQ1827220

Yu-Fei Yang

Publication date: 6 August 2004

Published in: Computers \& Mathematics with Applications (Search for Journal in Brave)

zbMATH Keywords

functionGlobal convergenceSuperlinear convergenceSystem of linear equationsBox-constrained optimizationExact penalty

Mathematics Subject Classification ID

Nonlinear programming (90C30) Numerical optimization and variational techniques (65K10)

Uses Software

• TRON

Cites Work

• Projected quasi-Newton algorithm with trust region for constrained optimization
• A QP-free constrained Newton-type method for variational inequality problems
• Robust recursive quadratic programming algorithm model with global and superlinear convergence properties
• A globally convergent sequential quadratic programming algorithm for mathematical programs with linear complementarity constraints
• A robust sequential quadratic programming method
• Quadratically and superlinearly convergent algorithms for the solution of inequality constrained minimization problems
• Minimization of \(SC^ 1\) functions and the Maratos effect
• A nonsmooth version of Newton's method
• Convergence of the BFGS Method for $LC^1 $ Convex Constrained Optimization
• Some Feasibility Issues in Mathematical Programs with Equilibrium Constraints
• On the Accurate Identification of Active Constraints
• On Homotopy-Smoothing Methods for Box-Constrained Variational Inequalities
• A Class of penalty functions for optimization problema with bound constraints
• A subspace limited memory quasi-Newton algorithm for large-scale nonlinear bound constrained optimization
• Newton's Method for Large Bound-Constrained Optimization Problems
• A Truncated Newton Algorithm for Large Scale Box Constrained Optimization
• A globally and superlinearly convergent SQP algorithm for nonlinear constrained optimization.