A path following algorithm for a class of convex programming problems (Q4016864)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 89435
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A path following algorithm for a class of convex programming problems |
scientific article; zbMATH DE number 89435 |
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
0.8183215856552124
0 references
0.8149102330207825
0 references
0.8069127202033997
0 references