Introduction to Semidefinite, Conic and Polynomial Optimization
From MaRDI portal
Publication:2802517
DOI10.1007/978-1-4614-0769-0_1zbMath1334.90095OpenAlexW2238847421MaRDI QIDQ2802517
Miguel F. Anjos, Jean-Bernard Lasserre
Publication date: 26 April 2016
Published in: International Series in Operations Research & Management Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-1-4614-0769-0_1
Semidefinite programming (90C22) Introductory exposition (textbooks, tutorial papers, etc.) pertaining to operations research and mathematical programming (90-01)
Related Items
Noncommutative Christoffel-Darboux kernels, Exact quadratic convex reformulations of mixed-integer quadratically constrained problems, Improved exact approaches for row layout problems with departments of equal length, Generating valid linear inequalities for nonlinear programs via sums of squares, Improved semidefinite bounding procedure for solving max-cut problems to optimality, A distributed continuous-time method for non-convex QCQPs, Exact algorithms for semidefinite programs with degenerate feasible set, Convex Relaxation Approaches for Strictly Correlated Density Functional Theory, Alternative SDP and SOCP approximations for polynomial optimization, Volume of Sublevel Sets of Homogeneous Polynomials
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Semidefinite programming for min-max problems and games
- Semidefinite programming for discrete optimization and matrix completion problems
- Reduction of symmetric semidefinite programs using the regular \(\ast\)-representation
- Symmetry in semidefinite programs
- The \(K\)-moment problem for compact semi-algebraic sets
- Geometric algorithms and combinatorial optimization.
- An exact duality theory for semidefinite programming and its complexity implications
- Semidefinite programming relaxations for semialgebraic problems
- Aspects of semidefinite programming. Interior point algorithms and selected applications
- Symmetry groups, semidefinite programs, and sums of squares
- Anneaux preordonnes
- Global Optimization with Polynomials and the Problem of Moments
- GloptiPoly 3: moments, optimization and semidefinite programming
- Convexity in SemiAlgebraic Geometry and Polynomial Optimization
- Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming
- Polynomial Programming: LP-Relaxations Also Converge
- Optimization of Polynomials on Compact Semialgebraic Sets
- Sums of Squares and Semidefinite Program Relaxations for Polynomial Optimization Problems with Structured Sparsity
- A Comparison of the Sherali-Adams, Lovász-Schrijver, and Lasserre Relaxations for 0–1 Programming
- Convergent SDP‐Relaxations in Polynomial Optimization with Sparsity
- Handbook of semidefinite programming. Theory, algorithms, and applications
