Abstract
In this paper we present a new algorithm for solving the second order cone programming problems which we call the Q method. This algorithm is an extension of the Q method of Alizadeh Haeberly and Overton for the semidefinite programming problem.
| Original language | English (US) |
|---|---|
| Pages (from-to) | 208-213 |
| Number of pages | 6 |
| Journal | Unknown Journal |
| State | Published - 2001 |
All Science Journal Classification (ASJC) codes
- General Engineering
Keywords
- Interior point methods
- Jordan algebra
- Second order cone programming
- Semidefinite programming
Fingerprint
Dive into the research topics of 'The Q method for the second-order cone programming'. Together they form a unique fingerprint.Cite this
- APA
- Author
- BIBTEX
- Harvard
- Standard
- RIS
- Vancouver