A full-NT-step infeasible interior-point algorithm for SDP based on kernel functions (Q627154)
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: A full-NT-step infeasible interior-point algorithm for SDP based on kernel functions |
scientific article; zbMATH DE number 5853794
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A full-NT-step infeasible interior-point algorithm for SDP based on kernel functions |
scientific article; zbMATH DE number 5853794 |
Statements
A full-NT-step infeasible interior-point algorithm for SDP based on kernel functions (English)
0 references
21 February 2011
0 references
Primal and dual semidefinite programming problems are formulated and an infeasible interior-point algortithm with full Nesterov-Todd steps is proposed for solving the problems. The main iteration consists of a feasibility step and several centrality steps. The classic logarithmic barrier function as well as a new specific kernel function with a finite value on the boundary are used in the algorithm. A polynomial complexity of the proposed method is proved.
0 references
semidefinite programming
0 references
full Nesterov-Todd steps
0 references
infeasible interior-point methods
0 references
polynomial complexity
0 references
kernel functions
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0.94414043
0 references
0.94094956
0 references
0.94019544
0 references
0.93001235
0 references
0.92644465
0 references
0.92331266
0 references
0.92152584
0 references
