Convex programming algorithms using smoothing of exact penalty functions

DOI10.1007/BF00968654MaRDI QIDQ1837629zbMATH OpenFDO

Authors A. Kaplan

Publication date 1983

Published in Siberian Mathematical Journal (Search for Journal in Brave)

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

zbMATH Keywords

convergence analysisdifferentiability of the objective functionpenalty function methodsequence of auxiliary programsunconstrained minimization

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Convex programming (90C25)

Cites work

• Convex Analysis
• scientific article; zbMATH DE number 3249572 (Why is no real title available?)
• scientific article; zbMATH DE number 3359250 (Why is no real title available?)
• Monotone Operators and the Proximal Point Algorithm

Cited in

(2)

• Coupling the auxiliary problem principle and epiconvergence theory to solve general variational inequalities
• Kaplan's penalty operator in approximation of a diffusion-absorption problem with a one-sided constraint

This page was built for publication: Convex programming algorithms using smoothing of exact penalty functions

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1837629)