Introduction to semidefinite, conic and polynomial optimization
From MaRDI portal
Recommendations
Cites work
- A Comparison of the Sherali-Adams, Lovász-Schrijver, and Lasserre Relaxations for 0–1 Programming
- An exact duality theory for semidefinite programming and its complexity implications
- Anneaux preordonnes
- Aspects of semidefinite programming. Interior point algorithms and selected applications
- Convergent SDP‐Relaxations in Polynomial Optimization with Sparsity
- Convexity in SemiAlgebraic Geometry and Polynomial Optimization
- Geometric algorithms and combinatorial optimization.
- Global optimization with polynomials and the problem of moments
- GloptiPoly 3: moments, optimization and semidefinite programming
- Handbook of semidefinite programming. Theory, algorithms, and applications
- scientific article; zbMATH DE number 47926 (Why is no real title available?)
- scientific article; zbMATH DE number 527343 (Why is no real title available?)
- scientific article; zbMATH DE number 961607 (Why is no real title available?)
- Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming
- Optimization of Polynomials on Compact Semialgebraic Sets
- Polynomial Programming: LP-Relaxations Also Converge
- Reduction of symmetric semidefinite programs using the regular -representation
- Semidefinite programming and integer programming
- Semidefinite programming for discrete optimization and matrix completion problems
- Semidefinite programming for min-max problems and games
- Semidefinite programming relaxations for semialgebraic problems
- Sums of Squares and Semidefinite Program Relaxations for Polynomial Optimization Problems with Structured Sparsity
- Symmetry groups, semidefinite programs, and sums of squares
- Symmetry in semidefinite programs
- The K-moment problem for compact semi-algebraic sets
Cited in
(25)- Introductory lectures on convex optimization. A basic course.
- Improved exact approaches for row layout problems with departments of equal length
- A distributed continuous-time method for non-convex QCQPs
- Generating valid linear inequalities for nonlinear programs via sums of squares
- Alternative SDP and SOCP approximations for polynomial optimization
- Improved semidefinite bounding procedure for solving max-cut problems to optimality
- Exact quadratic convex reformulations of mixed-integer quadratically constrained problems
- Book review of: J.-B. Lasserre, An introduction to polynomial and semi-algebraic optimization
- scientific article; zbMATH DE number 1975312 (Why is no real title available?)
- A guide to conic optimisation and its applications
- Noncommutative Christoffel-Darboux kernels
- Foundations of set-semidefinite optimization
- Convex relaxation approaches for strictly correlated density functional theory
- Volume of sublevel sets of homogeneous polynomials
- Advances in convex optimization: conic programming
- LMI Approximations for Cones of Positive Semidefinite Forms
- Book review of: J. B. Lasserre, An introduction to polynomial and semi-algebraic optimization
- Properties of the cone of non-negative polynomials and duality
- Conic linear optimization for computer-assisted proofs. Abstracts from the workshop held April 10--16, 2022
- Parametric conic optimization problems over semidefinite plus nonnegative cone
- The Christoffel function: applications, connections and extensions
- Matrix moment approach to positivity bounds and UV reconstruction from IR
- Properties of the complementarity set for the cone of copositive matrices
- Extensions of \(\mathcal{KL}\) and Lyapunov functions for discrete-time dynamical system peak analysis
- On approximation algorithms for commutative quaternion polynomial optimization
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)
