Results 111 to 120 of about 6,081 (225)
Non-convex mixed-integer nonlinear programming : a survey [PDF]
, 2012 A wide range of problems arising in practical applications can be formulated as Mixed-Integer Nonlinear Programs (MINLPs). For the case in which the objective and constraint functions are convex, some quite effective exact and heuristic algorithms are ...
Burer, S +3 more
core
Semidefinite Programs for Randomness Extractors
, 2015 Randomness extractors are an important building block for classical and quantum cryptography. However, for many applications it is crucial that the extractors are quantum-proof, i.e., that they work even in the presence of quantum adversaries. In general, quantum-proof extractors are poorly understood and we would like to argue that in the same way as ...
Mario Berta +2 more
openaire +4 more sources
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
, 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
IEEE Open Journal of Signal ProcessingIn 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
Semidefinite Programming by Perceptron Learning
, 2003 We present a modified version of the perceptron learning algorithm (PLA) which solves semidefinite programs (SDPs) in polynomial time. The algorithm is based on the following three observations: (i) Semidefinite programs are linear programs with ...
Thore Graepel +7 more
core
Semidefinite Programming for Combinatorial Optimization
, 2000 This book offers a self-contained introduction to the field of semidefinite programming, its applications in combinatorial optimization, and its computational methods.
Helmberg, Christoph
core
An Exact duality Theory for Semidefinite Programming and its Complexity Implications
, 1997 In this paper, an exact dual is derived for Semidefinite Programming (SDP), for which strong duality properties hold without any regularity assumptions. Its main features are: i.
Ramana, Motakuri V., Motakuri Venkata
core
Applications of Semidefinite Programming in Quantum Cryptography [PDF]
, 2007 Coin-flipping is the cryptographic task of generating a random coin-flip between two mistrustful parties. Kitaev discovered that the security of quantum coin-flipping protocols can be analyzed using semidefinite programming.
Sikora, Jamie William Jonathon
core
Semidefinite programming applied to graph colouring problems
, 2021 Semidefinitno programiranje bavi se minimizacijom linearne funkcije uz ograničenja da je afina kombinacija matrica pozitivno semidefinitna. U ovom radu proučavali smo primjenu semidefinitnog programiranja na probleme bojanja grafa.
Bedić, Fran
core