Introduction to Semidefinite, Conic and Polynomial Optimization
DOI10.1007/978-1-4614-0769-0_1zbMATH Open1334.90095OpenAlexW2238847421MaRDI QIDQ2802517FDOQ2802517
Jean B. Lasserre, Miguel F. Anjos
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)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Global optimization with polynomials and the problem of moments
- 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
- Symmetry groups, semidefinite programs, and sums of squares
- GloptiPoly 3: moments, optimization and semidefinite programming
- 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
- Reduction of symmetric semidefinite programs using the regular \(\ast\)-representation
- Semidefinite programming for discrete optimization and matrix completion problems
- Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming
- Anneaux preordonnes
- Aspects of semidefinite programming. Interior point algorithms and selected applications
- Convexity in SemiAlgebraic Geometry and Polynomial Optimization
- Symmetry in semidefinite programs
- Semidefinite programming for min-max problems and games
- Polynomial Programming: LP-Relaxations Also Converge
Cited In (14)
- Convex Relaxation Approaches for Strictly Correlated Density Functional Theory
- Exact algorithms for semidefinite programs with degenerate feasible set
- A distributed continuous-time method for non-convex QCQPs
- Improved semidefinite bounding procedure for solving max-cut problems to optimality
- Alternative SDP and SOCP approximations for polynomial optimization
- Exact quadratic convex reformulations of mixed-integer quadratically constrained problems
- Volume of Sublevel Sets of Homogeneous Polynomials
- Improved exact approaches for row layout problems with departments of equal length
- Book review of: J.-B. Lasserre, An introduction to polynomial and semi-algebraic optimization
- Book review of: J. B. Lasserre, An introduction to polynomial and semi-algebraic optimization
- Parametric conic optimization problems over semidefinite plus nonnegative cone
- Noncommutative Christoffel-Darboux kernels
- Generating valid linear inequalities for nonlinear programs via sums of squares
- Introductory lectures on convex optimization. A basic course.
Uses Software
This page was built for publication: Introduction to Semidefinite, Conic and Polynomial Optimization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2802517)
