A path following algorithm for a class of convex programming problems (Q4016864): 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/bf01416235 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W1966090303 / rank | |||
Normal rank | |||
Latest revision as of 10:35, 30 July 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A path following algorithm for a class of convex programming problems |
scientific article |
Statements
A path following algorithm for a class of convex programming problems (English)
0 references
16 January 1993
0 references
entropy optimization
0 references
scaled Lipschitz condition
0 references
primal-dual path following interior algorithm
0 references
linearly constrained convex programming problems
0 references
