Convergence of some algorithms for convex minimization (Q1321649)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Convergence of some algorithms for convex minimization |
scientific article; zbMATH DE number 558697
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Convergence of some algorithms for convex minimization |
scientific article; zbMATH DE number 558697 |
Statements
Convergence of some algorithms for convex minimization (English)
0 references
28 April 1994
0 references
The authors present unified techniques to establish convergence of various minimization methods related to subgradient-descent type algorithms. In particular, prox-iteration schemes, bundle methods and the classical subgradient optimization algorithms are discussed.
0 references
nondifferentiable optimization
0 references
convergence of various minimization methods
0 references
subgradient-descent type algorithms
0 references
prox-iteration schemes
0 references
bundle methods
0 references
subgradient optimization
0 references
0 references
0 references
