Detecting Global Optimality and Extracting Solutions in GloptiPoly
From MaRDI portal
Publication:4681658
DOI10.1007/10997703_15zbMath1119.93301OpenAlexW2498144272MaRDI QIDQ4681658
Didier Henrion, Jean-Bernard Lasserre
Publication date: 24 June 2005
Published in: Positive Polynomials in Control (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/10997703_15
Semidefinite programming (90C22) Software, source code, etc. for problems pertaining to systems and control theory (93-04)
Related Items
Dehomogenization for completely positive tensors, Rational Generalized Nash Equilibrium Problems, Exploiting ideal-sparsity in the generalized moment problem with application to matrix factorization ranks, A Correlatively Sparse Lagrange Multiplier Expression Relaxation for Polynomial Optimization, Hausdorff distance between convex semialgebraic sets, Local saddle points for unconstrained polynomial optimization, Separability of Hermitian tensors and PSD decompositions, Noncommutative Christoffel-Darboux kernels, Computation with Polynomial Equations and Inequalities Arising in Combinatorial Optimization, Computing the distance between the linear matrix pencil and the completely positive cone, Moments and sums of squares for polynomial optimization and related problems, Approximate gcds of polynomials and sparse SOS relaxations, Completely positive tensor recovery with minimal nuclear value, Positivity certificates and polynomial optimization on non-compact semialgebraic sets, Globally optimal estimates for geometric reconstruction problems, A recursive algorithm of exactness verification of relaxations for robust SDPs, Certifying the global optimality of quartic minimization over the sphere, Minimizer Extraction in Polynomial Optimization Is Robust, Representations of positive polynomials on noncompact semialgebraic sets via KKT ideals, The saddle point problem of polynomials, Tensor eigenvalue complementarity problems, A bounded degree SOS hierarchy for polynomial optimization, Dual form reduction in the atomic optimization method, How to generate weakly infeasible semidefinite programs via Lasserre's relaxations for polynomial optimization, A semidefinite approach for truncated \(K\)-moment problems, Homogenization for polynomial optimization with unbounded sets, Algebraic optimization of sequential decision problems, A new approximation hierarchy for polynomial conic optimization, A hierarchy of spectral relaxations for polynomial optimization, Partially positive matrices, Optimality conditions and finite convergence of Lasserre's hierarchy, Real algebraic geometry with a view toward Koopman operator methods. Abstracts from the workshop held March 12--17, 2023, VerifyRealRoots: a Matlab package for computing verified real solutions of polynomials systems of equations and inequalities, Necessary global optimality conditions for nonlinear programming problems with polynomial constraints, Interiors of completely positive cones, Border basis relaxation for polynomial optimization, An exact Jacobian SDP relaxation for polynomial optimization, The tracial moment problem and trace-optimization of polynomials, Hermitian completely positive matrices, Completely positive tensors in the complex field, A Multigrid Approach to SDP Relaxations of Sparse Polynomial Optimization Problems, Quadratic tensor eigenvalue complementarity problems, Convex generalized Nash equilibrium problems and polynomial optimization, Certifying convergence of Lasserre's hierarchy via flat truncation, Symmetric Tensor Nuclear Norms, Certifying Unstability of Switched Systems Using Sum of Squares Programming, On the structure of generalized plant convexifying static \(H_\infty\) control problems, Optimal control of switching topology networks, Semidefinite relaxations for semi-infinite polynomial programming, Design of Marx generators as a structured eigenvalue assignment, A paradox in bosonic energy computations via semidefinite programming relaxations, The \(\mathcal A\)-truncated \(K\)-moment problem, On solving a class of fractional semi-infinite polynomial programming problems, 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, Zero-convex functions, perturbation resilience, and subgradient projections for feasibility-seeking methods, 2D system analysis via dual problems and polynomial matrix inequalities, Lebesgue decomposition in action via semidefinite relaxations, SDP RELAXATIONS FOR QUADRATIC OPTIMIZATION PROBLEMS DERIVED FROM POLYNOMIAL OPTIMIZATION PROBLEMS, Establishing tightness in robust \(\mathcal H _{\infty}\) analysis via homogeneous parameter-dependent Lyapunov functions, Analog circuit design by nonconvex polynomial optimization: Two design examples, A semidefinite algorithm for completely positive tensor decomposition, Norm bounds and underestimators for unconstrained polynomial integer minimization, Real eigenvalues of nonsymmetric tensors, Tensor maximal correlation problems, Global minimization of rational functions and the nearest GCDs, Application of facial reduction to H ∞ state feedback control problem, Minimizing polynomials via sum of squares over the gradient ideal, A hierarchy of semidefinite relaxations for completely positive tensor optimization problems, The CP-Matrix Approximation Problem, The Gauss-Seidel method for generalized Nash equilibrium problems of polynomials, LMI relaxations in robust control, Strong duality in lasserre's hierarchy for polynomial optimization, The Approach of Moments for Polynomial Equations, Exploiting Sparsity in SDP Relaxation of Polynomial Optimization Problems, Projection Methods in Conic Optimization, SDP Relaxations for Non-Commutative Polynomial Optimization, Multi-objective convex polynomial optimization and semidefinite programming relaxations, Sieve-SDP: a simple facial reduction algorithm to preprocess semidefinite programs, Stochastic polynomial optimization, Minimizing rational functions by exact Jacobian SDP relaxation applicable to finite singularities, Positive Maps and Separable Matrices, Monotonically positive matrices, Linear optimization with cones of moments and nonnegative polynomials, GpoSolver: a Matlab/C++ toolbox for global polynomial optimization, GloptiPoly, NCSOStools: a computer algebra system for symbolic and numerical computation with noncommutative polynomials, Test of copositive tensors, A semidefinite relaxation algorithm for checking completely positive separable matrices, An algorithm for the global optimization of a class of continuous minimax problems, A prolongation-projection algorithm for computing the finite real variety of an ideal, Semidefinite characterization and computation of zero-dimensional real radical ideals, Global optimization of robust chance constrained problems, In SDP Relaxations, Inaccurate Solvers Do Robust Optimization, A sublevel moment-SOS hierarchy for polynomial optimization, A generalized flat extension theorem for moment matrices, Unconstrained minimization of block-circulant polynomials via semidefinite program in third-order tensor space, T-optimal designs for multi-factor polynomial regression models via a semidefinite relaxation method, Tight relaxations for polynomial optimization and Lagrange multiplier expressions, The maximum tensor complementarity eigenvalues, Minimizing trigonometric matrix polynomials over semi-algebraic sets, The hierarchy of local minimums in polynomial optimization, Distributionally robust optimization with moment ambiguity sets
Uses Software
