Sufficient conditions for a globally exact penalty function without convexity

DOI10.1007/BFB0120980MaRDI QIDQ3962789zbMATH OpenOpenAlexFDO

Authors Jamie J. Goode, Mokhtar S. Bazaraa

Publication date 1982

Published in Optimality and Stability in Mathematical Programming (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/bfb0120980

zbMATH Keywords

nonconvex programmingcontingent coneglobal minimizersclosed convex coneglobal optimal solutionsexistence of globally exact penalty functionhypertangents coneKuhn-Tucker Lagrangian multiplierslower bound on penalty parameter

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Nonlinear programming (90C30) Numerical methods based on nonlinear programming (49M37)

Cited in

(10)

• Exact penalty functions and stability in locally Lipschitz programming
• Exact barrier function methods for Lipschitz programs
• Linear programming with nonparametric penalty programs and iterated thresholding
• Second-order analysis of penalty function
• Exact penalties and sufficient conditions for optimality in nonsmooth optimization
• Théorie de la pénalisation exacte
• Second-Order Smoothing Objective Penalty Function for Constrained Optimization Problems
• New simple exact penalty function for constrained minimization
• An interior-point \(\ell_1\)-penalty method for nonlinear optimization
• Pseudonormality and a Lagrange multiplier theory for constrained optimization

This page was built for publication: Sufficient conditions for a globally exact penalty function without convexity

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