scientific article; zbMATH DE number 527343
From MaRDI portal
Publication:4285035
Recommendations
Cited in
(only showing first 100 items - show all)- A note on sparse SOS and SDP relaxations for polynomial optimization problems over symmetric cones
- Semidefinite programming, multivariate orthogonal polynomials, and codes in spherical caps
- A Striktpositivstellensatz for measurable functions
- Scale transform of discrete stationary signals
- Numerical approaches for collaborative data processing
- An algorithm for the global optimization of a class of continuous minimax problems
- Solving polynomial optimization problems via the truncated tangency variety and sums of squares
- Polynomial representations via spectral decompositions
- A Kadison-Dubois representation for associative rings.
- Mathematical programming methods for microgrid design and operations: a survey on deterministic and stochastic approaches
- Completely positive tensor recovery with minimal nuclear value
- Sparse-BSOS: a bounded degree SOS hierarchy for large scale polynomial optimization with sparsity
- Tensor eigenvalue complementarity problems
- Stabilization of linear impulsive systems under dwell-time constraints: interval observer-based framework
- Observer synthesis under time-varying sampling for Lipschitz nonlinear systems
- Positive polynomials on Riesz spaces
- Positive polynomials on nondegenerate basic semi-algebraic sets
- Sum-of-squares for bounded rationality
- Convergence rates of moment-sum-of-squares hierarchies for volume approximation of semialgebraic sets
- The singular bivariate quartic tracial moment problem
- Tensor maximal correlation problems
- Generalized Lagrangian duality for nonconvex polynomial programs with polynomial multipliers
- Sparsity in sums of squares of polynomials
- How to generate weakly infeasible semidefinite programs via Lasserre's relaxations for polynomial optimization
- A semidefinite approach for truncated \(K\)-moment problems
- Polynomials non-negative on strips and half-strips
- The moment problem for continuous positive semidefinite linear functionals
- A quantitative version of Catlin-D'Angelo-Quillen theorem
- An exact Jacobian SDP relaxation for polynomial optimization
- Polynomials of almost normal arguments in \(C^*\)-algebras
- The matricial relaxation of a linear matrix inequality
- Enclosing ellipsoids and elliptic cylinders of semialgebraic sets and their application to error bounds in polynomial optimization
- Convex underestimators of polynomials
- Positive hybrid real-trigonometric polynomials and applications to adjustable filter design and absolute stability analysis
- Idempotents and moment problem for discrete measure
- A note on nondegenerate matrix polynomials
- On sum of squares certificates of non-negativity on a strip
- The tracial moment problem on quadratic varieties
- On the exactness of Lasserre relaxations and pure states over real closed fields
- Solving the equality-constrained minimization problem of polynomial functions
- Convex computation of extremal invariant measures of nonlinear dynamical systems and Markov processes
- A survey on conic relaxations of optimal power flow problem
- The Gauss-Seidel method for generalized Nash equilibrium problems of polynomials
- On exact Reznick, Hilbert-Artin and Putinar's representations
- The truncated Hamburger moment problems with gaps in the index set
- Multi-objective convex polynomial optimization and semidefinite programming relaxations
- Near-optimal analysis of Lasserre's univariate measure-based bounds for multivariate polynomial optimization
- Analysis of optimization algorithms via sum-of-squares
- The moment-SOS hierarchy and the Christoffel-Darboux kernel
- Positivstellensätze for polynomial matrices
- Hybrid \(L_\infty \times \ell_\infty \)-performance analysis and control of linear time-varying impulsive and switched positive systems
- Optimization over trace polynomials
- A sublevel moment-SOS hierarchy for polynomial optimization
- Decomposed structured subsets for semidefinite and sum-of-squares optimization
- Dimension-free entanglement detection in multipartite Werner states
- Distributionally robust optimization with moment ambiguity sets
- Convergence of Lasserre's hierarchy: the general case
- Continuous-variable nonlocality and contextuality
- On Hahn-Banach theorem and some of its applications
- Moment-sequence transforms
- Optimization over the Boolean hypercube via sums of nonnegative circuit polynomials
- Bounding the separable rank via polynomial optimization
- Sparse noncommutative polynomial optimization
- On the complexity of Putinar-Vasilescu's Positivstellensatz
- Positivity certificates and polynomial optimization on non-compact semialgebraic sets
- Linearisation techniques and the dual algorithm for a class of mixed singular/continuous control problems in reinsurance. I: Theoretical aspects
- SIR epidemics with state-dependent costs and ICU constraints: a Hamilton-Jacobi verification argument and dual LP algorithms
- A few more extensions of Putinar's Positivstellensatz to non-compact sets
- Certifying the global optimality of quartic minimization over the sphere
- On the exactness of sum-of-squares approximations for the cone of \(5 \times 5\) copositive matrices
- Stabilization of rank-deficient continuous-time switched affine systems
- The saddle point problem of polynomials
- Graph recovery from incomplete moment information
- Time minimal saturation of a pair of spins and application in magnetic resonance imaging
- A moment approach for entropy solutions to nonlinear hyperbolic PDEs
- Robust and optimal registration of image sets and structured scenes via sum-of-squares polynomials
- Hermitian completely positive matrices
- Completely positive tensors in the complex field
- On the complexity of testing attainment of the optimal value in nonlinear optimization
- A version of Putinar's Positivstellensatz for cylinders
- Distributionally robust polynomial chance-constraints under mixture ambiguity sets
- On solving a class of fractional semi-infinite polynomial programming problems
- Exploiting term sparsity in noncommutative polynomial optimization
- The full infinite dimensional moment problem on semi-algebraic sets of generalized functions
- A hierarchy of semidefinite relaxations for completely positive tensor optimization problems
- Polynomial optimization on some unbounded closed semi-algebraic sets
- Alternative SDP and SOCP approximations for polynomial optimization
- An augmented Lagrangian algorithm for nonlinear semidefinite programming applied to the covering problem
- \(L_1 \times \ell_1\)-to-\(L_1 \times \ell_1\) analysis of linear positive impulsive systems with application to the \(L_1 \times \ell_1\)-to-\(L_1 \times \ell_1\) interval observation of linear impulsive and switched systems
- On semi-infinite systems of convex polynomial inequalities and polynomial optimization problems
- Higher-degree tensor eigenvalue complementarity problems
- Saddle points of rational functions
- A semidefinite relaxation algorithm for checking completely positive separable matrices
- Co-design of aperiodic sampled-data min-jumping rules for linear impulsive, switched impulsive and sampled-data systems
- Lower bounds on matrix factorization ranks via noncommutative polynomial optimization
- Tight relaxations for polynomial optimization and Lagrange multiplier expressions
- Minimizing trigonometric matrix polynomials over semi-algebraic sets
- On an extension of Pólya's Positivstellensatz
- Convex conditions for robust stabilization of uncertain switched systems with guaranteed minimum and mode-dependent dwell-time
- Certification of real inequalities: templates and sums of squares
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)
