A descent method with linear programming subproblems for nondifferentiable convex optimization (Q1924056)
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: A descent method with linear programming subproblems for nondifferentiable convex optimization |
scientific article; zbMATH DE number 934382
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A descent method with linear programming subproblems for nondifferentiable convex optimization |
scientific article; zbMATH DE number 934382 |
Statements
A descent method with linear programming subproblems for nondifferentiable convex optimization (English)
0 references
13 October 1996
0 references
proximal-type descent methods
0 references
direction-finding subproblem
0 references
nondifferentiable convex optimization
0 references
0 references
