GloptiPoly

swMATH4343MaRDI QIDQ16522FDOQ16522

Author name not available (Why is that?)

Described by source

• Detecting Global Optimality and Extracting Solutions in GloptiPoly

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

• The saddle point problem of polynomials
• Nonlinear \(H_\infty\) feedback control with integrator for polynomial discrete-time systems
• POS3POLY -- a MATLAB preprocessor for optimization with positive polynomials
• Strong duality in lasserre's hierarchy for polynomial optimization
• On the Equivalence of Algebraic Approaches to the Minimization of Forms on the Simplex
• Computation of the Lasserre Ranks of Some Polytopes
• An efficient DC programming approach for portfolio decision with higher moments
• A hierarchy of LMI inner approximations of the set of stable polynomials
• Modal occupation measures and LMI relaxations for nonlinear switched systems control
• Moment Problem and Its Applications to Risk Assessment
• Shear-driven planar Couette and Taylor-like instabilities for a class of compressible isotropic elastic solids
• An improved semidefinite programming relaxation for the satisfiability problem
• Global optimality conditions and optimization methods for constrained polynomial programming problems
• Tensor eigenvalue complementarity problems
• How to generate weakly infeasible semidefinite programs via Lasserre's relaxations for polynomial optimization
• An algorithm for constrained global optimization of multivariate polynomials using the Bernstein form and John optimality conditions
• Atomic optimization. I: Search space transformation and one-dimensional problems
• An efficient algorithm for range computation of polynomials using the Bernstein form
• Convex underestimators of polynomials
• Nonlinear state feedback control for a class of polynomial nonlinear discrete-time systems with norm-bounded uncertainties: an integrator approach
• Radii minimal projections of polytopes and constrained optimization of symmetric polynomials
• A robust unscented transformation for uncertain moments
• Linear control of time-domain constrained systems
• EQUALITY BASED CONTRACTION OF SEMIDEFINITE PROGRAMMING RELAXATIONS IN POLYNOMIAL OPTIMIZATION
• Convergent semidefinite programming relaxations for global bilevel polynomial optimization problems
• Error bounds for some semidefinite programming approaches to polynomial minimization on the hypercube
• On the synthesis of linear \(H_\infty\) filters for polynomial systems
• Positivity and Optimization: Beyond Polynomials
• Approximate volume and integration for basic semialgebraic sets
• A sequential subspace projection method for extreme Z-eigenvalues of supersymmetric tensors
• Semidefinite Approximations for Global Unconstrained Polynomial Optimization
• Certifying convergence of Lasserre's hierarchy via flat truncation
• An analogue of the Riesz-Haviland theorem for the truncated moment problem
• Design of Marx generators as a structured eigenvalue assignment
• Finding largest small polygons with gloptipoly
• GpoSolver: a Matlab/C++ toolbox for global polynomial optimization
• A sufficient condition of Euclidean rings given by polynomial optimization over a box
• An irreducible function basis of isotropic invariants of a third order three-dimensional symmetric tensor
• Inverse conic programming with applications
• A certificate for semidefinite relaxations in computing positive-dimensional real radical ideals
• Three dimensional strongly symmetric circulant tensors
• A nonlinear semidefinite optimization relaxation for the worst-case linear optimization under uncertainties
• Zero-convex functions, perturbation resilience, and subgradient projections for feasibility-seeking methods
• Modeling probability densities with sums of exponentials via polynomial approximation
• Exact certification in global polynomial optimization via sums-of-squares of rational functions with rational coefficients
• Globally optimal algorithms for stratified autocalibration
• Mean squared error minimization for inverse moment problems
• 2D system analysis via dual problems and polynomial matrix inequalities
• Lebesgue decomposition in action via semidefinite relaxations
• Semidefinite programming and sums of Hermitian squares of noncommutative polynomials
• Semidefinite representation of convex sets
• Control Applications of Sum of Squares Programming
• Generalized Lagrangian Duals and Sums of Squares Relaxations of Sparse Polynomial Optimization Problems
• Enforcing stability constraints in set-membership identification of linear dynamic systems
• Norm bounds and underestimators for unconstrained polynomial integer minimization
• Transposition Theorems and Qualification‐Free Optimality Conditions
• Constrained polynomial optimization problems with noncommuting variables
• A prolongation-projection algorithm for computing the finite real variety of an ideal
• Atomic optimization. II. Multidimensional problems and polynomial matrix inequalities
• Borel measures with a density on a compact semi-algebraic set
• A semidefinite algorithm for completely positive tensor decomposition
• Convergence analysis for Lasserre's measure-based hierarchy of upper bounds for polynomial optimization
• A generalization of Löwner-John's ellipsoid theorem
• Robust global optimization with polynomials
• Convex inner approximations of nonconvex semialgebraic sets applied to fixed-order controller design
• Global optimization of robust chance constrained problems
• Global optimality conditions and optimization methods for polynomial programming problems
• Inhomogeneous polynomial optimization over a convex set: An approximation approach
• Approximate gcds of polynomials and sparse SOS relaxations
• Computational complexity of the quantum separability problem
• Monomial-wise optimal separable underestimators for mixed-integer polynomial optimization
• Global optimization of polynomials restricted to a smooth variety using sums of squares
• The maximum tensor complementarity eigenvalues
• T-optimal designs for multi-factor polynomial regression models via a semidefinite relaxation method
• Limits of positive flat bivariate moment matrices
• Higher-degree tensor eigenvalue complementarity problems
• Distributionally robust optimization with moment ambiguity sets
• Distributionally robust polynomial chance-constraints under mixture ambiguity sets
• Exact determinations of the maximal output admissible set for a class of nonlinear systems
• Computing Gaussian \& exponential measures of semi-algebraic sets
• Convergence of Lasserre's hierarchy: the general case
• Globally maximizing the sum of squares of quadratic forms over the unit sphere
• Minimizer Extraction in Polynomial Optimization Is Robust
• Local saddle points for unconstrained polynomial optimization
• Minimizing trigonometric matrix polynomials over semi-algebraic sets
• Bracketing backward reach sets of a dynamical system
• Saddle points of rational functions
• Chordal-TSSOS: A Moment-SOS Hierarchy That Exploits Term Sparsity with Chordal Extension
• TSSOS: A Moment-SOS Hierarchy That Exploits Term Sparsity
• Convex computation of extremal invariant measures of nonlinear dynamical systems and Markov processes
• Multi-objective convex polynomial optimization and semidefinite programming relaxations
• User association to optimize flow level performance in wireless systems with dynamic interference
• A globally convergent method for solving a quartic generalized Markowitz portfolio problem
• Perturbation analysis of singular semidefinite programs and its applications to control problems
• Tensor \(Z\)-eigenvalue complementarity problems
• The Gauss-Seidel method for generalized Nash equilibrium problems of polynomials
• Lower bounds for cubic optimization over the sphere
• Geometric and Numerical Optimal Control
• Positivity certificates and polynomial optimization on non-compact semialgebraic sets
• Integrated design of control allocation and triple-step control for over-actuated electric ground vehicles with actuator faults

This page was built for software: GloptiPoly