Globally Convergent Algorithms for Convex Programming

DOI10.1287/MOOR.6.3.437MaRDI QIDQ4745623zbMATH OpenOpenAlexFDO

Authors Eric Rosenberg

Publication date 1981

Published in Mathematics of Operations Research (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1287/moor.6.3.437

zbMATH Keywords

convergenceconvex approximating subproblemestimated solutionexact penalty functioniterative improvementline searchnon-differentiable objective and constraint functionssequential solution of subproblems

Mathematics Subject Classification ID

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

Cited in

(9)

• An objective penalty function method for nonlinear programming.
• An objective penalty function method for biconvex programming
• Exactness and algorithm of an objective penalty function
• A smoothing objective penalty function algorithm for inequality constrained optimization problems
• An M-objective penalty function algorithm under big penalty parameters
• Exact penalty functions and stability in locally Lipschitz programming
• The complexity of routing in~hierarchical PNNI networks
• Smoothing partially exact penalty function of biconvex programming
• On the smoothing of the square-root exact penalty function for inequality constrained optimization

This page was built for publication: Globally Convergent Algorithms for Convex Programming

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