An infeasible full-NT step interior point algorithm for CQSCO (Q503355)
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: An infeasible full-NT step interior point algorithm for CQSCO |
scientific article; zbMATH DE number 6674012
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | An infeasible full-NT step interior point algorithm for CQSCO |
scientific article; zbMATH DE number 6674012 |
Statements
An infeasible full-NT step interior point algorithm for CQSCO (English)
0 references
12 January 2017
0 references
This article studies the convex quadratic symmetric cone optimization problem based on Euclidean Jordan algebras. The article begins with an introduction to Euclidean Jordan algebra and its properties and a short overview of the literature. The author then presents an infeasible interior-point algorithm for solving this optimization problem, followed by an analysis of the properties of the algorithm. The article concludes with a section on numerical results performed using matlab.
0 references
convex quadratic symmetric cone optimization
0 references
interior-point method
0 references
infeasible method
0 references
Euclidean Jordan algebra
0 references
polynomial complexity
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0.8345272541046143
0 references
0.8174817562103271
0 references
0.8068985939025879
0 references
0.771332859992981
0 references
