Results 121 to 130 of about 6,081 (225)

An easy way to obtain strong duality results in linear, linear semidefinite and linear semi-infinite programming [PDF]

, 1999
In linear programming it is known that an appropriate non-homogeneous Farkas Lemma leads to a short proof of the strong duality results for a pair of primal and dual programs.
Pop, P.C., Still, Georg J.
core  

A coordinated dispatch method for distribution and microgrid systems based on semidefinite programming relaxation

Zhejiang dianli
The widespread adoption of distributed energy resources （DER） has significantly increased the complexity of distribution networks. Coordination between distribution networks and microgrid（s） can facilitate the integration of distributed energy， but ...
CHEN Zhe, LI Zhihao, TANG Yajie, WANG Xiangjin, GONG Diyang, LIU Fangzhou   +5 more
doaj   +1 more source

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

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

Semidefinite Programming and Integer Programming

, 2008
We survey how semidefinite programming can be used for finding good approximative solutions to hard combinatorial optimization ...
Franz Rendl, Monique Laurent
core  

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

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

Decomposition-Based Method for Sparse Semidefinite Relaxations of Polynomial Optimization Problems [PDF]

We consider polynomial optimization problems pervaded by a sparsity pattern. It has been shown in [1, 2] that the optimal solution of a polynomial programming problem with structured sparsity can be computed by solving a series of semidefinite ...
Berc Rustem, Panos Parpas, P. M. Kleniati   +2 more
core  

Uniqueness of codes using semidefinite programming. [PDF]

Des Codes Cryptogr, 2019
Brouwer AE, Polak SC.
europepmc   +1 more source

Exploiting Group Symmetry in Semidefinite Programming Relaxations of the Quadratic Assignment Problem

We consider semidefinite programming relaxations of the quadratic assignment problem, and show how to exploit group symmetry in the problem data. Thus we are able to compute the best known lower bounds for several instances of quadratic assignment ...
Klerk, E. de, Sotirov, R.
core  

The Volumetric Barrier for Semidefinite Programming

, 1998
We consider the volumetric barrier for semidefinite programming, or "generalized" volumetric barrier, as introduced by Nesterov and Nemirovskii.
Kurt M. Anstreicher
core  

Analysing diffusion and flow-driven instability using semidefinite programming. [PDF]

J R Soc Interface, 2019
Hori Y, Miyazako H.
europepmc   +1 more source