A Global Convergence Theory for Dennis, El-Alem, and Maciel's Class of Trust-Region Algorithms for Constrained Optimization without Assuming Regularity
From MaRDI portal
Publication:4702318
DOI10.1137/S1052623497331762zbMath0957.65059MaRDI QIDQ4702318
Publication date: 24 November 1999
Published in: SIAM Journal on Optimization (Search for Journal in Brave)
global convergence; constrained optimization; nonlinear programming; trust region method; stationary points; augmented Lagrangian; regularity assumption; equality constrained problems; Mayer-Bliss points; quasi-normal step
Related Items
Global convergence of a nonmonotone filter method for equality constrained optimization, Nonlinear programming without a penalty function or a filter, Nonmonotone trust-region method for nonlinear programming with general constraints and simple bounds, A global convergence theory for an active-trust-region algorithm for solving the general nonlinear programing problem., A multiplier active-set trust-region algorithm for solving constrained optimization problem, A penalty-free-type nonmonotone trust-region method for nonlinear constrained optimization, A robust trust region method for nonlinear optimization with inequality constraint, A Trust Region Algorithm with Memory for Equality Constrained Optimization