scientific article; zbMATH DE number 527343
From MaRDI portal
Publication:4285035
Recommendations
Cited in
(only showing first 100 items - show all)- Convex sets with semidefinite representation
- Generating exact nonlinear ranking functions by symbolic-numeric hybrid method
- Optimization over the Boolean hypercube via sums of nonnegative circuit polynomials
- A semidefinite method for tensor complementarity problems
- Connes' embedding conjecture and sums of Hermitian squares
- A unified framework of SAGE and SONC polynomials and its duality theory
- Sums of squares based approximation algorithms for MAX-SAT
- LMI relaxations in robust control
- Stability analysis and control of a class of LPV systems with piecewise constant parameters
- Distributionally robust optimization with polynomial robust constraints
- Noncommutative polynomials nonnegative on a variety intersect a convex set
- Dimension-free entanglement detection in multipartite Werner states
- POS3POLY -- a MATLAB preprocessor for optimization with positive polynomials
- Constructive proofs of some positivstellensätze for compact semialgebraic subsets of \(\mathbb R^{d }\)
- Algebra of polynomials bounded on a semi-algebraic set \([ f\leq r ]\)
- A new proof for the existence of degree bounds for Putinar's positivstellensatz
- The saddle point problem of polynomials
- Co-design of aperiodic sampled-data min-jumping rules for linear impulsive, switched impulsive and sampled-data systems
- Formal Proofs for Nonlinear Optimization
- Polynomial optimization with applications to stability analysis and control -- alternatives to sum of squares
- Controller design and value function approximation for nonlinear dynamical systems
- Robust stability and performance analysis of 2D mixed continuous-discrete-time systems with uncertainty
- A dynamic inequality generation scheme for polynomial programming
- Approximating amoebas and coamoebas by sums of squares
- Semidefinite Relaxation Methods for Tensor Absolute Value Equations
- Minimizing the sum of many rational functions
- Handelman rank of zero-diagonal quadratic programs over a hypercube and its applications
- Separability of Hermitian tensors and PSD decompositions
- A generalized Pell's equation for a class of multivariate orthogonal polynomials
- A note on nondegenerate matrix polynomials
- On solving a class of fractional semi-infinite polynomial programming problems
- A Correlatively Sparse Lagrange Multiplier Expression Relaxation for Polynomial Optimization
- Exploiting sparsity in SDP relaxation of polynomial optimization problems
- Stochastic polynomial optimization
- Polynomials Positive on Unbounded Rectangles
- Linear conic optimization for inverse optimal control
- Dual certificates and efficient rational sum-of-squares decompositions for polynomial optimization over compact sets
- Reducing nonnegativity over general semialgebraic sets to nonnegativity over simple sets
- Higher-degree tensor eigenvalue complementarity problems
- Closures of quadratic modules
- A sums-of-squares extension of policy iterations
- Rank of Handelman hierarchy for Max-Cut
- The K-moment problem with densities
- Representation of positive polynomials on a generalized strip and its application to polynomial optimization
- Three-point bounds for energy minimization
- Convex conditions for robust stabilization of uncertain switched systems with guaranteed minimum and mode-dependent dwell-time
- Semialgebraic proofs, IPS lower bounds, and the -conjecture: can a natural number be negative?
- The truncated K-moment problem for closure of open sets
- Dehomogenization for completely positive tensors
- Distributionally robust optimization with moment ambiguity sets
- Sparsity in sums of squares of polynomials
- Bounding extrema over global attractors using polynomial optimisation
- Size-degree trade-offs for sums-of-squares and positivstellensatz proofs
- Some applications of polynomial optimization in operations research and real-time decision making
- Extensions of \(\mathrm{S}\)-lemma for noncommutative polynomial
- On sum of squares certificates of non-negativity on a strip
- The tracial moment problem on quadratic varieties
- Necessary global optimality conditions for nonlinear programming problems with polynomial constraints
- Distributionally robust polynomial chance-constraints under mixture ambiguity sets
- A semidefinite relaxation method for linear and nonlinear complementarity problems with polynomials
- Characteristic polynomial assignment for plants with semialgebraic uncertainty: A robust diophantine equation approach
- On Hahn-Banach theorem and some of its applications
- The truncated complex K-moment problem
- Polynomial optimization, certificates of positivity, and Christoffel function
- Global minimization of polynomial integral functionals
- On global optimizations with polynomials
- Convergence of Lasserre's hierarchy: the general case
- Certificates of convexity for basic semi-algebraic sets
- An iterative scheme for valid polynomial inequality generation in binary polynomial programming
- Invariant structure preserving functions and an Oka-Weil Kaplansky density type theorem
- Semidefinite Relaxations for Lebesgue and Gaussian Measures of Unions of Basic Semialgebraic Sets
- Stability analysis of sampled-data control systems with input saturation: a hybrid system approach
- Aspects of non-commutative function theory
- Sum-of-squares for bounded rationality
- Semidefinite representations for finite varieties
- On semi-infinite systems of convex polynomial inequalities and polynomial optimization problems
- Discrete-time multi-scale systems
- Positivity and optimization: beyond polynomials
- Moment vanishing problem and positivity: some examples
- On the exactness of Lasserre relaxations for compact convex basic closed semialgebraic sets
- Discriminants and nonnegative polynomials
- Positivstellensätze for noncommutative rational expressions
- Relative entropy relaxations for signomial optimization
- Tensor eigenvalue complementarity problems
- On the construction of converging hierarchies for polynomial optimization based on certificates of global positivity
- Minimizer Extraction in Polynomial Optimization Is Robust
- On the exactness of Lasserre relaxations and pure states over real closed fields
- Rational Generalized Nash Equilibrium Problems
- How to generate weakly infeasible semidefinite programs via Lasserre's relaxations for polynomial optimization
- Polynomial LPV approach to robust H_ control of nonlinear sampled-data systems
- A semidefinite programming approach to the generalized problem of moments
- Sparse polynomial optimization with unbounded sets
- Algebraic properties of Hermitian sums of squares
- Robust stabilisation of polynomial systems with uncertain parameters
- Minimizing trigonometric matrix polynomials over semi-algebraic sets
- Chebyshev and equilibrium measure vs Bernstein and Lebesgue measure
- The inverse function theorem and the Jacobian conjecture for free analysis
- Semidefinite Programming and Nash Equilibria in Bimatrix Games
- A utopia point method-based robust vector polynomial optimization scheme
- Positive polynomials and sequential closures of quadratic modules
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4285035)
