Convergence of Affine-Scaling Interior-Point Methods with Line Search for Box Constrained Optimization

DOI10.1080/01630563.2010.532269zbMath1213.65086OpenAlexW2059447235MaRDI QIDQ3083522

Zhongwen Chen, Quan Liu

Publication date: 22 March 2011

Published in: Numerical Functional Analysis and Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/01630563.2010.532269

zbMATH Keywords

strict complementarityinterior-point methodsuperlinear convergenceline searchsimple bounds

Mathematics Subject Classification ID

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

Related Items

Impulse noise removal by an adaptive trust-region method, A class of improved affine-scaling interior-point secant filter methods for minimization with equality and box constraints

Cites Work

• On affine-scaling interior-point Newton methods for nonlinear minimization with bound constraints
• Convergence properties of trust region methods for linear and convex constraints
• A new trust region algorithm for bound constrained minimization
• On the convergence of interior-reflective Newton methods for nonlinear minimization subject to bounds
• Family of projected descent methods for optimization problems with simple bounds
• A trust-region strategy for minimization on arbitrary domains
• Superlinear and quadratic convergence of affine-scaling interior-point Newton methods for problems with simple bounds without strict complementarity assumption
• Newton Methods For Large-Scale Linear Inequality-Constrained Minimization
• Computing a Trust Region Step
• Convergence of Trust Region Algorithms for Optimization with Bounds when Strict Complementarity Does Not Hold
• A New Active Set Algorithm for Box Constrained Optimization
• Global Convergence of a Class of Trust Region Algorithms for Optimization with Simple Bounds
• Correction to the Paper on Global Convergence of a Class of Trust Region Algorithms for Optimization with Simple Bounds
• On the Solution of Large Quadratic Programming Problems with Bound Constraints
• Exposing Constraints
• An Active Set Newton Algorithm for Large-Scale Nonlinear Programs with Box Constraints
• Newton's Method for Large Bound-Constrained Optimization Problems
• Projected Newton Methods for Optimization Problems with Simple Constraints
• An Interior Trust Region Approach for Nonlinear Minimization Subject to Bounds
• A nonmonotone trust region method for nonlinear programming with simple bound constraints