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:	Mathematics
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

id	th-cmuir.6653943832-50106
record_format	dspace
spelling	th-cmuir.6653943832-501062018-09-04T04:24:23Z Approximation of copositive programming via linear programming using second order sum of square decomposition Thanasak Mouktonglang Aroonwan Suebsriwichai Mathematics 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. 2018-09-04T04:24:23Z 2018-09-04T04:24:23Z 2011-12-01 Journal 1312885X 2-s2.0-84856527771 https://www.scopus.com/inward/record.uri?partnerID=HzOxMe3b&scp=84856527771&origin=inward http://cmuir.cmu.ac.th/jspui/handle/6653943832/50106
institution	Chiang Mai University
building	Chiang Mai University Library
country	Thailand
collection	CMU Intellectual Repository
topic	Mathematics
spellingShingle	Mathematics Thanasak Mouktonglang Aroonwan Suebsriwichai Approximation of copositive programming via linear programming using second order sum of square decomposition
description	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.
format	Journal
author	Thanasak Mouktonglang Aroonwan Suebsriwichai
author_facet	Thanasak Mouktonglang Aroonwan Suebsriwichai
author_sort	Thanasak Mouktonglang
title	Approximation of copositive programming via linear programming using second order sum of square decomposition
title_short	Approximation of copositive programming via linear programming using second order sum of square decomposition
title_full	Approximation of copositive programming via linear programming using second order sum of square decomposition
title_fullStr	Approximation of copositive programming via linear programming using second order sum of square decomposition
title_full_unstemmed	Approximation of copositive programming via linear programming using second order sum of square decomposition
title_sort	approximation of copositive programming via linear programming using second order sum of square decomposition
publishDate	2018
url	https://www.scopus.com/inward/record.uri?partnerID=HzOxMe3b&scp=84856527771&origin=inward http://cmuir.cmu.ac.th/jspui/handle/6653943832/50106
_version_	1681423530193846272

Approximation of copositive programming via linear programming using second order sum of square decomposition

Similar Items