An infeasible full-NT step interior point algorithm for CQSCO (Q503355): Difference between revisions
From MaRDI portal
Changed an Item |
Changed an Item |
||
| Property / describes a project that uses | |||
| Property / describes a project that uses: Matlab / rank | |||
Normal rank | |||
Revision as of 15:34, 29 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | An infeasible full-NT step interior point algorithm for CQSCO |
scientific article |
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
