Approximate level method for nonsmooth convex minimization
type: Item
instance of: scholarly article
title: Approximate level method for nonsmooth convex minimization
zbMATH Open document ID: 1237.90183
author: Peter Richtárik
published in: Journal of Optimization Theory and Applications
publication date: 2012-05-08T00:00:00Z
Mathematics Subject Classification ID: 90C25
Mathematics Subject Classification ID: 90C59
Mathematics Subject Classification ID: 90C31
zbMATH DE Number: 6031732
zbMATH Keywords: level method
zbMATH Keywords: approximate projections in relative scale
zbMATH Keywords: nonsmooth convex minimization
zbMATH Keywords: sensitivity analysis
zbMATH Keywords: large-scale optimization
MaRDI profile type: Publication
full work available at URL: s10957-011-9908-1
OpenAlex ID: W1964847011
cites work: The Cutting-Plane Method for Solving Convex Programs
cites work: Introductory lectures on convex optimization. A basic course.
cites work: An aggregate subgradient method for nonsmooth convex minimization
cites work: New variants of bundle methods
cites work: Q5187067
cites work: Minimization of unsmooth functionals
cites work: Variable target value subgradient method
cites work: The Efficiency of Subgradient Projection Methods for Convex Optimization, Part I: General Level Methods
cites work: The Efficiency of Subgradient Projection Methods for Convex Optimization, Part II: Implementations and Extensions
cites work: A method of projection onto an acute cone with level control in convex minimization
cites work: Residual Selection in A Projection Method for Convex Minimization Problems
cites work: Improved Algorithms for Convex Minimization in Relative Scale
cites work: Q4324980
DOI: 10.1007/S10957-011-9908-1
Recommended article: Q4241608
Recommended article: Level-set methods for convex optimization
Recommended article: Q4279388
Recommended article: Q4433689
Recommended article: Q4955970
Recommended article: Q4639406
Recommended article: Nonconvex approximations in unconstrained minimization
Recommended article: An approximate subgradient algorithm for unconstrained nonsmooth, nonconvex optimization
Recommended article: Approximate global minimization of nonconvex functions that are close to convex
Recommended article: Q3654522
description: scientific article; zbMATH DE number 6031732