Simplified infeasible interior-point algorithm for SDO using full Nesterov-Todd step (Q411535)
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: Simplified infeasible interior-point algorithm for SDO using full Nesterov-Todd step |
scientific article; zbMATH DE number 6022122
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Simplified infeasible interior-point algorithm for SDO using full Nesterov-Todd step |
scientific article; zbMATH DE number 6022122 |
Statements
Simplified infeasible interior-point algorithm for SDO using full Nesterov-Todd step (English)
0 references
4 April 2012
0 references
The author considers semidefinite optimization (SDO) problems of the form \[ \min C\bullet X\qquad\text{s.t. }A_i\bullet X= b,\quad i= 1,2,\dots,\quad X\succ 0 \] and propose a primal-dual infeasible interior-point algorithm that uses full Nesterov-Todd steps with a different feasibility step.
0 references
semidefinite optimization
0 references
infeasible interior-point method
0 references
primal-dual method
0 references
polynomial complexity
0 references
Nesterov-Todd steps
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0.94343185
0 references
0.9414281
0 references
0.9359655
0 references
0.93219763
0 references
0.9261043
0 references
0.9257869
0 references
0.9233029
0 references
0.9226221
0 references
