Optimization Online


Facial reduction heuristics and the motivational example of mixed-integer conic optimization

Henrik A. Friberg (metronware***at***gmail.com)

Abstract: Facial reduction heuristics are developed in the interest of added performance and reliability in methods for mixed-integer conic optimization. Specifically, the process of branch-and-bound is shown to spawn subproblems for which the conic relaxations are difficult to solve, and the objective bounds of linear relaxations are arbitrarily weak. While facial reduction algorithms already exist to deal with these issues, heuristic variants represent a very potent supplement due to their inherent speed and accuracy. The paper covers a family of heuristics based on linear optimization, subgradient matching, single-cone analysis, and cone factorization.

Keywords: Facial reduction, conic optimization, mixed-integer optimization

Category 1: Linear, Cone and Semidefinite Programming

Category 2: Integer Programming


Download: [PDF]

Entry Submitted: 02/16/2016
Entry Accepted: 02/16/2016
Entry Last Modified: 02/24/2016

Modify/Update this entry

  Visitors Authors More about us Links
  Subscribe, Unsubscribe
Digest Archive
Search, Browse the Repository


Coordinator's Board
Classification Scheme
Give us feedback
Optimization Journals, Sites, Societies
Mathematical Optimization Society