1. CMU Intellectual Repository
  2. Academic Support Units
  3. Chiang Mai University Library
  4. CMUL: Journal Articles
Please use this identifier to cite or link to this item: http://cmuir.cmu.ac.th/jspui/handle/6653943832/50106
Full metadata record
DC FieldValueLanguage
dc.contributor.authorThanasak Mouktonglangen_US
dc.contributor.authorAroonwan Suebsriwichaien_US
dc.date.accessioned2018-09-04T04:24:23Z-
dc.date.available2018-09-04T04:24:23Z-
dc.date.issued2011-12-01en_US
dc.identifier.issn1312885Xen_US
dc.identifier.other2-s2.0-84856527771en_US
dc.identifier.urihttps://www.scopus.com/inward/record.uri?partnerID=HzOxMe3b&scp=84856527771&origin=inwarden_US
dc.identifier.urihttp://cmuir.cmu.ac.th/jspui/handle/6653943832/50106-
dc.description.abstractIn 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.en_US
dc.subjectMathematicsen_US
dc.titleApproximation of copositive programming via linear programming using second order sum of square decompositionen_US
dc.typeJournalen_US
article.title.sourcetitleApplied Mathematical Sciencesen_US
article.volume5en_US
article.stream.affiliationsChiang Mai Universityen_US
article.stream.affiliationsCenter of Excellence in Mathematicsen_US
Appears in Collections:CMUL: Journal Articles

Files in This Item:
There are no files associated with this item.
Show simple item record


Items in CMUIR are protected by copyright, with all rights reserved, unless otherwise indicated.