Semidefinite Optimization and Convex Algebraic Geometry

DOI10.1137/1.9781611972290zbMATH Open1260.90006OpenAlexW653291882MaRDI QIDQ4902572FDOQ4902572

Authors:

Publication date: 16 January 2013

Full work available at URL: https://doi.org/10.1137/1.9781611972290

Mathematics Subject Classification ID

Semidefinite programming (90C22) Collections of articles of miscellaneous specific interest (00B15) Computational aspects related to convexity (52B55) Real algebraic sets (14P05) Proceedings, conferences, collections, etc. pertaining to operations research and mathematical programming (90-06)

Cited In (only showing first 100 items - show all)

• Initial steps in the classification of maximal mediated sets
• Inflation of poorly conditioned zeros of systems of analytic functions
• The tracial Hahn-Banach theorem, polar duals, matrix convex sets, and projections of free spectrahedra
• Computing symmetric determinantal representations
• Sums of squares in Macaulay2
• The saddle point problem of polynomials
• Discriminants of cyclic homogeneous inequalities of three variables
• Advances in computational Lyapunov analysis using sum-of-squares programming
• Polynomial optimization with applications to stability analysis and control -- alternatives to sum of squares
• Test sets for nonnegativity of polynomials invariant under a finite reflection group
• Stochastic polynomial optimization
• Matrix convex hulls of free semialgebraic sets
• Livsic-type determinantal representations and hyperbolicity
• Amoebas, nonnegative polynomials and sums of squares supported on circuits
• Extreme points of matrix convex sets, free spectrahedra, and dilation theory
• Equivariant Semidefinite Lifts and Sum-of-Squares Hierarchies
• Polyhedral approximations of the semidefinite cone and their application
• Lower bounds on complexity of Lyapunov functions for switched linear systems
• Learning algebraic varieties from samples
• Convergent conic linear programming relaxations for cone convex polynomial programs
• The geometry of SDP-exactness in quadratic optimization
• Tensor theta norms and low rank recovery
• Random points on an algebraic manifold
• Robust SOS-convex polynomial optimization problems: exact SDP relaxations
• Scheduling meets \(n\)-fold integer programming
• Semidefinite Representation for Convex Hulls of Real Algebraic Curves
• Algebraic boundaries of convex semi-algebraic sets
• Matrix positivity preservers in fixed dimension. I
• A complete characterization of determinantal quadratic polynomials
• On the local stability of semidefinite relaxations
• Exponential varieties
• On duality gap with polynomial multipliers for polynomial optimization problems
• Geometric control of hybrid systems
• Euclidean distance degree of the multiview variety
• Self-scaled bounds for atomic cone ranks: applications to nonnegative rank and cp-rank
• On domains of noncommutative rational functions
• Global optimality principles for polynomial optimization over box or bivalent constraints by separable polynomial approximations
• Nonlocality in many-body quantum systems detected with two-body correlators
• Symmetric matrices, Catalan paths, and correlations
• Generic Spectrahedral Shadows
• The Maximum Likelihood Degree of Sparse Polynomial Systems
• Properties of the cone of non-negative polynomials and duality
• Positive semidefinite rank
• DSOS and SDSOS optimization: more tractable alternatives to sum of squares and semidefinite optimization
• Polynomial-sized semidefinite representations of derivative relaxations of spectrahedral cones
• Low rank tensor recovery via iterative hard thresholding
• Extreme rays of Hankel spectrahedra for ternary forms
• Circular free spectrahedra
• Stable Noncommutative Polynomials and Their Determinantal Representations
• Intersection cuts for nonlinear integer programming: convexification techniques for structured sets
• Sums of squares on the hypercube
• Sparse sums of squares on finite abelian groups and improved semidefinite lifts
• Symmetric non-negative forms and sums of squares
• Optimality conditions for approximate Pareto solutions of a nonsmooth vector optimization problem with an infinite number of constraints
• Completely positive reformulations for polynomial optimization
• Lower bounds for polynomials with simplex Newton polytopes based on geometric programming
• Operator Positivstellensätze for noncommutative polynomials positive on matrix convex sets
• A generalized Farkas lemma with a numerical certificate and linear semi-infinite programs with SDP duals
• Noncommutative partial convexity via \(\Gamma\)-convexity
• Symmetry in Turán sums of squares polynomials from flag algebras
• Conic geometric optimization on the manifold of positive definite matrices
• Norm bounds and underestimators for unconstrained polynomial integer minimization
• Relative entropy optimization and its applications
• Exact conic programming relaxations for a class of convex polynomial cone programs
• Matrix positivity preservers in fixed dimension
• Semidefinite approximations of conical hulls of measured sets
• A matrix Positivstellensatz with lifting polynomials
• Exact Duality in Semidefinite Programming Based on Elementary Reformulations
• Partial facial reduction: simplified, equivalent SDPs via approximations of the PSD cone
• Free Bertini's theorem and applications
• The algebro-geometric study of range maps
• Positive semidefinite matrix completion, universal rigidity and the strong Arnold property
• Tropical spectrahedra
• Optimal bounds on the positivity of a matrix from a few moments
• The tropical analogue of the Helton-Nie conjecture is true
• Do sums of squares dream of free resolutions?
• Eigenconfigurations of tensors
• An approach to constrained polynomial optimization via nonnegative circuit polynomials and geometric programming
• Imaginary projections of polynomials
• A semidefinite hierarchy for containment of spectrahedra
• A Positivstellensatz for sums of nonnegative circuit polynomials
• Real zeros of SONC polynomials
• A Morse theoretic approach to non-isolated singularities and applications to optimization
• Sampling algebraic varieties for sum of squares programs
• Matroids on Eight Elements with the Half-Plane Property and Related Concepts
• Semidefinite approximations of the matrix logarithm
• Determinantal sampling designs
• Spectrahedral Containment and Operator Systems with Finite-Dimensional Realization
• On the construction of converging hierarchies for polynomial optimization based on certificates of global positivity
• Dilations, Linear Matrix Inequalities, the Matrix Cube Problem and Beta Distributions
• Minimizer Extraction in Polynomial Optimization Is Robust
• Semidefinite Descriptions of the Convex Hull of Rotation Matrices
• Numerical algebraic geometry and semidefinite programming
• Representations of Lie algebras by non-skewselfadjoint operators in Hilbert space
• Sums of squares and varieties of minimal degree
• Positive univariate trace polynomials
• On new classes of nonnegative symmetric tensors
• Linear matrix inequality conditions and duality for a class of robust multiobjective convex polynomial programs
• Alternative SDP and SOCP approximations for polynomial optimization
• A Sum of Squares Characterization of Perfect Graphs

Uses Software

• Macaulay2
• NCSOStools
• NCAlgebra

This page was built for publication: Semidefinite Optimization and Convex Algebraic Geometry

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4902572)