A unified kernel function approach to primal-dual interior-point algorithms for convex quadratic SDO (Q634734): Difference between revisions
From MaRDI portal
Changed an Item |
Changed an Item |
||
| Property / describes a project that uses | |||
| Property / describes a project that uses: QSDP / rank | |||
Normal rank | |||
Revision as of 17:07, 29 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A unified kernel function approach to primal-dual interior-point algorithms for convex quadratic SDO |
scientific article |
Statements
A unified kernel function approach to primal-dual interior-point algorithms for convex quadratic SDO (English)
0 references
16 August 2011
0 references
This paper presents a unified approach to primal-dual interior-point algorithms for the convex quadratic semidefinite optimization (SDO) problem based on the eligible kernel functions. The authors show that every eligible kernel function gives rise to an interior-point algorithm for the convex quadratic semidefinite optimization problem. Iteration bounds for large and small update methods are obtained.
0 references
convex quadratic semidefinite optimization
0 references
kernel function
0 references
large and small update methods
0 references
iteration bound
0 references
primal-dual interior-point algorithms
0 references
