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
• On the synthesis of linear \(H_\infty\) filters for polynomial systems
• Positivity and Optimization: Beyond Polynomials
• 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
• Title not available (Why is that?)
• Inverse conic programming with applications
• Error Bounds for Some Semidefinite Programming Approaches to Polynomial Minimization on the Hypercube
• 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
• Approximate Volume and Integration for Basic Semialgebraic Sets
• 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
• Monomial-wise optimal separable underestimators for mixed-integer polynomial optimization
• Global optimization of polynomials restricted to a smooth variety using sums of squares
• Signomial and polynomial optimization via relative entropy and partial dualization
• Semidefinite programming in combinatorial and polynomial optimization
• Probabilistic Algorithm for Polynomial Optimization over a Real Algebraic Set
• Min-max and robust polynomial optimization
• Approximations of Countably Infinite Linear Programs over Bounded Measure Spaces
• Exact relaxations of non-convex variational problems
• A discussion of probability functions and constraints from a variational perspective
• Global Optimization and Constraint Satisfaction
• A polynomial optimization approach to constant rebalanced portfolio selection
• Simulation of discrete linear time-invariant fuzzy dynamic systems
• Algorithm 875
• Robust synchronization analysis in nonlinear stochastic cellular networks with time-varying delays, intracellular perturbations and intercellular noise
• Title not available (Why is that?)
• An obstacle avoidance model predictive control scheme for mobile robots subject to nonholonomic constraints: a sum-of-squares approach
• Analog circuit design by nonconvex polynomial optimization: Two design examples
• (Sub-)differentiability of probability functions with elliptical distributions
• On semidefinite bounds for maximization of a non-convex quadratic objective over thel₁unit ball
• On the estimation of robustness and filtering ability of dynamic biochemical networks under process delays, internal parametric perturbations and external disturbances
• Improved parameter bounds for set-membership EIV problems
• A semidefinite relaxation algorithm for checking completely positive separable matrices
• Computation with Polynomial Equations and Inequalities Arising in Combinatorial Optimization
• Approximation algorithms for nonnegative polynomial optimization problems over unit spheres
• Gradient formulae for nonlinear probabilistic constraints with non-convex quadratic forms
• Computing generalized Nash equilibria by polynomial programming
• Semidefinite relaxations of dynamical programs under discrete constraints
• Geometric and numerical methods in the contrast imaging problem in nuclear magnetic resonance
• On turnpike and dissipativity properties of continuous-time optimal control problems
• Symmetric Tensor Nuclear Norms

This page was built for software: GloptiPoly