Approximation of Copositive Programming via Linear Programming Using Second Order Sum of Square Decomposition
نویسندگان
چکیده
In this paper, we improve the previously known result of approximating the cone of copositive matrices. We approximate the cone of copos-itive matrices by a set of linear matrices inequalities using the second order sum of square decomposition. Hence, a copositive programming can be approximated more accurately by a linear programming.
منابع مشابه
Optimization over Structured Subsets of Positive Semidefinite Matrices via Column Generation
We develop algorithms to construct inner approximations of 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 generatio...
متن کاملComputing the Stability Number of a Graph via Semidefinite and Linear Programming
We study certain semidefinite and linear programming lifting approximation schemes for computing the stability number of a graph. Our work is based on and refines De Klerk and Pasechnik’s approach to approximating the stability number via copositive programming (SIAM J. Optim. 12 (2002), 875–892). We show that the exact value of the stability number α(G) is attained by the semidefinite approxim...
متن کاملCopositive Relaxation Beats Lagrangian Dual Bounds in Quadratically and Linearly Constrained Quadratic Optimization Problems
We study non-convex quadratic minimization problems under (possibly non-convex) quadratic and linear constraints, and characterize both Lagrangian and Semi-Lagrangian dual bounds in terms of conic optimization. While the Lagrangian dual is equivalent to the SDP relaxation (which has been known for quite a while, although the presented form, incorporating explicitly linear constraints, seems to ...
متن کاملRESOLUTION METHOD FOR MIXED INTEGER LINEAR MULTIPLICATIVE-LINEAR BILEVEL PROBLEMS BASED ON DECOMPOSITION TECHNIQUE
In this paper, we propose an algorithm base on decomposition technique for solvingthe mixed integer linear multiplicative-linear bilevel problems. In actuality, this al-gorithm is an application of the algorithm given by G. K. Saharidis et al for casethat the rst level objective function is linear multiplicative. We use properties ofquasi-concave of bilevel programming problems and decompose th...
متن کاملFinding the Number of Members with Certain Relationships in Social Networks and Big Size Organizations using Copositive Programming
In social networks and big size organizations, finding the number of members that all of them have a certain relationship w* is an important problem for managers, as well the number of members that none of them has not the relationship (w*). Considering the members as vertices and the relationship as edges, w* and w* denote the clique number and the number of edges in the independent graph, re...
متن کامل