A descent method with linear programming subproblems for nondifferentiable convex optimization (Q1924056): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1007/bf01592242 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W1976285162 / rank | |||
Normal rank | |||
Latest revision as of 10:53, 30 July 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A descent method with linear programming subproblems for nondifferentiable convex optimization |
scientific article |
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
