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 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
• 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
• A hierarchy of semidefinite relaxations for completely positive tensor optimization problems
• Using symbolic calculations to determine largest small polygons
• A geometric branch and bound method for robust maximization of convex functions
• Detecting optimality and extracting solutions in polynomial optimization with the truncated GNS construction
• A tighter relaxation for the relative pose problem between cameras
• Time minimal saturation of a pair of spins and application in magnetic resonance imaging
• The CP-matrix approximation problem
• Sparse Polynomial Optimization
• A sublevel moment-SOS hierarchy for polynomial optimization
• A semidefinite relaxation method for second-order cone polynomial complementarity problems
• Largest small polygons: a sequential convex optimization approach
• Sparse noncommutative polynomial optimization
• User Association to Optimize Flow Level Performance in Wireless Systems with Dynamic Interference
• A Survey of Semidefinite Programming Approaches to the Generalized Problem of Moments and Their Error Analysis
• Bounding Stationary Averages of Polynomial Diffusions via Semidefinite Programming
• One-shot set-membership identification of generalized Hammerstein-Wiener systems
• Unconstrained minimization of block-circulant polynomials via semidefinite program in third-order tensor space
• Completely positive tensors in the complex field
• Exploiting sparsity for semi-algebraic set volume computation
• SDP relaxation algorithms for \(\mathbf{P(P}_0)\)-tensor detection
• Immediate schedule adjustment and semidefinite relaxation
• Sum-of-Squares Optimization without Semidefinite Programming
• A semidefinite method for tensor complementarity problems
• A paradox in bosonic energy computations via semidefinite programming relaxations
• 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
• Bilevel Polynomial Programs and Semidefinite Relaxation Methods
• A new updating method for the damped mass-spring systems
• A semidefinite programming approach for solving multiobjective linear programming
• Minimizing rational functions by exact Jacobian SDP relaxation applicable to finite singularities
• A moment approach for entropy solutions to nonlinear hyperbolic PDEs
• Monotonically positive matrices
• On New Classes of Nonnegative Symmetric Tensors
• Partially positive matrices
• The moment problem for continuous positive semidefinite linear functionals
• Nonconvex Optimization for Communication Networks
• Globally optimal estimates for geometric reconstruction problems
• Global optimality conditions for cubic minimization problems with cubic constraints
• Image Computation for Polynomial Dynamical Systems Using the Bernstein Expansion
• Semidefinite representation of convex hulls of rational varieties
• A bounded degree SOS hierarchy for polynomial optimization
• Positive maps and separable matrices
• Dual form reduction in the atomic optimization method
• The \(K\)-moment problem for continuous linear functionals
• Maximal Area of Equilateral Small Polygons
• An alternative approach for nonlinear optimal control problems based on the method of moments
• Semidefinite programming relaxations and algebraic optimization in control

This page was built for software: GloptiPoly