Carregant...
Carregant...

Vés al contingut (premeu Retorn)

A Maple package for semidefinite programming

Autor
Xhafa, F.; Navarro, G.
Tipus d'activitat
Document cientificotècnic
Data
1996-05-02
Codi
R96-28
Repositori
http://hdl.handle.net/2117/96476 Obrir en finestra nova
Resum
We present a package in Maple for solving Semidefinite Programming. Semidefinite Programming (SP) is the problem of optimizing a linear function of a symmetric matrix subject to linear equality constraints and the condition that the matrix of variables be positive semidefinite. SP is strong enough to represent combinatorial problems and very recently, it has been used to obtain good approximation algorithms for several problems, namely Max Cut, Max 2SAT, Graph Coloring, etc. All of them ...
Citació
Xhafa, F., Navarro, G. "A Maple package for semidefinite programming". 1996.
Paraules clau
Linear equality constraints, Maple, Optimization, SP, Semidefinite programming

Participants

Arxius