A relaxed-certificate facial reduction algorithm based on subspace intersection

Henrik Alsing Friberg

Research output: Contribution to journalJournal articleResearchpeer-review


A “facial reduction”-like regularization algorithm is established for general conic optimization problems by relaxing requirements on the reduction certificates. This yields a rapid subspace reduction algorithm challenged only by representational issues of the regularized cone. A condition for practical usage is analyzed and shown to always be satisfied for single second-order cone optimization problems. Should the condition fail on some other class of instances, only partial regularization is achieved based on the success of the individual subspace intersection.
Original languageEnglish
JournalOperations Research Letters
Issue number6
Pages (from-to)718-722
Publication statusPublished - 2016


  • Conic optimization
  • Facial reduction
  • Second-order cones
  • Subspace intersection

Fingerprint Dive into the research topics of 'A relaxed-certificate facial reduction algorithm based on subspace intersection'. Together they form a unique fingerprint.

Cite this