Global Optimization with Polynomials and the Problem of Moments

DOI10.1137/S1052623400366802zbMath1010.90061OpenAlexW1967344706WikidataQ92191833 ScholiaQ92191833MaRDI QIDQ2706355

Jean-Bernard Lasserre

Publication date: 19 March 2001

Published in: SIAM Journal on Optimization (Search for Journal in Brave)

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

zbMATH Keywords

global optimizationsemidefinite programmingtheory of moments and positive polynomials

Mathematics Subject Classification ID

Semidefinite programming (90C22) Nonconvex programming, global optimization (90C26) Real algebra (13J30)

Related Items

Mathematical programming methods for microgrid design and operations: a survey on deterministic and stochastic approaches, Signomial and polynomial optimization via relative entropy and partial dualization, Minotaur: a mixed-integer nonlinear optimization toolkit, Independent sets in semi-random hypergraphs, Stability of quadratic modules, Simulation of discrete linear time-invariant fuzzy dynamic systems, Sum-of-squares rank upper bounds for matching problems, The QAP-polytope and the graph isomorphism problem, Sum of squares method for sensor network localization, Moments and sums of squares for polynomial optimization and related problems, Global uniqueness and solvability of tensor variational inequalities, Completely positive tensor recovery with minimal nuclear value, Set-membership errors-in-variables identification of MIMO linear systems, SDP relaxation of arbitrage pricing bounds based on option prices and moments, Sparse-BSOS: a bounded degree SOS hierarchy for large scale polynomial optimization with sparsity, On calculation of norms of 2D-systems, Bounds on entanglement dimensions and quantum graph parameters via noncommutative polynomial optimization, Theoretical challenges towards cutting-plane selection, On linear programming relaxations for solving polynomial programming problems, A numerical evaluation of the bounded degree sum-of-squares hierarchy of Lasserre, Toh, and Yang on the pooling problem, Representations of positive polynomials on noncompact semialgebraic sets via KKT ideals, Tensor eigenvalue complementarity problems, Semidefinite representations for finite varieties, Strengthened semidefinite programming bounds for codes, Global optimality conditions and optimization methods for constrained polynomial programming problems, On the complexity of Putinar's Positivstellensatz, Convergence of the Lasserre hierarchy of SDP relaxations for convex polynomial programs without compactness, On the complexity of Schmüdgen's Positivstellensatz, Semidefinite bounds for the stability number of a graph via sums of squares of polynomials, An extension of sums of squares relaxations to polynomial optimization problems over symmetric cones, SOS approximations of nonnegative polynomials via simple high degree perturbations, Completely positive reformulations of polynomial optimization problems with linear constraints, On global integer extrema of real-valued box-constrained multivariate quadratic functions, Global optimization for optimal power flow over transmission networks, An unbounded sum-of-squares hierarchy integrality gap for a polynomially solvable problem, Integral quadratic constraints for delayed nonlinear and parameter-varying systems, Atomic optimization. II. Multidimensional problems and polynomial matrix inequalities, Equality-constrained minimization of polynomial functions, Extensions of Gauss quadrature via linear programming, Border basis relaxation for polynomial optimization, Set-membership estimation of fiber laser physical parameters from input-output power measurements, Low degree Nullstellensatz certificates for 3-colorability, Completely positive and completely positive semidefinite tensor relaxations for polynomial optimization, Convexification of generalized network flow problem, Optimal control of switching topology networks, On global optimizations with polynomials, New and old bounds for standard quadratic optimization: dominance, equivalence and incomparability, Notes on computational-to-statistical gaps: predictions using statistical physics, Global optimization of polynomials over real algebraic sets, Calculating entanglement eigenvalues for nonsymmetric quantum pure states based on the Jacobian semidefinite programming relaxation method, Limitations of semidefinite programs for separable states and entangled games, Multipolar robust optimization, Copositivity and complete positivity. Abstracts from the workshop held October 29 -- Novermber 4, 2017, Stochastic 0-1 linear programming under limited distributional information, Approximating integrals of multivariate exponentials: A moment approach, Algorithms for weighted sum of squares decomposition of non-negative univariate polynomials, A multilevel analysis of the Lasserre hierarchy, Exact relaxations of non-convex variational problems, A robust unscented transformation for uncertain moments, New global algorithms for quadratic programming with a few negative eigenvalues based on alternative direction method and convex relaxation, On the convexity of a class of quadratic mappings and its application to the problem of finding the smallest ball enclosing a given intersection of balls, Optimization over structured subsets of positive semidefinite matrices via column generation, Binary quadratic optimization problems that are difficult to solve by conic relaxations, A continuous characterization of the maximum vertex-weighted clique in hypergraphs, The \(K\)-moment problem with densities, An analogue of the Riesz-Haviland theorem for the truncated moment problem, Coherent quantum LQG control, Certificates of convexity for basic semi-algebraic sets, A method for computing lowest eigenvalues of symmetric polynomial differential operators by semidefinite programming, Exploiting sparsity in linear and nonlinear matrix inequalities via positive semidefinite matrix completion, Decomposition-based method for sparse semidefinite relaxations of polynomial optimization problems, \({{\mathcal {D}(\mathcal {C})}}\)-optimization and robust global optimization, Extended trust-region problems with one or two balls: exact copositive and Lagrangian relaxations, Approximation algorithms for nonnegative polynomial optimization problems over unit spheres, A semidefinite programming approach to the generalized problem of moments, Cyclic convex bodies and optimization moment problems, Positive polynomials on projective limits of real algebraic varieties, A note on sparse SOS and SDP relaxations for polynomial optimization problems over symmetric cones, A new full-Newton step \(O(n)\) infeasible interior-point algorithm for semidefinite optimization, Simple ingredients leading to very efficient heuristics for the maximum clique problem, Minimizing rational functions by exact Jacobian SDP relaxation applicable to finite singularities, Faster, but weaker, relaxations for quadratically constrained quadratic programs, Approximation methods for complex polynomial optimization, Space tensor conic programming, A Striktpositivstellensatz for measurable functions, Monotonically positive matrices, Linear optimization with cones of moments and nonnegative polynomials, Recognizing underlying sparsity in optimization, Smaller SDP for SOS decomposition, Correlative sparsity in primal-dual interior-point methods for LP, SDP, and SOCP, A generalization of the Motzkin-Straus theorem to hypergraphs, Third-order extensions of Lo's semiparametric bound for European call options, Numerical approaches for collaborative data processing, An algorithm for the global optimization of a class of continuous minimax problems, Semidefinite characterization and computation of zero-dimensional real radical ideals, Solving polynomial optimization problems via the truncated tangency variety and sums of squares, A generalized flat extension theorem for moment matrices, Conditions for strong ellipticity and M-eigenvalues, Exploiting special structure in semidefinite programming: a survey of theory and applications, Minimum ellipsoid bounds for solutions of polynomial systems via sum of squares, Quantum de Finetti theorems under local measurements with applications, Approximate gcds of polynomials and sparse SOS relaxations, Computing sum of squares decompositions with rational coefficients, A robust algorithm for quadratic optimization under quadratic constraints, Certificates for nonnegativity of polynomials with zeros on compact semialgebraic sets, A recursive algorithm of exactness verification of relaxations for robust SDPs, Convex sets with semidefinite representation, An alternative Kalman-Yakubovich-Popov lemma and some extensions, Generalized S-lemma and strong duality in nonconvex quadratic programming, Correlative sparsity structures and semidefinite relaxations for concave cost transportation problems with change of variables, The saddle point problem of polynomials, Projected orthogonal vectors in two-dimensional search interior point algorithms for linear programming, High-dimensional change-point estimation: combining filtering with convex optimization, A bounded degree SOS hierarchy for polynomial optimization, Frameworks and results in distributionally robust optimization, Dual form reduction in the atomic optimization method, A sums-of-squares extension of policy iterations, Convexifications of rank-one-based substructures in QCQPs and applications to the pooling problem, Solving rank-constrained semidefinite programs in exact arithmetic, Error bounds for monomial convexification in polynomial optimization, Sums of Hermitian squares decomposition of non-commutative polynomials in non-symmetric variables using NCSOStools, One-shot set-membership identification of generalized Hammerstein-Wiener systems, A new approximation hierarchy for polynomial conic optimization, Optimized choice of parameters in interior-point methods for linear programming, Sum-of-squares hierarchy lower bounds for symmetric formulations, The geometry of SDP-exactness in quadratic optimization, Robust and optimal registration of image sets and structured scenes via sum-of-squares polynomials, Mean estimation with sub-Gaussian rates in polynomial time, Outer-product-free sets for polynomial optimization and oracle-based cuts, Breaking symmetries to rescue sum of squares in the case of makespan scheduling, Hermitian completely positive matrices, Completely positive tensors in the complex field, Generating valid linear inequalities for nonlinear programs via sums of squares, Computing nearby non-trivial Smith forms, A toric positivstellensatz with applications to delay systems, Induced \(\mathcal{L}_2\)-gain computation for rational LPV systems using Finsler's lemma and minimal generators, Cooperativity, absolute interaction, and algebraic optimization, Certifying convergence of Lasserre's hierarchy via flat truncation, On the complexity of testing attainment of the optimal value in nonlinear optimization, Sparse linear regression from perturbed data, Exact determinations of the maximal output admissible set for a class of nonlinear systems, Stability and robustness analysis of nonlinear systems via contraction metrics and SOS programming, Atomic optimization. I: Search space transformation and one-dimensional problems, A computational approach to non-smooth optimization by diffusion equations, Semidefinite relaxations for semi-infinite polynomial programming, Reconstruction of convex bodies from moments, Bi-criteria and approximation algorithms for restricted matchings, Efficiency improvement in an \(n\)D systems approach to polynomial optimization, An alternative approach for nonlinear optimal control problems based on the method of moments, A note on convex relaxations for the inverse eigenvalue problem, On solving a class of fractional semi-infinite polynomial programming problems, Exploiting term sparsity in noncommutative polynomial optimization, Stable rank-one matrix completion is solved by the level \(2\) Lasserre relaxation, The sum-of-squares hierarchy on the sphere and applications in quantum information theory, A tight degree 4 sum-of-squares lower bound for the Sherrington-Kirkpatrick Hamiltonian, Leveraged least trimmed absolute deviations, Numerical multilinear algebra and its applications, Intrinsic complexity estimates in polynomial optimization, Global optimization for sum of generalized fractional functions, Global minimization of rational functions and the nearest GCDs, A solution algorithm for non-convex mixed integer optimization problems with only few continuous variables, Stability of polytopes of matrices via affine parameter-dependent Lyapunov functions: asymptotically exact LMI conditions, Global optimization of rational functions: a semidefinite programming approach, Uniform stabilization of discrete-time switched and Markovian jump linear systems, Minimizing polynomials via sum of squares over the gradient ideal, Polynomial optimization on some unbounded closed semi-algebraic sets, Tensor complementarity problems. II: Solution methods, A fully distributed traffic allocation algorithm for nonconcave utility maximization in connectionless communication networks, Computing lower rank approximations of matrix polynomials, Alternative SDP and SOCP approximations for polynomial optimization, Regularized nonlinear acceleration, Sieve-SDP: a simple facial reduction algorithm to preprocess semidefinite programs, Solving sparse polynomial optimization problems with chordal structure using the sparse bounded-degree sum-of-squares hierarchy, A new updating method for the damped mass-spring systems, A semidefinite relaxation method for second-order cone polynomial complementarity problems, On semi-infinite systems of convex polynomial inequalities and polynomial optimization problems, SDP relaxation algorithms for \(\mathbf{P(P}_0)\)-tensor detection, Iterative methods for computing U-eigenvalues of non-symmetric complex tensors with application in quantum entanglement, Higher-degree tensor eigenvalue complementarity problems, Saddle points of rational functions, Set-completely-positive representations and cuts for the max-cut polytope and the unit modulus lifting, Modeling and estimation of thermal flows based on transport and balance equations, Unfoldings and the rank-one approximation of the tensor, Test of copositive tensors, A semidefinite relaxation algorithm for checking completely positive separable matrices, An overview of semidefinite relaxations for optimal power flow problem, Lower bounds on matrix factorization ranks via noncommutative polynomial optimization, T-optimal designs for multi-factor polynomial regression models via a semidefinite relaxation method, Tight relaxations for polynomial optimization and Lagrange multiplier expressions, Sherali-Adams relaxations of graph isomorphism polytopes, Set membership identification of switched linear systems with known number of subsystems, Minimizing trigonometric matrix polynomials over semi-algebraic sets, Completely positive reformulations for polynomial optimization, An alternative proof of a PTAS for fixed-degree polynomial optimization over the simplex, Certification of real inequalities: templates and sums of squares, Cutting planes for RLT relaxations of mixed 0-1 polynomial programs, Exploiting symmetry in copositive programs via semidefinite hierarchies, Rank-constrained fundamental matrix estimation by polynomial global optimization versus the eight-point algorithm, Error bounds for polynomial optimization over the hypercube using Putinar type representations, Univariate parameterization for global optimization of mixed-integer polynomial problems, Positive semi-definiteness and sum-of-squares property of fourth order four dimensional Hankel tensors, A tensor analogy of Yuan's theorem of the alternative and polynomial optimization with sign structure, Extension of completely positive cone relaxation to moment cone relaxation for polynomial optimization, Semidefinite programming relaxation methods for global optimization problems with sparse polynomials and unbounded semialgebraic feasible sets, Stability and genericity for semi-algebraic compact programs, A probabilistic interpretation of set-membership filtering: application to polynomial systems through polytopic bounding, Nonnegative Morse polynomial functions and polynomial optimization, Distributionally robust mixed integer linear programs: persistency models with applications, Global optimization with spline constraints: a new branch-and-bound method based on B-splines, On the reduction of multivariate quadratic systems to best rank-1 approximation of three-way tensors, Book review of: J.-B. Lasserre, An introduction to polynomial and semi-algebraic optimization, Continuous multifacility ordered median location problems, An application-oriented approach to dual control with excitation for closed-loop identification, Sums of squares on the hypercube, Generating cutting planes for the semidefinite relaxation of quadratic programs, A copositive formulation for the stability number of infinite graphs, Sparse sums of squares on finite abelian groups and improved semidefinite lifts, Real ideal and the duality of semidefinite programming for polynomial optimization, Algorithmic aspects of sums of Hermitian squares of noncommutative polynomials, A novel LMI-based optimization algorithm for the guaranteed estimation of the domain of attraction using rational Lyapunov functions, Bounded error identification of Hammerstein systems through sparse polynomial optimization, Lion pride optimizer: an optimization algorithm inspired by lion pride behavior, Welfare-maximizing correlated equilibria using Kantorovich polynomials with sparsity, Facial reduction algorithms for conic optimization problems, Semidefinite relaxations of dynamical programs under discrete constraints, Lower bounds for a polynomial in terms of its coefficients, Partitioning procedure for polynomial optimization, Finding the maximum eigenvalue of essentially nonnegative symmetric tensors via sum of squares programming, On the Kalman-Yakubovich-Popov lemma and the multidimensional models, Approximation algorithms for homogeneous polynomial optimization with quadratic constraints, An approximation bound analysis for Lasserre's relaxation in multivariate polynomial optimization, An effective implementation of symbolic-numeric cylindrical algebraic decomposition for quantifier elimination, Theoretical filtering of RLT bound-factor constraints for solving polynomial programming problems to global optimality, A facial reduction algorithm for finding sparse SOS representations, Suboptimal switching control consistency analysis for discrete-time switched linear systems, Solution to global minimization of polynomials by backward differential flow, POS3POLY -- a MATLAB preprocessor for optimization with positive polynomials, Optimality conditions and finite convergence of Lasserre's hierarchy, Copositivity and constrained fractional quadratic problems, Globally optimal algorithms for stratified autocalibration, An efficient DC programming approach for portfolio decision with higher moments, Necessary global optimality conditions for nonlinear programming problems with polynomial constraints, A numerical algorithm for block-diagonal decomposition of matrix \(*\)-algebras with application to semidefinite programming, Global optimization of polynomials restricted to a smooth variety using sums of squares, Global quadratic minimization over bivalent constraints: necessary and sufficient global optimality condition, Computation of correlated equilibrium with global-optimal expected social welfare, Positivstellensätze for real function algebras, Some geometric properties of successive difference substitutions, Copositive optimization -- recent developments and applications, Think co(mpletely)positive! Matrix properties, examples and a clustered bibliography on copositive optimization, Necessary optimality conditions and new optimization methods for cubic polynomial optimization problems with mixed variables, Closures of quadratic modules, Deterministic approximation algorithms for sphere constrained homogeneous polynomial optimization problems, On the complexity of computing the handicap of a sufficient matrix, Controller synthesis for robust invariance of polynomial dynamical systems using linear programming, The truncated moment problem via homogenization and flat extensions, Enforcing stability constraints in set-membership identification of linear dynamic systems, Enhancing RLT-based relaxations for polynomial programming problems via a new class of \(v\)-semidefinite cuts, Robust control of uncertain systems: classical results and recent developments, Lower bounds on the global minimum of a polynomial, A Frank-Wolfe type theorem for nondegenerate polynomial programs, Min-max and robust polynomial optimization, A probabilistic symbolic algorithm to find the minimum of a polynomial function on a basic closed semialgebraic set, Discriminants and nonnegative polynomials, Establishing robust stability of discrete-time systems with time-varying uncertainty: the Gram-SOS approach, Separating inequalities for nonnegative polynomials that are not sums of squares, On polynomial optimization over non-compact semi-algebraic sets, Semidefinite programming for min-max problems and games, First order conditions for semidefinite representations of convex sets defined by rational or singular polynomials, The \(\mathcal A\)-truncated \(K\)-moment problem, On local convexity of quadratic transformations, Proving inequalities and solving global optimization problems via simplified CAD projection, Further results on Cauchy tensors and Hankel tensors, Cross-Hill: a heuristic method for global optimization, Zero-convex functions, perturbation resilience, and subgradient projections for feasibility-seeking methods, A generalization of Löwner-John's ellipsoid theorem, A reliable affine relaxation method for global optimization, Analysis of copositive optimization based linear programming bounds on standard quadratic optimization, Global optimality conditions and optimization methods for polynomial programming problems, 2D system analysis via dual problems and polynomial matrix inequalities, Exactness criteria for SDP-relaxations of quadratic extremum problems, Semidefinite approximations of conical hulls of measured sets, Branch and bound algorithm with applications to robust stability, A semidefinite algorithm for completely positive tensor decomposition, Approximation algorithms for optimization of real-valued general conjugate complex forms, Convergence analysis for Lasserre's measure-based hierarchy of upper bounds for polynomial optimization, Optimal switching between cash-flow streams, Norm bounds and underestimators for unconstrained polynomial integer minimization, Simple approximations of semialgebraic sets and their applications to control, A robust Lagrangian-DNN method for a class of quadratic optimization problems, Sum of squares methods for minimizing polynomial forms over spheres and hypersurfaces, A polynomial optimization approach to constant rebalanced portfolio selection, The domain of attraction for the endemic equilibrium of an SIRS epidemic model, Convex relaxations for mixed integer predictive control, Dynamic modeling and analysis of the email virus propagation, Nonsmooth bundle trust-region algorithm with applications to robust stability, Polynomial optimization with applications to stability analysis and control -- alternatives to sum of squares, Controller design and value function approximation for nonlinear dynamical systems, A dynamic inequality generation scheme for polynomial programming, Generalized Gauss inequalities via semidefinite programming, Nonnegative polynomials and sums of squares, Computation with Polynomial Equations and Inequalities Arising in Combinatorial Optimization, Limitations of Algebraic Approaches to Graph Isomorphism Testing, Query Complexity in Expectation, On the Hardest Problem Formulations for the $$0/1$$ Lasserre Hierarchy, A Lasserre Lower Bound for the Min-Sum Single Machine Scheduling Problem, Unnamed Item, Successive Rank-One Approximations for Nearly Orthogonally Decomposable Symmetric Tensors, Convexifying Positive Polynomials and Sums of Squares Approximation, Characteristic polynomial assignment for plants with semialgebraic uncertainty: A robust diophantine equation approach, Copositivity cuts for improving SDP bounds on the clique number, Lehman's Theorem and the Directed Steiner Tree Problem, Semidefinite and Linear Programming Integrality Gaps for Scheduling Identical Machines, Quantum Bilinear Optimization, Globally optimal estimates for geometric reconstruction problems, Optimal Data Fitting: A Moment Approach, An explicit semidefinite characterization of satisfiability for Tseitin instances on toroidal grid graphs, A conversion of an SDP having free variables into the standard form SDP, A note on the stability number of an orthogonality graph, Some Recent Developments in Spectrahedral Computation, Minimizer Extraction in Polynomial Optimization Is Robust, A polynomial approach for optimal control of switched nonlinear systems, Solving polynomial least squares problems via semidefinite programming relaxations, Can you compute the operator norm?, A note on the Lasserre hierarchy for different formulations of the maximum independent set problem, Finding the extreme Z-eigenvalues of tensors via a sequential semidefinite programming method, The Z -eigenvalues of a symmetric tensor and its application to spectral hypergraph theory, Converging outer approximations to global attractors using semidefinite programming, Semidefinite relaxation method for polynomial optimization with second-order cone complementarity constraints, Least-squares solutions to polynomial systems of equations with quantum annealing, Convergence of an SDP hierarchy and optimality of robust convex polynomial optimization problems, Strong SOCP Relaxations for the Optimal Power Flow Problem, On the equivalence of two post-quantum cryptographic families, Strengthened SDP relaxation for an extended trust region subproblem with an application to optimal power flow, Convex generalized Nash equilibrium problems and polynomial optimization, Finite-dimensional completion for the matrix-valued truncated complex moment problem, On New Classes of Nonnegative Symmetric Tensors, Improved Convergence Rates for Lasserre-Type Hierarchies of Upper Bounds for Box-Constrained Polynomial Optimization, An effective version of Schmüdgen's Positivstellensatz for the hypercube, Loss functions for finite sets, A matrix nonconvex relaxation approach to unconstrained binary polynomial programs, On the Hardest Problem Formulations for the 0/1 Lasserre Hierarchy, Sum of squares basis pursuit with linear and second order cone programming, RobustH_∞performance using lifted polynomial parameter-dependent Lyapunov functions, A Survey of Semidefinite Programming Approaches to the Generalized Problem of Moments and Their Error Analysis, Sequential Convex Programming for the Efficient Verification of Parametric MDPs, Improved parameter bounds for set-membership EIV problems, Positive polynomials and sequential closures of quadratic modules, An Iterative Scheme for Valid Polynomial Inequality Generation in Binary Polynomial Programming, Integrality Gaps of Linear and Semi-Definite Programming Relaxations for Knapsack, SDP RELAXATIONS FOR QUADRATIC OPTIMIZATION PROBLEMS DERIVED FROM POLYNOMIAL OPTIMIZATION PROBLEMS, Analog circuit design by nonconvex polynomial optimization: Two design examples, Canonical Duality Theory: Connections between Nonconvex Mechanics and Global Optimization, Polynomials nonnegative on a grid and discrete optimization, New upper bounds for kissing numbers from semidefinite programming, Coarse-Convex-Compactification Approach to Numerical Solution of Nonconvex Variational Problems, Matrix sum-of-squares relaxations for robust semi-definite programs, Robust global optimization with polynomials, Bounds on linear PDEs via semidefinite optimization, Robust static output feedback design for polynomial nonlinear systems, The CP-Matrix Approximation Problem, Establishing stability and instability of matrix hypercubes, LMI conditions for robust stability analysis based on polynomially parameter-dependent Lyapunov functions, LMIs for constrained polynomial interpolation with application in trajectory planning, Complete solutions and extremality criteria to polynomial optimization problems, A semidefinite programming based polyhedral cut and price approach for the maxcut problem, Convergent Semidefinite Programming Relaxations for Global Bilevel Polynomial Optimization Problems, Deniable Functional Encryption, LMI relaxations in robust control, Semidefinite programming relaxations and algebraic optimization in control, Introduction to Semidefinite, Conic and Polynomial Optimization, The Approach of Moments for Polynomial Equations, Convex Hulls of Algebraic Sets, A “Joint+Marginal” Approach in Optimization, Convexity and Semidefinite Programming in Dimension-Free Matrix Unknowns, Positivity and Optimization: Beyond Polynomials, Exploiting Sparsity in SDP Relaxation of Polynomial Optimization Problems, SDP Relaxations for Non-Commutative Polynomial Optimization, Latest Developments in the SDPA Family for Solving Large-Scale SDPs, Sum of Squares Certificates for Containment of $\mathcal{H}$-Polytopes in $\mathcal{V}$-Polytopes, Relative Entropy Relaxations for Signomial Optimization, Positive Maps and Separable Matrices, Preprocessing sparse semidefinite programs via matrix completion, Perturbed sums-of-squares theorem for polynomial optimization and its applications, GpoSolver: a Matlab/C++ toolbox for global polynomial optimization, ORBITOPES, Border Basis for Polynomial System Solving and Optimization, On semidefinite bounds for maximization of a non-convex quadratic objective over thel₁unit ball, Algorithm 950, Generation of signals with specified second-order properties for constrained systems, Exact Algorithms for Linear Matrix Inequalities, Completely Positive Tensors: Properties, Easily Checkable Subclasses, and Tractable Relaxations, Sum-of-Squares Rank Upper Bounds for Matching Problems, Testing the Dimension of Hilbert Spaces, Equivalence of sum of squares convex relaxations for quadratic distance problems, Charges solve the truncated complex moment problem, Cuts for mixed 0-1 conic programming, Extrema of a real polynomial, Polyhedra related to integer-convex polynomial systems, On matrix algebras associated to sum-of-squares semidefinite programs, Convergence of Lasserre's hierarchy: the general case, Continuous-variable nonlocality and contextuality, Local saddle points for unconstrained polynomial optimization, Symmetry groups, semidefinite programs, and sums of squares, Ellipsoidal bounds for uncertain linear equations and dynamical systems, On the tightness of semidefinite relaxations for rotation estimation, Applications of optimal transportation in the natural sciences. Abstracts from the workshop held February 21--27, 2021 (online meeting), Optimization over the Boolean hypercube via sums of nonnegative circuit polynomials, Bounding the separable rank via polynomial optimization, Noisy tensor completion via the sum-of-squares hierarchy, Quantum entanglement, symmetric nonnegative quadratic polynomials and moment problems, Convergence analysis of a Lasserre hierarchy of upper bounds for polynomial minimization on the sphere, Doubly nonnegative relaxations for quadratic and polynomial optimization problems with binary and box constraints, Sparse noncommutative polynomial optimization, On the complexity of Putinar-Vasilescu's Positivstellensatz, Positivity certificates and polynomial optimization on non-compact semialgebraic sets, Semidefinite programming hierarchies for constrained bilinear optimization, Duality of sum of nonnegative circuit polynomials and optimal SONC bounds, Certifying the global optimality of quartic minimization over the sphere, On the exactness of sum-of-squares approximations for the cone of \(5 \times 5\) copositive matrices, How to generate weakly infeasible semidefinite programs via Lasserre's relaxations for polynomial optimization, A ``joint + marginal heuristic for 0/1 programs, Global optimization of polynomial-expressed nonlinear optimal control problems with semidefinite programming relaxation, A semidefinite approach for truncated \(K\)-moment problems, Computation of polytopic invariants for polynomial dynamical systems using linear programming, The membership problem for finitely generated quadratic modules in the univariate case, Strange behaviors of interior-point methods for solving semidefinite programming problems in polynomial optimization, On solving biquadratic optimization via semidefinite relaxation, An algorithm for semi-infinite polynomial optimization, The moment problem for continuous positive semidefinite linear functionals, Exact SDP relaxations for classes of nonlinear semidefinite programming problems, Multi-parametric disaggregation technique for global optimization of polynomial programming problems, An exact Jacobian SDP relaxation for polynomial optimization, The tracial moment problem and trace-optimization of polynomials, Enclosing ellipsoids and elliptic cylinders of semialgebraic sets and their application to error bounds in polynomial optimization, A perfect example for the BFGS method, Solution to singular optimal control by backward differential flow, Convex underestimators of polynomials, Positive hybrid real-trigonometric polynomials and applications to adjustable filter design and absolute stability analysis, On sums of squares of \(K\)-nomials, Optimization and stabilization of hierarchical electrical networks, An approach to constrained polynomial optimization via nonnegative circuit polynomials and geometric programming, Real eigenvalues of nonsymmetric tensors, Tensor maximal correlation problems, Polynomial optimization for water networks: global solutions for the valve setting problem, The tracial moment problem on quadratic varieties, An SDP method for copositivity of partially symmetric tensors, On the exactness of Lasserre relaxations and pure states over real closed fields, A hybrid second-order method for homogenous polynomial optimization over unit sphere, Computing geometric measure of entanglement for symmetric pure states via the Jacobian SDP relaxation technique, An improved semidefinite programming relaxation for the satisfiability problem, Positive univariate trace polynomials, Sparsity in sums of squares of polynomials, Penalized semidefinite programming for quadratically-constrained quadratic optimization, A semidefinite relaxation method for second-order cone tensor eigenvalue complementarity problems, Convex computation of extremal invariant measures of nonlinear dynamical systems and Markov processes, Inverse conic programming with applications, A completely positive formulation of the graph isomorphism problem and its positive semidefinite relaxation, Method for constructing Stieltjes classes for \(M\)-indeterminate probability distributions, A survey on conic relaxations of optimal power flow problem, Parametrized matrix inequalities in analysis of linear dynamic systems, Approximating Pareto curves using semidefinite relaxations, The Gauss-Seidel method for generalized Nash equilibrium problems of polynomials, Tensor \(Z\)-eigenvalue complementarity problems, A MAX-CUT formulation of 0/1 programs, Symmetric ideals, Specht polynomials and solutions to symmetric systems of equations, On exact Reznick, Hilbert-Artin and Putinar's representations, Lower bounds for cubic optimization over the sphere, The truncated Hamburger moment problems with gaps in the index set, Multi-objective convex polynomial optimization and semidefinite programming relaxations, A dynamic game approach to distributionally robust safety specifications for stochastic systems, Sparse semidefinite programs with guaranteed near-linear time complexity via dualized clique tree conversion, Semidefinite and linear programming integrality gaps for scheduling identical machines, An efficient global algorithm for worst-case linear optimization under uncertainties based on nonlinear semidefinite relaxation, Near-optimal analysis of Lasserre's univariate measure-based bounds for multivariate polynomial optimization, Solving mixed-integer nonlinear optimization problems using simultaneous convexification: a case study for gas networks, The moment-SOS hierarchy and the Christoffel-Darboux kernel, An arc-search infeasible interior-point method for semidefinite optimization with the negative infinity neighborhood, Detecting optimality and extracting solutions in polynomial optimization with the truncated GNS construction, Safety of stochastic systems: an analytic and computational approach, Newton polytopes and relative entropy optimization, Optimization over trace polynomials, A sublevel moment-SOS hierarchy for polynomial optimization, An efficient alternating minimization method for fourth degree polynomial optimization, The linearization problem of a binary quadratic problem and its applications, Exploiting sparsity in complex polynomial optimization, Computing in combinatorial optimization, Unconstrained minimization of block-circulant polynomials via semidefinite program in third-order tensor space, An approximation algorithm for the maximum spectral subgraph problem, AC optimal power flow: a conic programming relaxation and an iterative MILP scheme for global optimization, A global optimization method for multiple response optimization problems, Dimension-free entanglement detection in multipartite Werner states, Notes on computational hardness of hypothesis testing: predictions using the low-degree likelihood ratio, Distributionally robust optimization with moment ambiguity sets, An SDP relaxation method for Perron pairs of a nonnegative tensor, Finding the global optimum of a class of quartic minimization problem, Heat transport bounds for a truncated model of Rayleigh-Bénard convection via polynomial optimization, A convex optimization approach to synthesizing state feedback data-driven controllers for switched linear systems, Maximal quadratic-free sets, Fair colorful \(k\)-center clustering, A modified infeasible interior-point algorithm with full-Newton step for semidefinite optimization, Further results on sum-of-squares tensors, Fair Colorful k-Center Clustering, Maximal Quadratic-Free Sets, Dual Certificates and Efficient Rational Sum-of-Squares Decompositions for Polynomial Optimization over Compact Sets, Lifting the Convex Conjugate in Lagrangian Relaxations: A Tractable Approach for Continuous Markov Random Fields, Lifting for Simplicity: Concise Descriptions of Convex Sets, Noncommutative Christoffel-Darboux kernels, Mathematical Programming Models and Exact Algorithms, Sum-of-Squares Hierarchies for Polynomial Optimization and the Christoffel--Darboux Kernel, SOS Is Not Obviously Automatizable, Even Approximately, Confidence regions for the location of response surface optima: the R package OptimaRegion, Disordered systems insights on computational hardness, Linearly Solvable Stochastic Control Lyapunov Functions, An accelerated first-order method for solving SOS relaxations of unconstrained polynomial optimization problems, Finding Minimum Volume Circumscribing Ellipsoids Using Generalized Copositive Programming, Mixed-Projection Conic Optimization: A New Paradigm for Modeling Rank Constraints, Unnamed Item, Voronoi Diagram and Delaunay Triangulation with Independent and Dependent Geometric Uncertainties, Finite Convergence of Sum-of-Squares Hierarchies for the Stability Number of a Graph, On the Exactness of Lasserre Relaxations for Compact Convex Basic Closed Semialgebraic Sets, Qualification Conditions in Semialgebraic Programming, Tractable Relaxations of Composite Functions, Optimization on the Euclidean Unit Sphere, Convergence of a Constrained Vector Extrapolation Scheme, Unnamed Item, Greedy Approaches to Symmetric Orthogonal Tensor Decomposition, Sampling Algebraic Varieties for Sum of Squares Programs, Revisiting Stochastic Loss Networks: Structures and Approximations, On the Construction of Converging Hierarchies for Polynomial Optimization Based on Certificates of Global Positivity, Unnamed Item, A Multigrid Approach to SDP Relaxations of Sparse Polynomial Optimization Problems, Unnamed Item, Real Radicals and Finite Convergence of Polynomial Optimization Problems, Application of direct extended modified algebraic method of Bogoyavlenskii equation on lower and upper bounds in managing and optimizing queues, Distributionally Robust Optimization with Infinitely Constrained Ambiguity Sets, Bounding extrema over global attractors using polynomial optimisation, Computing the Hausdorff Boundary Measure of Semialgebraic Sets, Polynomial Norms, The Convex Hull of a Quadratic Constraint over a Polytope, Exploring the Limits of Subadditive Approaches: Parallels between Optimization and Complexity Theory, Stability and Bifurcations in a Model of Bacteria Immunity with Quorum Sensing, Sum-of-Squares Optimization without Semidefinite Programming, A paradox in bosonic energy computations via semidefinite programming relaxations, A guide to conic optimisation and its applications, The Lov\'asz Theta Function for Random Regular Graphs and Community Detection in the Hard Regime, Consistency Analysis for Massively Inconsistent Datasets in Bound-to-Bound Data Collaboration, TSSOS: A Moment-SOS Hierarchy That Exploits Term Sparsity, Chordal-TSSOS: A Moment-SOS Hierarchy That Exploits Term Sparsity with Chordal Extension, Lasserre Hierarchy for Large Scale Polynomial Optimization in Real and Complex Variables, Minimizing Rational Functions: A Hierarchy of Approximations via Pushforward Measures, Semidefinite Optimization Estimating Bounds on Linear Functionals Defined on Solutions of Linear ODEs, Hilbert’s 17th problem in free skew fields, A new branch-and-bound algorithm for standard quadratic programming problems, Combining qualitative information and semi‐quantitative data for guaranteed invalidation of biochemical network models, A Lagrange Multiplier Expression Method for Bilevel Polynomial Optimization, Minimum wave speeds in monostable reaction–diffusion equations: sharp bounds by polynomial optimization, BREAKING THE RECTANGLE BOUND BARRIER AGAINST FORMULA SIZE LOWER BOUNDS, Alternating direction method of multipliers for real and complex polynomial optimization models, Adaptive computable approximation to cones of nonnegative quadratic functions, Bounding the parameters of block‐structured nonlinear feedback systems, Computational and statistical tradeoffs via convex relaxation, Approximation of Model Predictive Control Laws for Polynomial Systems, Smoothing and Regularization for Mixed-Integer Second-Order Cone Programming with Applications in Portfolio Optimization, Optimizing ordered median functions with applications to single facility location, A note on optimization with Morse polynomials, Unnamed Item, Unnamed Item, A Complete Semidefinite Algorithm for Detecting Copositive Matrices and Tensors, Best Nonnegative Rank-One Approximations of Tensors, Time-Varying Semidefinite Programs, Unnamed Item, Certifying Polynomial Nonnegativity via Hyperbolic Optimization, Stabilisation of discrete-time systems via Schur stability region, Algorithm 996, Algorithm 998, The sliding Frank–Wolfe algorithm and its application to super-resolution microscopy, A Matrix Positivstellensatz with Lifting Polynomials, Stochastic polynomial optimization, A mixed PI/VI design method for nonlinear H_∞ Control, The quintic complex moment problem, Moment methods in energy minimization: New bounds for Riesz minimal energy problems, Comparison of Lasserre’s Measure-Based Bounds for Polynomial Optimization to Bounds Obtained by Simulated Annealing, No Small Linear Program Approximates Vertex Cover Within a Factor 2 − ɛ, Short Proofs Are Hard to Find, Size-degree trade-offs for sums-of-squares and positivstellensatz proofs, Bounding Extreme Events in Nonlinear Dynamics Using Convex Optimization, Semidefinite Approximations of Reachable Sets for Discrete-time Polynomial Systems, The Lovász Theta Function for Random Regular Graphs and Community Detection in the Hard Regime, In SDP Relaxations, Inaccurate Solvers Do Robust Optimization, Convex Algebraic Geometry of Curvature Operators, Contextuality, memory cost and non-classicality for sequential measurements, Semidefinite Programming and Nash Equilibria in Bimatrix Games, An Iterative Rank Penalty Method for Nonconvex Quadratically Constrained Quadratic Programs, A Semidefinite Hierarchy for Containment of Spectrahedra, Unnamed Item, Formal Proofs for Nonlinear Optimization, Passivity and passivity indices of nonlinear systems under operational limitations using approximations, Optimal Drug Treatment in a Simple Pandemic Switched System Using Polynomial Approach, Control analysis and design via randomised coordinate polynomial minimisation, Beating the SDP bound for the floor layout problem: a simple combinatorial idea, Learning Dynamical Systems with Side Information, Sum of Squares Decompositions of Polynomials over their Gradient Ideals with Rational Coefficients, Algebraic Perspectives on Signomial Optimization, Robust stability, ℋ₂ analysis and stabilisation of discrete-time Markov jump linear systems with uncertain probability matrix, The Power of Sherali--Adams Relaxations for General-Valued CSPs, Bilevel Polynomial Programs and Semidefinite Relaxation Methods, On the effective Putinar's Positivstellensatz and moment approximation, Homogenization for polynomial optimization with unbounded sets, Convex computation of maximal Lyapunov exponents, A practical approach to SOS relaxations for detecting quantum entanglement, Partial Lasserre relaxation for sparse Max-Cut, Algebraic optimization of sequential decision problems, Stability analysis of a bacterial growth model through computer algebra, A hierarchy of spectral relaxations for polynomial optimization, A proximal alternating minimization algorithm for the largest C-eigenvalue of piezoelectric-type tensors, Auxiliary functions as Koopman observables: data-driven analysis of dynamical systems via polynomial optimization, Semidefinite Relaxation Methods for Tensor Absolute Value Equations, A unified framework for the identification of a general class of multivariable nonlinear block‐structured systems, Real algebraic geometry with a view toward Koopman operator methods. Abstracts from the workshop held March 12--17, 2023, New directions in real algebraic geometry. Abstracts from the workshop held March 19--24, 2023, A conflict-directed approach to chance-constrained mixed logical linear programming, Definable Ellipsoid Method, Sums-of-Squares Proofs, and the Graph Isomorphism Problem, A note on the computational complexity of the moment-SOS hierarchy for polynomial optimization, Pourchet’s theorem in action: decomposing univariate nonnegative polynomials as sums of five squares, Distance to a constitutive tensor isotropy stratum by the Lasserre polynomial optimization method, A less conservative robust control method for a class of nonpassive uncertain systems, A Sum of Squares Characterization of Perfect Graphs, Optimality conditions for homogeneous polynomial optimization on the unit sphere, Minimal energy configurations of bilayer plates as a polynomial optimization problem, Dehomogenization for completely positive tensors, A new scheme for approximating the weakly efficient solution set of vector rational optimization problems, Optimization under uncertainty and risk: quadratic and copositive approaches, The smallest mono-unstable convex polyhedron with point masses has 8 faces and 11 vertices, Convergence rates of gradient methods for convex optimization in the space of measures, (Global) optimization: historical notes and recent developments, Rational Generalized Nash Equilibrium Problems, On the degree of varieties of sum of squares, Swarm gradient dynamics for global optimization: the mean-field limit case, Exploiting ideal-sparsity in the generalized moment problem with application to matrix factorization ranks, Mathematical imaging and surface processing. Abstracts from the workshop held August 21--27, 2022, A Correlatively Sparse Lagrange Multiplier Expression Relaxation for Polynomial Optimization, Bootstrap, Markov chain Monte Carlo, and LP/SDP hierarchy for the lattice Ising model, Hausdorff distance between convex semialgebraic sets, Convex Relaxations of Integral Variational Problems: Pointwise Dual Relaxation and Sum-of-Squares Optimization, Construction of Multivariate Polynomial Approximation Kernels via Semidefinite Programming, On the polyhedral homotopy method for solving generalized Nash equilibrium problems of polynomials, Generalized truncated moment problems with unbounded sets, Existence of the least element solution of the vertical block \(Z\)-tensor complementarity problem, An inexact projected gradient method with rounding and lifting by nonlinear programming for solving rank-one semidefinite relaxation of polynomial optimization, Conic linear optimization for computer-assisted proofs. Abstracts from the workshop held April 10--16, 2022, A rigorous deterministic global optimization approach for the derivation of secondary information in digital maps, Exponential Convergence of Sum-of-Squares Hierarchies for Trigonometric Polynomials, Tighter bounds on transient moments of stochastic chemical systems, Invariants of SDP exactness in quadratic programming, The Spectrum of the Grigoriev–Laurent Pseudomoments, Shortest Paths in Graphs of Convex Sets, Subset Selection and the Cone of Factor-Width-k Matrices, How Do Exponential Size Solutions Arise in Semidefinite Programming?, Utility/privacy trade-off as regularized optimal transport, Harmonic Hierarchies for Polynomial Optimization, Degree Bounds for Putinar’s Positivstellensatz on the Hypercube, Generic Properties for Semialgebraic Programs, A Positivstellensatz for Sums of Nonnegative Circuit Polynomials, Symmetric Tensor Nuclear Norms, Unnamed Item, Deciding Robust Feasibility and Infeasibility Using a Set Containment Approach: An Application to Stationary Passive Gas Network Operations, A semidefinite method for tensor complementarity problems, DSOS and SDSOS Optimization: More Tractable Alternatives to Sum of Squares and Semidefinite Optimization, Quantitative local L₂‐gain and Reachability analysis for nonlinear systems, Robust stabilisation of polynomial systems with uncertain parameters, Exact Semidefinite Programming Relaxations with Truncated Moment Matrix for Binary Polynomial Optimization Problems, Distributionally Robust Reward-Risk Ratio Optimization with Moment Constraints, Convergence analysis of a block improvement method for polynomial optimization over unit spheres, Well-Posedness in Unconstrained Polynomial Optimization Problems, An Almost Optimal Algorithm for Computing Nonnegative Rank, Validating numerical semidefinite programming solvers for polynomial invariants, Intersection cuts for nonlinear integer programming: convexification techniques for structured sets, Strong duality in lasserre's hierarchy for polynomial optimization, Constrained trace-optimization of polynomials in freely noncommuting variables, PRICING A CLASS OF EXOTIC OPTIONS VIA MOMENTS AND SDP RELAXATIONS, Sum-of-squares hierarchies for binary polynomial optimization, Sum-of-squares hierarchies for binary polynomial optimization, Radii minimal projections of polytopes and constrained optimization of symmetric polynomials, Computation of parameter stability margins using polynomial programming techniques, Inhomogeneous polynomial optimization over a convex set: An approximation approach, Positive Gorenstein ideals, Limits of positive flat bivariate moment matrices, Approximating amoebas and coamoebas by sums of squares, Copositive Relaxation Beats Lagrangian Dual Bounds in Quadratically and Linearly Constrained Quadratic Optimization Problems, Semidefinite Programming For Chance Constrained Optimization Over Semialgebraic Sets, An Error Analysis for Polynomial Optimization over the Simplex Based on the Multivariate Hypergeometric Distribution, High Degree Sum of Squares Proofs, Bienstock--Zuckerberg Hierarchy, and Chvátal--Gomory Cuts, The maximum tensor complementarity eigenvalues, Unnamed Item, A Hierarchy of Standard Polynomial Programming Formulations for the Maximum Clique Problem, A Semidefinite Relaxation Method for Partially Symmetric Tensor Decomposition