Buscar
Mostrando ítems 1-10 de 220
A sensitivity result for quadratic semidefinite programs with an application to a sequential quadratic semidefinite programming algorithm
(SOC BRASILEIRA MATEMATICA APLICADA & COMPUTACIONAL, 2012)
A sensitivity result for quadratic semidefinite programs with an application to a sequential quadratic semidefinite programming algorithm
(SOC BRASILEIRA MATEMATICA APLICADA & COMPUTACIONAL, 2012)
SEMIDEFINITE PROGRAMMING BASED ALGORITHMS for the SPARSEST CUT PROBLEM
(Cambridge Univ Press, 2011-04-01)
In this paper we analyze a known relaxation for the Sparsest Cut problem based on positive semidefinite constraints, and we present a branch and bound algorithm and heuristics based on this relaxation. the relaxed formulation ...
Characterizing Q-linear transformations for semidefinite linear complementarity problems
(PERGAMON-ELSEVIER SCIENCE LTD, 2012-02)
In this paper we introduce a new class, called F, of linear transformations defined from the space of real n x n symmetric matrices into itself. Within this new class, we show the equivalence between Q- and Q(b)-transformations. ...
SEMIDEFINITE PROGRAMMING BASED ALGORITHMS FOR THE SPARSEST CUT PROBLEM
(Cambridge Univ PressNew YorkEUA, 2011)
Solving matrix inequalities whose unknowns are matrices
(Siam PublicationsPhiladelphiaEUA, 2006)
Some advances on Lovász-Schrijver semidefinite programming relaxations of the fractional stable set polytope
(Elsevier Science, 2014-02)
We study Lovász and Schrijver's hierarchy of relaxations based on positive semidefiniteness constraints derived from the fractional stable set polytope. We show that there are graphs G for which a single application of the ...