Informatica Logo

INFORMATICA
International Journal

Main Page
Editorial Board
Abstracting/Indexing
Instructions to Authors
Subscription Information


Contents
Author Index
Papers in Production

INFORMATICA, 2011, Vol. 22, No. 4, 601-614
© Institute of Mathematics and Informatics,

ISSN 0868-4952

Copositive Programming by Simplicial Partition

Julius ZILINSKAS

Vilnius University, Institute of Mathematics and Informatics Akademijos 4, LT-08663 Vilnius, Lithuania E-mail: julius.zilinskas@mii.vu.lt

Abstract

Copositivity plays an important role in combinatorial and quadratic optimization since setting up a linear optimization problem over the copositive cone leads to exact reformulations of combinatorial and quadratic programming problems. A copositive programming problem may be approached checking copositivity of several matrices built with different values of the variable and the solution is the extreme value for which the matrix is copositive. However, this approach has some shortcomings. In this paper, we develop a simplicial partition algorithm for copositive programming to overcome the shortcomings. The algorithm has been investigated experimentally on a number of problems.

Keywords:

simplicial partition
copositive programming
copositive matrices

To preview Lithuanian abstract see full article text

PDFTo preview full article text in PDF format click here

Get Free ReaderYou could obtain free Acrobat Reader from Adobe


TopTop Copyright © INFORMATICA, Vilnius University Institute of Mathematics and Informatics, 2010