New characterizations of exact regularization of non-convex programs

zbMATH Open1353.90114MaRDI QIDQ2836065FDOQ2836065

Authors: S. Deng 

Publication date: 7 December 2016

Published in: Pacific Journal of Optimization (Search for Journal in Brave)

Full work available at URL: http://www.yokohamapublishers.jp/online2/oppjo/vol12/p791.html

Recommendations

• A saddle point characterization of exact regularization of non-convex programs
• Exact Regularization of Convex Programs
• Exact Regularization, and Its Connections to Normal Cone Identity and Weak Sharp Minima in Nonlinear Programming
• Optimality and complexity for constrained optimization problems with nonconvex regularization
• On constrained optimization with nonconvex regularization
• scientific article; zbMATH DE number 5793164
• The regularized feasible directions method for nonconvex optimization
• scientific article; zbMATH DE number 1264396
• A regularized Newton method for equality constrained nonconvex optimization
• Characterization of regularity for semi-infinite convex programming

zbMATH Keywords

stabilitysaddle pointLagrangian functionexact penalizationexact regularizationand calmness

Mathematics Subject Classification ID

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

Cited In (3)

• A saddle point characterization of exact regularization of non-convex programs
• Exact Regularization of Convex Programs
• Exact Regularization, and Its Connections to Normal Cone Identity and Weak Sharp Minima in Nonlinear Programming

This page was built for publication: New characterizations 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 Q2836065)