Minimization methods based on approximation of the initial functional by a convex functional

DOI10.1016/0041-5553(70)90033-9zbMath0261.90052OpenAlexW1999339825MaRDI QIDQ5677295

Yu. M. Danilin

Publication date: 1972

Published in: USSR Computational Mathematics and Mathematical Physics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0041-5553(70)90033-9

Mathematics Subject Classification ID

Convex programming (90C25)

Related Items

Newton-Goldstein convergence rates for convex constrained minimization problems with singular solutions ⋮ Newton's method for singular constrained optimization problems ⋮ Rates of convergence for adaptive Newton methods