Semidefinite Optimization and Convex Algebraic Geometry

DOI10.1137/1.9781611972290zbMath1260.90006OpenAlexW653291882MaRDI QIDQ4902572

No author found.

Publication date: 16 January 2013

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

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

Related Items (only showing first 100 items - show all)

On duality gap with polynomial multipliers for polynomial optimization problems ⋮ Learning Dynamical Systems with Side Information ⋮ Random Points on an Algebraic Manifold ⋮ Lifting the Convex Conjugate in Lagrangian Relaxations: A Tractable Approach for Continuous Markov Random Fields ⋮ Lifting for Simplicity: Concise Descriptions of Convex Sets ⋮ The Rational Interpolation Problem: Grassmannian and Loewner-Matrix Approaches ⋮ The tracial Hahn-Banach theorem, polar duals, matrix convex sets, and projections of free spectrahedra ⋮ Region of attraction estimation using invariant sets and rational Lyapunov functions ⋮ Equivariant Semidefinite Lifts and Sum-of-Squares Hierarchies ⋮ Analysis of Linear Partial Differential Equations Using Convex Optimization ⋮ Mixed-Projection Conic Optimization: A New Paradigm for Modeling Rank Constraints ⋮ Some Recent Developments in Spectrahedral Computation ⋮ Hyperbolic Relaxation of $k$-Locally Positive Semidefinite Matrices ⋮ Minimizer Extraction in Polynomial Optimization Is Robust ⋮ Low rank tensor recovery via iterative hard thresholding ⋮ Plurisubharmonic noncommutative rational functions ⋮ Noncommutative partial convexity via $\Gamma$-convexity ⋮ Alfonso: Matlab Package for Nonsymmetric Conic Optimization ⋮ Symmetric non-negative forms and sums of squares ⋮ New upper bounds for the density of translative packings of three-dimensional convex bodies with tetrahedral symmetry ⋮ Solving generic nonarchimedean semidefinite programs using stochastic game algorithms ⋮ Reinhardt free spectrahedra ⋮ On representing the positive semidefinite cone using the second-order cone ⋮ On the 𝑞-analogue of the Pair Correlation Conjecture via Fourier optimization ⋮ Do Sums of Squares Dream of Free Resolutions? ⋮ Sum of squares generalizations for conic sets ⋮ The Maximum Likelihood Degree of Sparse Polynomial Systems ⋮ Rational dual certificates for weighted sums-of-squares polynomials with boundable bit size ⋮ Geometric control of hybrid systems ⋮ A faster interior-point method for sum-of-squares optimization ⋮ Matroids on Eight Elements with the Half-Plane Property and Related Concepts ⋮ Irreducible infeasible subsystems of semidefinite systems ⋮ A Sum of Squares Characterization of Perfect Graphs ⋮ On random walks and switched random walks on homogeneous spaces ⋮ Sampling Algebraic Varieties for Sum of Squares Programs ⋮ Computing maximum likelihood estimates for Gaussian graphical models with Macaulay2 ⋮ On the Construction of Converging Hierarchies for Polynomial Optimization Based on Certificates of Global Positivity ⋮ On the complexity of analyticity in semi-definite optimization ⋮ Families of faces and the normal cycle of a convex semi-algebraic set ⋮ Parameter Region for Multistationarity in ${\boldsymbol{n-}}$Site Phosphorylation Networks ⋮ Polyhedral approximation of spectrahedral shadows via homogenization ⋮ Automorphisms of hyper-Reinhardt free spectrahedra ⋮ Characterizing a class of robust vector polynomial optimization via sum of squares conditions ⋮ An inexact projected gradient method with rounding and lifting by nonlinear programming for solving rank-one semidefinite relaxation of polynomial optimization ⋮ Imaginary projections: complex versus real coefficients ⋮ Semidefinite Representation for Convex Hulls of Real Algebraic Curves ⋮ Spectrahedral Shadows ⋮ Real Radicals and Finite Convergence of Polynomial Optimization Problems ⋮ Bad Semidefinite Programs: They All Look the Same ⋮ On New Classes of Nonnegative Symmetric Tensors ⋮ On a few statistical applications of determinantal point processes ⋮ A Positivstellensatz for Sums of Nonnegative Circuit Polynomials ⋮ Spectrahedral Containment and Operator Systems with Finite-Dimensional Realization ⋮ Unnamed Item ⋮ Linear Matrix Inequality Conditions and Duality for a Class of Robust Multiobjective Convex Polynomial Programs ⋮ Global optimality principles for polynomial optimization over box or bivalent constraints by separable polynomial approximations ⋮ Eigenconfigurations of tensors ⋮ Certifying Unstability of Switched Systems Using Sum of Squares Programming ⋮ DSOS and SDSOS Optimization: More Tractable Alternatives to Sum of Squares and Semidefinite Optimization ⋮ Dilations, Linear Matrix Inequalities, the Matrix Cube Problem and Beta Distributions ⋮ Positive semidefinite matrix completion, universal rigidity and the strong Arnold property ⋮ Sum-of-Squares Optimization without Semidefinite Programming ⋮ Approximating Nonnegative Polynomials via Spectral Sparsification ⋮ A panorama of positivity. II: Fixed dimension ⋮ Free Bertini’s theorem and applications ⋮ Gram spectrahedra ⋮ Definite determinantal representations of multivariate polynomials ⋮ Hilbert’s 17th problem in free skew fields ⋮ Sums of Squares and Sparse Semidefinite Programming ⋮ Unnamed Item ⋮ Stable Noncommutative Polynomials and Their Determinantal Representations ⋮ Schur polynomials and matrix positivity preservers ⋮ Matrix convex hulls of free semialgebraic sets ⋮ Exponential varieties ⋮ Intersection cuts for nonlinear integer programming: convexification techniques for structured sets ⋮ Sums of squares and varieties of minimal degree ⋮ Gap vectors of real projective varieties ⋮ Certifying Polynomial Nonnegativity via Hyperbolic Optimization ⋮ Lower Bounds for Polynomials with Simplex Newton Polytopes Based on Geometric Programming ⋮ A Matrix Positivstellensatz with Lifting Polynomials ⋮ Stochastic polynomial optimization ⋮ Unnamed Item ⋮ Euclidean Distance Degree of the Multiview Variety ⋮ Exact Algorithms for Linear Matrix Inequalities ⋮ Some remarks on duality and optimality of a class of constrained convex quadratic minimization problems ⋮ Convex Algebraic Geometry of Curvature Operators ⋮ A Convex Relaxation to Compute the Nearest Structured Rank Deficient Matrix ⋮ Characterizing Bad Semidefinite Programs: Normal Forms and Short Proofs ⋮ Semidefinite Descriptions of the Convex Hull of Rotation Matrices ⋮ Exact Duality in Semidefinite Programming Based on Elementary Reformulations ⋮ Non-unique games over compact groups and orientation estimation in cryo-EM ⋮ Bounds for Deterministic and Stochastic Dynamical Systems using Sum-of-Squares Optimization ⋮ High Degree Sum of Squares Proofs, Bienstock--Zuckerberg Hierarchy, and Chvátal--Gomory Cuts ⋮ Conic Geometric Optimization on the Manifold of Positive Definite Matrices ⋮ A Semidefinite Hierarchy for Containment of Spectrahedra ⋮ Generic Spectrahedral Shadows ⋮ On the Central Path of Semidefinite Optimization: Degree and Worst-Case Convergence Rate ⋮ Completely positive reformulations for polynomial optimization ⋮ On Computing the Nonlinearity Interval in Parametric Semidefinite Optimization ⋮ A DCA-Newton method for quartic minimization over the sphere

Uses Software

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