Necessary and sufficient conditions for a penalty method to be exact
type: Item
instance of: scholarly article
title: Necessary and sufficient conditions for a penalty method to be exact
zbMATH Open document ID: 0325.90055
DOI: 10.1007/BF01681332
author: Dimitri P. Bertsekas
published in: Mathematical Programming
publication date: 1975-01-01T00:00:00Z
Mathematics Subject Classification ID: 90C25
Mathematics Subject Classification ID: 90C05
zbMATH DE Number: 3510087
MaRDI profile type: Publication
cites work: Variation of the penalty coefficient in linear programming problems
cites work: Constrained Optimization Using a Nondifferentiable Penalty Function
cites work: A Penalty Function Method Converging Directly to a Constrained Optimum
cites work: Exact penalty functions in nonlinear programming
cites work: Q5588268
cites work: New Conditions for Exactness of a Simple Penalty Function
cites work: Combined Primal–Dual and Penalty Methods for Convex Programming
cites work: Convex Analysis
cites work: An Exact Potential Method for Constrained Maxima
cites work: Non-Linear Programming Via Penalty Functions
description: scientific article; zbMATH DE number 3510087