A saddle point characterization of exact regularization of non-convex programs

MaRDI QIDQ4906118zbMATH OpenFDO

Authors

Publication date 7 February 2013

Full work available at URL http://www.yokohamapublishers.jp/online2/oppjo/vol8/p27.html

zbMATH Keywords

exact regularizationLagrangian functionsaddle point

Mathematics Subject Classification ID

Nonconvex programming, global optimization (90C26) Nonlinear programming (90C30) Optimality conditions and duality in mathematical programming (90C46)

Recommendations

• New characterizations of exact regularization of non-convex programs
• Exact Regularization, and Its Connections to Normal Cone Identity and Weak Sharp Minima in Nonlinear Programming
• Exact Regularization of Convex Programs
• On regularity for constrained extremum problems. I: Sufficient optimality conditions
• Saddle point criteria and the exact minimax penalty function method in nonconvex programming

Cited in

(4)

• New characterizations of exact regularization of non-convex programs
• Exact Regularization, and Its Connections to Normal Cone Identity and Weak Sharp Minima in Nonlinear Programming
• Exact Regularization of Convex Programs
• Saddle point criteria and the exact minimax penalty function method in nonconvex programming

This page was built for publication: A saddle point characterization of exact regularization of non-convex programs

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