Sufficient conditions for a globally exact penalty function without convexity

DOI10.1007/BFb0120980zbMath0497.90058OpenAlexW79588614MaRDI QIDQ3962789

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 programmingglobal minimizerscontingent coneclosed 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)

Related Items (10)

Linear programming with nonparametric penalty programs and iterated thresholding ⋮ Exact penalties and sufficient conditions for optimality in nonsmooth optimization ⋮ Exact penalty functions and stability in locally Lipschitz programming ⋮ New simple exact penalty function for constrained minimization ⋮ Exact barrier function methods for Lipschitz programs ⋮ An Interior-Point $$\boldsymbol{\ell_{1}}$$ -Penalty Method for Nonlinear Optimization ⋮ Second-order analysis of penalty function ⋮ Second-Order Smoothing Objective Penalty Function for Constrained Optimization Problems ⋮ Théorie de la pénalisation exacte ⋮ 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