Penalty function theory for general convex programming problems

DOI10.1007/BF00933282zbMath0349.90093OpenAlexW2009998384MaRDI QIDQ1235061

Hisashi Mine, Masao Fukushima

Publication date: 1978

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

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

Mathematics Subject Classification ID

Convex programming (90C25) Rate of convergence, degree of approximation (41A25)

Related Items

Variable penalty methods for constrained minimization, Generalized potentials in finite elastoplasticity

Cites Work

• Unnamed Item
• Unnamed Item
• Technical Note—Optimality Conditions and Recession Cones
• An Existence Theorem for Penalty Function Theory
• Convergence of Sequences of Convex Sets, Cones and Functions. II
• Generalized Penalty Methods in Topological Spaces
• An algorithm for solving nonlinear programming problems subject to nonlinear inequality constraints
• Convex Analysis
• A General Regularized Sequential Unconstrained Minimization Technique
• Convergence of sequences of convex sets, cones and functions