A Superlinearly Convergent Algorithm for One-Dimensional Constrained Minimization Problems with Convex Functions

DOI10.1287/MOOR.8.2.185zbMATH Open0514.90070OpenAlexW2087803168MaRDI QIDQ3661324FDOQ3661324

Robert Mifflin

Publication date: 1983

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

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

zbMATH Keywords

globally and superlinearly convergent algorithmlinear approximation of constrained functionone-dimensional constrained minimizationpenalized polyhedral step

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Convex programming (90C25) Methods of successive quadratic programming type (90C55)

Cited In (4)

• Penalty-proximal methods in convex programming
• A constraint linearization method for nondifferentiable convex minimization
• Global and superlinear convergence of an algorithm for one-dimensional minimization of convex functions
• Stationarity and superlinear convergence of an algorithm for univariate locally lipschitz constrained minimization

This page was built for publication: A Superlinearly Convergent Algorithm for One-Dimensional Constrained Minimization Problems with Convex Functions

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