Exterior minimum-penalty path-following methods in semidefinite programming (Q1280099)
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 1260400
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Exterior minimum-penalty path-following methods in semidefinite programming |
scientific article; zbMATH DE number 1260400 |
Statements
Exterior minimum-penalty path-following methods in semidefinite programming (English)
0 references
17 May 1999
0 references
convex programming
0 references
semidefinite programming
0 references
linear matrix inequalities
0 references
linear programming
0 references
constraint-aggregation method
0 references
minimum-penalty path
0 references
exterior path-following methods
0 references
0.8348467946052551
0 references
0.7895609140396118
0 references
