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 copositive matrices by a set of linear matrices inequalities using the second order sum of square decomposition. Hence, a copositive programming can be approximated more...

Full description

Saved in:
Bibliographic Details
Main Authors: Thanasak Mouktonglang, Aroonwan Suebsriwichai
Format: Journal
Published: 2018
Subjects:
Online Access:https://www.scopus.com/inward/record.uri?partnerID=HzOxMe3b&scp=84856527771&origin=inward
http://cmuir.cmu.ac.th/jspui/handle/6653943832/50106
Tags: Add Tag
No Tags, Be the first to tag this record!
Institution: Chiang Mai University
Description
Summary:In this paper, we improve the previously known result of approximating the cone of copositive matrices. We approximate the cone of copositive 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.