A primal-dual algorithm for nonlinear programming exploiting negative curvature directions
From MaRDI portal
Publication:428494
DOI10.3934/NACO.2011.1.509zbMATH Open1241.90143OpenAlexW2317588945MaRDI QIDQ428494FDOQ428494
Authors: Gianni Di Pillo, Giampaolo Liuzzi, Stefano Lucidi
Publication date: 22 June 2012
Published in: Numerical Algebra, Control and Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.3934/naco.2011.1.509
Recommendations
- Convergence to Second-Order Stationary Points of a Primal-Dual Algorithm Model for Nonlinear Programming
- Using negative curvature in solving nonlinear programs
- Second-order negative-curvature methods for box-constrained and general constrained optimization
- Nonconvex optimization using negative curvature within a modified linesearch
- Convergence to second-order stationary points in inequality constrained optimization
Cited In (3)
- A second-order optimality condition with first- and second-order complementarity associated with global convergence of algorithms
- Inequality constrained stochastic nonlinear optimization via active-set sequential quadratic programming
- An augmented Lagrangian interior-point method using directions of negative curvature
This page was built for publication: A primal-dual algorithm for nonlinear programming exploiting negative curvature directions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q428494)