Results 91 to 100 of about 6,081 (225)
Data‐Based Refinement of Parametric Uncertainty Descriptions
International Journal of Robust and Nonlinear Control, Volume 36, Issue 6, Page 3210-3228, April 2026.ABSTRACT We consider dynamical systems with a linear fractional representation involving parametric uncertainties which are either constant or varying with time. Given a finite‐horizon input‐state or input‐output trajectory of such a system, we propose a numerical scheme which iteratively improves the available knowledge about the involved constant ...
Tobias Holicki, Carsten W. Scherer
wiley +1 more source
Semidefinite Programming and Ramsey Numbers
, 2020 Finding exact Ramsey numbers is a problem typically restricted to relatively small graphs. The flag algebra method was developed to find asymptotic results for very large graphs, so it seems that the method is not suitable for finding small Ramsey ...
Lidicky, Bernard, Pfender, Florian
core
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
Product Rules in Semidefinite Programming [PDF]
, 2007 In recent years we witness the proliferation of semidefinite programming bounds in combinatorial optimization [1,5,8], quantum computing [9,2,3,6,4] and even in complexity theory [7]. Examples to such bounds include the semidefinite relaxation for the maximal cut problem [5], and the quantum value of multi-prover interactive games [3,4].
Rajat Mittal 0001, Mario Szegedy
openaire +1 more source
Generalized Gauss Inequalities via Semidefinite Programming
A sharp upper bound on the probability of a random vector falling outside a polytope, based solely on the first and second moments of its distribution, can be computed efficiently using semidefinite programming.
Goulart, Paul J. +2 more
core +1 more source
Bounds for codes by semidefinite programming [PDF]
Proceedings of the Steklov Institute of Mathematics, 2008 Delsarte's method and its extensions allow to consider the upper bound problem for codes in 2-point-homogeneous spaces as a linear programming problem with perhaps infinitely many variables, which are the distance distribution. We show that using as variables power sums of distances this problem can be considered as a finite semidefinite programming ...
openaire +3 more sources
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
A semidefinite program for distillable entanglement [PDF]
IEEE Transactions on Information Theory, 2001 We show that the maximum fidelity obtained by a p.p.t. distillation protocol is given by the solution to a certain semidefinite program. This gives a number of new lower and upper bounds on p.p.t. distillable entanglement (and thus new upper bounds on 2-locally distillable entanglement).
openaire +4 more sources
k-Point semidefinite programming bounds for equiangular lines
, 2021 We propose a hierarchy of k-point bounds extending the Delsarte–Goethals–Seidel linear programming 2-point bound and the Bachoc–Vallentin semidefinite programming 3-point bound for spherical codes.
de Laat, D. (author) +7 more
core +1 more source
On the central paths and Cauchy trajectories in semidefinite programming [PDF]
, 2004 summary:In this work, we study the properties of central paths, defined with respect to a large class of penalty and barrier functions, for convex semidefinite programs.
Bolte, Jérome +5 more
core +1 more source