Sciweavers

Share
45 search results - page 1 / 9
» Semidefinite Programs: New Search Directions, Smoothing-Type...
Sort
View
SIAMJO
2002
149views more  SIAMJO 2002»
11 years 1 months ago
Semidefinite Programs: New Search Directions, Smoothing-Type Methods, and Numerical Results
Motivated by some results for linear programs and complementarity problems, this paper gives some new characterizations of the central path conditions for semidefinite programs. Ex...
Christian Kanzow, Christian Nagel
SIAMJO
2002
96views more  SIAMJO 2002»
11 years 1 months ago
Lagrangian Dual Interior-Point Methods for Semidefinite Programs
This paper proposes a new predictor-corrector interior-point method for a class of semidefinite programs, which numerically traces the central trajectory in a space of Lagrange mul...
Mituhiro Fukuda, Masakazu Kojima, Masayuki Shida
SODA
2010
ACM
216views Algorithms» more  SODA 2010»
11 years 11 months ago
On linear and semidefinite programming relaxations for hypergraph matching
The hypergraph matching problem is to find a largest collection of disjoint hyperedges in a hypergraph. This is a well-studied problem in combinatorial optimization and graph theo...
Yuk Hei Chan, Lap Chi Lau
CORR
2010
Springer
93views Education» more  CORR 2010»
11 years 1 months ago
Parallelized Solution to Semidefinite Programmings in Quantum Complexity Theory
In this paper we present an equilibrium value based framework for solving SDPs via the multiplicative weight update method which is different from the one in Kale's thesis [K...
Xiaodi Wu
CP
2005
Springer
11 years 7 months ago
Mind the Gaps: A New Splitting Strategy for Consistency Techniques
Classical methods for solving numerical CSPs are based on a branch and prune algorithm, a dichotomic enumeration process interleaved with a consistency ļ¬ltering algorithm. In man...
Heikel Batnini, Claude Michel, Michel Rueher
books