Necessary and sufficient conditions for a penalty method to be exact (Q4090135): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Variation of the penalty coefficient in linear programming problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Constrained Optimization Using a Nondifferentiable Penalty Function / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Penalty Function Method Converging Directly to a Constrained Optimum / rank
 
Normal rank
Property / cites work
 
Property / cites work: Exact penalty functions in nonlinear programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5588268 / rank
 
Normal rank
Property / cites work
 
Property / cites work: New Conditions for Exactness of a Simple Penalty Function / rank
 
Normal rank
Property / cites work
 
Property / cites work: Combined Primal–Dual and Penalty Methods for Convex Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Convex Analysis / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Exact Potential Method for Constrained Maxima / rank
 
Normal rank
Property / cites work
 
Property / cites work: Non-Linear Programming Via Penalty Functions / rank
 
Normal rank

Latest revision as of 17:36, 12 June 2024

scientific article; zbMATH DE number 3510087
Language Label Description Also known as
English
Necessary and sufficient conditions for a penalty method to be exact
scientific article; zbMATH DE number 3510087

    Statements

    Identifiers