A general approach to convergence properties of some methods for nonsmooth convex optimization

DOI10.1007/s002459900086zbMath0910.90228OpenAlexW2001674163MaRDI QIDQ1265406

K. Appert

Publication date: 28 September 1998

Published in: Applied Mathematics and Optimization (Search for Journal in Brave)

Full work available at URL: http://hdl.handle.net/2027.42/42374

zbMATH Keywords

global convergenceconvergence ratenonsmooth convex minimization\(\varepsilon\)-subgradient

Mathematics Subject Classification ID

Convex programming (90C25) Nonlinear programming (90C30) Nonsmooth analysis (49J52) Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming) (90C33)

Related Items (11)

Newton projection method as applied to assembly simulation ⋮ On solutions and duality of nonlinear nonsmooth fractional programs ⋮ A modified PRP conjugate gradient algorithm with nonmonotone line search for nonsmooth convex optimization problems ⋮ 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 ⋮ An SQP-type method and its application in stochastic programs ⋮ Convergence analysis on an accelerated proximal point algorithm for linearly constrained optimization problems ⋮ A modified Polak-Ribière-Polyak conjugate gradient algorithm for nonsmooth convex programs ⋮ A limited memory BFGS subspace algorithm for bound constrained nonsmooth problems ⋮ Inexact proximal point algorithms and descent methods in optimization ⋮ A modified Hestenes and Stiefel conjugate gradient algorithm for large-scale nonsmooth minimizations and nonlinear equations

This page was built for publication: A general approach to convergence properties of some methods for nonsmooth convex optimization