Penalty methods for mathematical programming in \(E^n\) with general constraint sets

DOI10.1007/BF00926603zbMath0187.41904MaRDI QIDQ2537022

Anthony V. Fiacco

Publication date: 1970

Published in: Journal of Optimization Theory and Applications (Search for Journal in Brave)

zbMATH Keywords

mathematical programmingpenalty methodsgeneral constraint sets

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Integer programming (90C10)

Related Items (5)

Variable penalty methods for constrained minimization ⋮ Interior penalty methods for finite element approximations of the Signorini problem in elastostatics ⋮ THE EFFICIENT FRONTIER OF LONG-SHORT PORTFOLIOS ⋮ Convergence properties of local solutions of sequences of mathematical programming problems in general spaces ⋮ A hybrid variable penalty method for nonlinear programming

Cites Work

• Unnamed Item
• Unnamed Item
• A new method for solving conditioned maxima problems
• The Created Response Surface Technique for Optimizing Nonlinear, Restrained Systems
• Generalized Penalty-Function Concepts in Mathematical Optimization
• Extensions of SUMT for Nonlinear Programming: Equality Constraints and Extrapolation
• The Sequential Unconstrained Minimization Technique (SUMT) Without Parameters
• Non-Linear Programming Via Penalty Functions
• The Slacked Unconstrained Minimization Technique for Convex Programming
• Generalized Penalty Methods in Topological Spaces
• On a Method of Courant for Minimizing Functionals
• Variational methods for the solution of problems of equilibrium and vibrations

This page was built for publication: Penalty methods for mathematical programming in \(E^n\) with general constraint sets