Cited in
(only showing first 100 items - show all)- Saddle points of rational functions
- A Cutting Surface Algorithm for Semi-Infinite Convex Programming with an Application to Moment Robust Optimization
- Binary quadratic optimization problems that are difficult to solve by conic relaxations
- Handelman's Positivstellensatz for polynomial matrices positive definite on polyhedra
- Real eigenvalues of nonsymmetric tensors
- Tensor maximal correlation problems
- Inhomogeneous polynomial optimization over a convex set: an approximation approach
- On new classes of nonnegative symmetric tensors
- Convex underestimators of polynomials
- Stability analysis of uncertain genetic sum regulatory networks
- A semidefinite relaxation algorithm for checking completely positive separable matrices
- Approximation algorithms for nonnegative polynomial optimization problems over unit spheres
- Nonlinear state feedback control for a class of polynomial nonlinear discrete-time systems with norm-bounded uncertainties: an integrator approach
- Semidefinite programming for chance constrained optimization over semialgebraic sets
- A branch-and-cut algorithm using polar cuts for solving nonconvex quadratic programming problems
- Test of copositive tensors
- Gradient formulae for nonlinear probabilistic constraints with non-convex quadratic forms
- Deciding robust feasibility and infeasibility using a set containment approach: an application to stationary passive gas network operations
- Constrained trace-optimization of polynomials in freely noncommuting variables
- Lasserre hierarchy for large scale polynomial optimization in real and complex variables
- Rank-constrained fundamental matrix estimation by polynomial global optimization versus the eight-point algorithm
- A robust unscented transformation for uncertain moments
- Partitioning procedure for polynomial optimization
- Radii minimal projections of polytopes and constrained optimization of symmetric polynomials
- On the complexity of computing the handicap of a sufficient matrix
- 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
- Computing generalized Nash equilibria by polynomial programming
- TSSOS: A Moment-SOS Hierarchy That Exploits Term Sparsity
- Multi-objective convex polynomial optimization and semidefinite programming relaxations
- An algorithm for the global optimization of a class of continuous minimax problems
- Semidefinite characterization and computation of zero-dimensional real radical ideals
- Linear control of time-domain constrained systems
- A generalized flat extension theorem for moment matrices
- Gposolver: a Matlab/C++ toolbox for global polynomial optimization
- Global optimization with spline constraints: a new branch-and-bound method based on B-splines
- Computing the distance between the linear matrix pencil and the completely positive cone
- The \(Z\)-eigenvalues of a symmetric tensor and its application to spectral hypergraph theory.
- User association to optimize flow level performance in wireless systems with dynamic interference
- Semidefinite relaxations of dynamical programs under discrete constraints
- Sums of squares, moment matrices and optimization over polynomials
- PRICING A CLASS OF EXOTIC OPTIONS VIA MOMENTS AND SDP RELAXATIONS
- Completely positive tensor recovery with minimal nuclear value
- EQUALITY BASED CONTRACTION OF SEMIDEFINITE PROGRAMMING RELAXATIONS IN POLYNOMIAL OPTIMIZATION
- Sum of squares method for sensor network localization
- Polyhedral and semidefinite programming methods in combinatorial optimization
- Representations of positive polynomials on noncompact semialgebraic sets via KKT ideals
- Convergent semidefinite programming relaxations for global bilevel polynomial optimization problems
- Solving global optimization problems over polynomials with GloptiPoly 2.1
- Moments, positive polynomials and their applications
- A globally convergent method for solving a quartic generalized Markowitz portfolio problem
- Stability and bifurcations in a model of bacteria immunity with quorum sensing
- 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
- On the synthesis of linear H_ filters for polynomial systems
- Error bounds for some semidefinite programming approaches to polynomial minimization on the hypercube
- The \(\mathcal A\)-truncated \(K\)-moment problem
- On the implementation and usage of SDPT3 -- a Matlab software package for semidefinite-quadratic-linear programming, version 4.0
- Safety verification of piecewise-deterministic Markov processes
- Geometric and numerical methods in the contrast imaging problem in nuclear magnetic resonance
- Two variants of the PMHSS iteration method for a class of complex symmetric indefinite linear systems
- Algebraic Perspectives on Signomial Optimization
- On calculation of norms of 2D-systems
- On turnpike and dissipativity properties of continuous-time optimal control problems
- Certifying unstability of switched systems using sum of squares programming
- Positive trigonometric polynomials and signal processing applications
- Sum-of-squares optimization without semidefinite programming
- Positivity certificates and polynomial optimization on non-compact semialgebraic sets
- Semi-definite relaxations for optimal control problems with oscillation and concentration effects
- A new updating method for the damped mass-spring systems
- Maximum block improvement and polynomial optimization
- A Semidefinite Relaxation Method for Partially Symmetric Tensor Decomposition
- Algorithms for unconstrained global optimization of nonlinear (polynomial) programming problems: the single and multi-segment polynomial B-spline approach
- Reflection groups, reflection arrangements, and invariant real varieties
- Coarse-convex-compactification approach to numerical solution of nonconvex variational problems
- Approximate volume and integration for basic semialgebraic sets
- Linear optimization with cones of moments and nonnegative polynomials
- A semidefinite programming approach for solving multiobjective linear programming
- Minimizing rational functions by exact Jacobian SDP relaxation applicable to finite singularities
- RAGlib
- Sostools
- SYNRAC
- LFTB
- GLOPTLAB
- SDPA
- jReality
- SeDuMi
- SDPT3
- VSDP
- GDToolkit
- DSDP5
- PENNON
- Padua2D
- RealPaver
- SimpleS
- veDYNA
- CVX
- azove
This page was built for software: GloptiPoly
