- | ||||
|
![]()
|
Optimization over Structured Subsets of Positive Semidefinite Matrices via Column Generation
Amir Ali Ahmadi (a_a_a Abstract: We develop algorithms for inner approximating the cone of positive semidefinite matrices via linear programming and second order cone programming. Starting with an initial linear algebraic approximation suggested recently by Ahmadi and Majumdar, we describe an iterative process through which our approximation is improved at every step. This is done using ideas from column generation in large-scale linear and integer programming. We then apply these techniques to approximate the sum of squares cone in a nonconvex polynomial optimization setting, and the copositive cone for a discrete optimization problem. Keywords: Category 1: Linear, Cone and Semidefinite Programming Category 2: Combinatorial Optimization (Approximation Algorithms ) Category 3: Nonlinear Optimization Citation: Download: [PDF] Entry Submitted: 12/16/2015 Modify/Update this entry | ||
Visitors | Authors | More about us | Links | |
Subscribe, Unsubscribe Digest Archive Search, Browse the Repository
|
Submit Update Policies |
Coordinator's Board Classification Scheme Credits Give us feedback |
Optimization Journals, Sites, Societies | |
![]() |