Convergence to Second-Order Stationary Points of a Primal-Dual Algorithm Model for Nonlinear Programming
From MaRDI portal
Publication:5387954
DOI10.1287/moor.1050.0150zbMath1278.90375OpenAlexW2075234603MaRDI QIDQ5387954
Laura Palagi, Stefano Lucidi, Gianni Di Pillo
Publication date: 27 May 2008
Published in: Mathematics of Operations Research (Search for Journal in Brave)
Full work available at URL: https://semanticscholar.org/paper/1290150d99ecdf3994d5039fff7b074b05af5a5e
nonlinear programmingprimal-dual algorithmaugmented Lagrangian functionsecond-order stationary point
Related Items
Second-order negative-curvature methods for box-constrained and general constrained optimization, A second-order optimality condition with first- and second-order complementarity associated with global convergence of algorithms, An inexact Newton method for nonconvex equality constrained optimization, Second-order enhanced optimality conditions and constraint qualifications, Complexity analysis of interior-point methods for second-order stationary points of nonlinear semidefinite optimization problems, Inequality constrained stochastic nonlinear optimization via active-set sequential quadratic programming, Finding second-order stationary points in constrained minimization: a feasible direction approach, Some results on augmented Lagrangians in constrained global optimization via image space analysis, Augmented Lagrangian functions for cone constrained optimization: the existence of global saddle points and exact penalty property
Uses Software
