Results 21 to 30 of about 68 (67)

Basc: Constrained Approximation by Semidefinite Programming

open access: yes, 2016
This article details the theoretical grounds for a semidefinite-programming-based method that computes best approximants by splines under some general constraints and relative to several function norms, notably the max-norm.
Vladlena Powers, Simon Foucart
core  

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

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

Discrete transforms, semidefinite programming and sum-of-squares representations of nonnegative polynomials

open access: yes, 2006
. We present a new semidefinite programming formulation of sum-of-squares representations of nonnegative polynomials, cosine polynomials and trigonometric polynomials of one variable. The parametrization is based on discrete transforms (specifically, the
Tae Roh, Lieven Vandenberghe
core  

Mathematisches Forschungsinstitut Oberwolfach Report No. 50/2005 Combinatorial Optimization

open access: yes, 2005
. This report summarizes the meeting on Combinatorial Optimization where new and promising developments in the field were discussed. The lectures show the many connections to other branches in Mathematics, like Combinatorics, Graph Theory, Geometry and ...
Uwe Zimmermann (braunschweig   +2 more
core  

Complete positivity and distance-avoiding sets. [PDF]

open access: yesMath Program, 2022
DeCorte E, Filho FMO, Vallentin F.
europepmc   +1 more source

Constructing Worst Case Instances for Semidefinite Programming Based Approximation Algorithms

open access: yes, 2001
SL,BAEb#[1 programming based approximation algorithms, such as the Goemans and Williamson approximation algorithm for the MAX CUT problem, are usually shown to have certain performance guarantees using local ratio techniques.
Benny Sudakov, Uri Zwick, Noga Alon
core  

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

open access: yes
AMS classification: 90C22, 20Cxx, 70-08traveling salesman problem;semidefinite programming;quadratic as- signment ...
Klerk, E. de   +2 more
core  

On Some Properties of Interior Methods for Optimization [Elektronisk resurs]

open access: yes, 2003
This thesis consists of four independent papers concerningdifferent aspects of interior methods for optimization. Threeof the papers focus on theoretical aspects while the fourth oneconcerns some computational experiments.The systems of equations solved ...
Sporre, Göran,
core  

On Some Properties of Interior Methods for Optimization

open access: yes, 2003
This thesis consists of four independent papers concerningdifferent aspects of interior methods for optimization. Threeof the papers focus on theoretical aspects while the fourth oneconcerns some computational experiments. The systems of equations solved
Sporre, Göran
core  

On the Lovasz O-number of Almost Regular Graphs With Application to Erdos-Renyi Graphs

open access: yes
AMS classifications: 05C69; 90C35; 90C22;Erdos-Renyi graph;stability number;Lovasz O-number;Schrijver O-number;C*-algebra;semidefinite ...
Klerk, E. de   +3 more
core  

Home - About - Disclaimer - Privacy