Abstract
An interior-point trust-region algorithm is proposed for minimizing a general (nonconvex) quadratic objective function in the intersection of a symmetric cone and an affine subspace. The algorithm uses a trust-region model to ensure descent on a suitable merit function. Global first-order and second-order convergence results are proved. Numerical results are presented. © 2007 Society for Industrial and Applied Mathematics.
| Original language | English |
|---|---|
| Pages (from-to) | 65-86 |
| Journal | SIAM Journal on Optimization |
| Volume | 18 |
| Issue number | 1 |
| DOIs | |
| Publication status | Published - 2007 |
| Externally published | Yes |
Research Keywords
- Interior-point algorithm
- Symmetric cone
- Trust-region subproblem
Fingerprint
Dive into the research topics of 'An interior-point trust-region algorithm for general symmetric cone programming'. Together they form a unique fingerprint.Cite this
- APA
- Author
- BIBTEX
- Harvard
- Standard
- RIS
- Vancouver