An interior-point trust-region algorithm for general symmetric cone programming

Ye Lu, Ya-Xiang Yuan

Research output: Journal Publications and ReviewsRGC 21 - Publication in refereed journalpeer-review

17 Citations (Scopus)

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 languageEnglish
Pages (from-to)65-86
JournalSIAM Journal on Optimization
Volume18
Issue number1
DOIs
Publication statusPublished - 2007
Externally publishedYes

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