A new method for nonsmooth convex optimization

DOI10.1155/S1025583498000101zbMath0903.90131MaRDI QIDQ1386698

D. Massart

Publication date: 12 July 1998

Published in: Journal of Inequalities and Applications (Search for Journal in Brave)

Full work available at URL: https://eudml.org/doc/119651

zbMATH Keywords

global and superlinear convergenceproximal minimizationproper closed convex function

Mathematics Subject Classification ID

Convex programming (90C25) Nonsmooth analysis (49J52) Linear programming (90C05)

Related Items (11)

A modified Dai-Liao conjugate gradient method for solving unconstrained optimization and image restoration problems ⋮ Multivariate spectral gradient algorithm for nonsmooth convex optimization problems ⋮ New conjugacy condition and related new conjugate gradient methods for unconstrained optimization ⋮ Gradient trust region algorithm with limited memory BFGS update for nonsmooth convex minimization ⋮ A trust region algorithm with adaptive cubic regularization methods for nonsmooth convex minimization ⋮ A generic result in vector optimization ⋮ The optimization for the inequalities of power means ⋮ A modified Polak-Ribière-Polyak conjugate gradient algorithm for nonsmooth convex programs ⋮ Some new step-size rules for optimization problems ⋮ Improved smoothing Newton methods for \(P_0\) nonlinear complementarity problems ⋮ A modified Hestenes and Stiefel conjugate gradient algorithm for large-scale nonsmooth minimizations and nonlinear equations

This page was built for publication: A new method for nonsmooth convex optimization