Convergence analysis of some methods for minimizing a nonsmooth convex function
type: Item
instance of: scholarly article
title: Convergence analysis of some methods for minimizing a nonsmooth convex function
zbMATH Open document ID: 0907.90216
DOI: 10.1023/A:1022630801549
author: K. Appert
published in: Journal of Optimization Theory and Applications
publication date: 1999-02-11T00:00:00Z
Mathematics Subject Classification ID: 90C20
Mathematics Subject Classification ID: 90C15
Mathematics Subject Classification ID: 49J52
zbMATH DE Number: 1206544
zbMATH Keywords: nonsmooth convex optimization
zbMATH Keywords: proximal point method
zbMATH Keywords: bundle algorithm
zbMATH Keywords: stochastic programming
MaRDI profile type: Publication
cites work: Monotone Operators and the Proximal Point Algorithm
cites work: Partial Proximal Minimization Algorithms for Convex Pprogramming
cites work: A proximal-based deomposition method for compositions method for convex minimization problems
cites work: On the Douglas-Rachford splitting method and the proximal point algorithm for maximal monotone operators
cites work: A descent algorithm for nonsmooth convex optimization
cites work: A Globally and Superlinearly Convergent Algorithm for Nonsmooth Convex Minimization
cites work: On the Convergence of the Proximal Point Algorithm for Convex Minimization
cites work: New Proximal Point Algorithms for Convex Minimization
cites work: Augmented Lagrangians and Applications of the Proximal Point Algorithm in Convex Programming
cites work: Modified proximal point algorithm for extended linear-quadratic programming
cites work: Q3809587
cites work: Methods of descent for nondifferentiable optimization
cites work: Q3141900
cites work: Numerical methods for nondifferentiable convex optimization
cites work: Convergence of some algorithms for convex minimization
cites work: An aggregate subgradient method for nonsmooth convex minimization
cites work: Proximity control in bundle methods for convex nondifferentiable minimization
cites work: Global and superlinear convergence of an algorithm for one-dimensional minimization of convex functions
cites work: Q4312990
cites work: A quasi-second-order proximal bundle algorithm
cites work: Inexact subgradient methods with applications in stochastic programming
cites work: Subdifferential Convergence in Stochastic Programs
cites work: Designing approximation schemes for stochastic optimization problems, in particular for stochastic programs with recourse
cites work: Newton's method for quadratic stochastic programs with recourse
cites work: Stochastic Decomposition: An Algorithm for Two-Stage Linear Programs with Recourse
cites work: Q4309474
cites work: Epi‐consistency of convex stochastic programs
cites work: An SQP algorithm for extended linear-quadratic problems in stochastic programming
cites work: Imbedded Lattice Rules for Multidimensional Integration
cites work: Q4003879
cites work: Q4889887
cites work: Quasi-Random Methods for Estimating Integrals Using Relatively Small Samples
cites work: Q5652137
full work available at URL: a:1022630801549
OpenAlex ID: W1491680399
description: scientific article; zbMATH DE number 1206544