Convergence of Trust Region Algorithms for Optimization with Bounds when Strict Complementarity Does Not Hold

DOI10.1137/0728026MaRDI QIDQ3350686zbMATH OpenOpenAlexFDO

Authors Marc J. A. Lescrenier

Publication date 1991

Published in SIAM Journal on Numerical Analysis (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1137/0728026

zbMATH Keywords

Newton's methodtrust region algorithmquadratic convergencesuperlinear convergencebound constrained problemsstrict complementarity

Mathematics Subject Classification ID

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

Recommendations

• On the Convergence Theory of Trust-Region-Based Algorithms for Equality-Constrained Optimization
• A Trust Regional Algorithm for Bound Constrained Minimization
• scientific article; zbMATH DE number 1131709
• A globally convergent trust region algorithm for optimization with general constraints and simple bounds.
• Global Convergence of a Trust Region Algorithm for Nonlinear Inequality Constrained Optimization Problems

Cited in

(22)

• A Trust Regional Algorithm for Bound Constrained Minimization
• Hölderian Error Bounds and Kurdyka-Łojasiewicz Inequality for the Trust Region Subproblem
• On unconstrained and constrained stationary points of the implicit Lagrangian
• Convergence of Affine-Scaling Interior-Point Methods with Line Search for Box Constrained Optimization
• Numerical experiments with the Lancelot package (Release \(A\)) for large-scale nonlinear optimization
• Modified subspace limited memory BFGS algorithm for large-scale bound constrained optimization
• An accurate active set Newton algorithm for large scale bound constrained optimization.
• Global Convergence of a Class of Trust Region Algorithms for Optimization with Simple Bounds
• A trust region method based on a new affine scaling technique for simple bounded optimization
• An interior-point affine-scaling trust-region method for semismooth equations with box constraints
• New active set identification for general constrained optimization and minimax problems
• Properties of restricted NCP functions for nonlinear complementarity problems
• Globally convergent DC trust-region methods
• A new subspace limited memory BFGS algorithm for large-scale bound constrained optimization
• An active set algorithm for nonlinear optimization with polyhedral constraints
• A decomposition method for large-scale box constrained optimization
• An active-set projected trust region algorithm for box constrained optimization problems
• On affine-scaling interior-point Newton methods for nonlinear minimization with bound constraints
• A feasible trust region method for nonlinear inequality constrained optimization
• An active set limited memory BFGS algorithm for bound constrained optimization
• On convergence of binary trust-region steepest descent
• An active set limited memory BFGS algorithm for large-scale bound constrained optimization

This page was built for publication: Convergence of Trust Region Algorithms for Optimization with Bounds when Strict Complementarity Does Not Hold

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3350686)