A Superlinearly Convergent Algorithm for One-Dimensional Constrained Minimization Problems with Convex Functions
From MaRDI portal
Publication:3661324
DOI10.1287/moor.8.2.185zbMath0514.90070OpenAlexW2087803168MaRDI QIDQ3661324
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
globally and superlinearly convergent algorithmlinear approximation of constrained functionone-dimensional constrained minimizationpenalized polyhedral step
Lua error in Module:PublicationMSCList at line 37: attempt to index local 'msc_result' (a nil value).
Related Items (4)
Penalty-proximal methods in convex programming ⋮ A constraint linearization method for nondifferentiable convex minimization ⋮ Stationarity and superlinear convergence of an algorithm for univariate locally lipschitz constrained minimization ⋮ Global and superlinear convergence of an algorithm for one-dimensional minimization of convex functions
This page was built for publication: A Superlinearly Convergent Algorithm for One-Dimensional Constrained Minimization Problems with Convex Functions
