Results 101 to 110 of about 836,294 (206)

Semidefinite programming in combinatorial optimization

, 1997
We discuss the use of semidefinite programming for combinatorial optimization problems. The main topics covered include (i) the Lovász theta function and its applications to stable sets, perfect graphs, and coding theory, (ii) the automatic generation of
Goemans, Michel X.
core   +1 more source

Affine scaling algorithm fails for semidefinite programming [PDF]

, 1997
In this paper, we introduce an affine scaling algorithm for semidefine programming (SDP), and give an example of a semidefinite program such that the affine scaling algorithm converges to a non-optimal point.
Muramatsu, Masakazu
core  

Semidefinite programming and matrix scaling over the semidefinite cone

Linear Algebra and its Applications, 2003
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire   +2 more sources

LINEAR AND NONLINEAR SEMIDEFINITE PROGRAMMING

, 2014
This paper provides a short introduction to optimization problems with semidefinite constraints. Basic duality and optimality conditions are presented.
Gómez,Juan A., Bofill,Walter Gómez
core   +1 more source

Semidefinite Programming

, 1999
Due to its many applications in control theory, robust optimization, combinatorial optimization and eigenvalue optimization, semidefinite programming had been in wide spread use even before the development of efficient algorithms brought it into the ...
Helmberg, Christoph
core   +1 more source

Semidefinite programming

, 1995
In semidefinite programming one minimizes a linear function subject to the constraint that an affine combination of symmetric matrices is positive semidefinite. Such a constraint is nonlinear and nonsmooth, but convex, so semidefinite programs are convex
Lieven Vandenberghe, Stephen Boyd
core  

Moving Target At Constant Velocity Localization Using TOA Measurements From Single Moving Receiver With Unknown Signal Period

IEEE Open Journal of Signal Processing
In this article, we consider using time-of-arrival (TOA) measurements from a single moving receiver to locate a moving target at constant velocity that emits a periodic signal with unknown signal period.
Yanbin Zou, Jingna Fan, Zekai Zhang
doaj   +1 more source

On Semidefinite Programming Relaxations of Association Schemes With Application to Combinatorial Optimization Problems [PDF]

AMS classification: 90C22, 20Cxx, 70-08traveling salesman problem;maximum bisection;semidefinite programming;association ...
Klerk, E. de, Pasechnik, D.V.
core  

Semidefinite Programming and Constraint Programming [PDF]

, 2011
Recently, semidefinite programming relaxations have been applied in constraint programming to take advantage of the high-quality bounds and precise heuristic guidance during the search for a solution. The purpose of this chapter is to present an overview of these developments, and to provide future research prospects.
openaire   +1 more source

On Semidefinite Programming Relaxations of the Travelling Salesman Problem (Replaced by DP 2008-96) [PDF]

AMS classification: 90C22, 20Cxx, 70-08traveling salesman problem;semidefinite programming;quadratic as- signment ...
Klerk, E. de, Pasechnik, D.V., Sotirov, R.   +2 more
core