Descent methods for composite nondifferentiable optimization problems

From MaRDI portal





We present a framework for the development of globally defined descent algorithms for the minimization of non-differentiable objective functions \(F:=h\circ f\) with h convex. Within our structure the global convergence properties of the Cauchy, Modified Newton, Gauss-Newton, and Variable- Metric methods are easily established along with that of several new approaches. Examples illustrating the calculational techniques are provided.




Cited in
(59)








This page was built for publication: Descent methods for composite nondifferentiable optimization problems

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