Sciweavers

Share
warning: Creating default object from empty value in /var/www/modules/taxonomy/taxonomy.module on line 1416.
SIAMJO
2010
107views more  SIAMJO 2010»
11 years 1 months ago
Error Bounds for Some Semidefinite Programming Approaches to Polynomial Minimization on the Hypercube
We consider the problem of minimizing a polynomial on the hypercube [0, 1]n and derive new error bounds for the hierarchy of semidefinite programming approximations to this problem...
Etienne de Klerk, Monique Laurent
MP
2010
97views more  MP 2010»
11 years 1 months ago
Semidefinite representation of convex sets
Let S = {x Rn : g1(x) 0,
J. William Helton, Jiawang Nie
SIAMJO
2008
141views more  SIAMJO 2008»
11 years 6 months ago
Constraint Nondegeneracy, Strong Regularity, and Nonsingularity in Semidefinite Programming
It is known that the Karush-Kuhn-Tucker (KKT) conditions of semidefinite programming can be reformulated as a nonsmooth system via the metric projector over the cone of symmetric ...
Zi Xian Chan, Defeng Sun
SIAMJO
2008
66views more  SIAMJO 2008»
11 years 6 months ago
Further Relaxations of the Semidefinite Programming Approach to Sensor Network Localization
Recently, a semidefinite programming (SDP) relaxation approach has been proposed to solve the sensor network localization problem. Although it achieves high accuracy in estimating ...
Zizhuo Wang, Song Zheng, Yinyu Ye, Stephen Boyd
MP
2008
81views more  MP 2008»
11 years 6 months ago
An inexact primal-dual path following algorithm for convex quadratic SDP
Abstract We propose primal-dual path-following Mehrotra-type predictorcorrector methods for solving convex quadratic semidefinite programming (QSDP) problems of the form: minX{1 2 ...
Kim-Chuan Toh
JSAT
2006
114views more  JSAT 2006»
11 years 6 months ago
Semidefinite Optimization Approaches for Satisfiability and Maximum-Satisfiability Problems
Semidefinite optimization, commonly referred to as semidefinite programming, has been a remarkably active area of research in optimization during the last decade. For combinatoria...
Miguel F. Anjos
EOR
2010
103views more  EOR 2010»
11 years 6 months ago
Exploiting special structure in semidefinite programming: A survey of theory and applications
Semidefinite Programming (SDP) may be seen as a generalization of Linear Programming (LP). In particular, one may extend interior point algorithms for LP to SDP, but it has proven...
Etienne de Klerk
DAM
2008
111views more  DAM 2008»
11 years 6 months ago
Sums of squares based approximation algorithms for MAX-SAT
We investigate the Semidefinite Programming based Sums of squares (SOS) decomposition method, designed for global optimization of polynomials, in the context of the (Maximum) Sati...
Hans van Maaren, Linda van Norden, M. J. H. Heule
AUTOMATICA
2008
92views more  AUTOMATICA 2008»
11 years 6 months ago
Robust high-order repetitive control: Optimal performance trade-offs
High-order repetitive control has previously been introduced to either improve the robustness for period-time uncertainty or reduce the sensitivity for non-periodic inputs of stan...
Goele Pipeleers, Bram Demeulenaere, Joris De Schut...
COCO
2008
Springer
146views Algorithms» more  COCO 2008»
11 years 8 months ago
A Direct Product Theorem for Discrepancy
Discrepancy is a versatile bound in communication complexity which can be used to show lower bounds in the distributional, randomized, quantum, and even unbounded error models of ...
Troy Lee, Adi Shraibman, Robert Spalek
books