A minimization method for the sum of a convex function and a continuously differentiable function
From MaRDI portal
Publication:1134011
DOI10.1007/BF00935173zbMath0422.90070MaRDI QIDQ1134011
Publication date: 1981
Published in: Journal of Optimization Theory and Applications (Search for Journal in Brave)
convergence analysis; critical points; descent method; subgradients; nonconvex nondifferentiable optimization problems
Related Items
A successive quadratic programming method for a class of constrained nonsmooth optimization problems, Partial linearization methods in nonlinear programming, A parallel descent algorithm for convex programming