Pages that link to "Item:Q2706355"
From MaRDI portal
The following pages link to Global optimization with polynomials and the problem of moments (Q2706355):
Displaying 50 items.
- The Approach of Moments for Polynomial Equations (Q2802518) (← links)
- Convex Hulls of Algebraic Sets (Q2802521) (← links)
- A “Joint+Marginal” Approach in Optimization (Q2802528) (← links)
- Convexity and Semidefinite Programming in Dimension-Free Matrix Unknowns (Q2802531) (← links)
- Positivity and Optimization: Beyond Polynomials (Q2802532) (← links)
- Exploiting Sparsity in SDP Relaxation of Polynomial Optimization Problems (Q2802536) (← links)
- SDP Relaxations for Non-Commutative Polynomial Optimization (Q2802540) (← links)
- Latest Developments in the SDPA Family for Solving Large-Scale SDPs (Q2802543) (← links)
- Sum of squares certificates for containment of \(\mathcal{H}\)-polytopes in \(\mathcal{V}\)-polytopes (Q2804545) (← links)
- Relative entropy relaxations for signomial optimization (Q2805708) (← links)
- Positive maps and separable matrices (Q2810548) (← links)
- Perturbed sums-of-squares theorem for polynomial optimization and its applications (Q2811486) (← links)
- GpoSolver: a Matlab/C++ toolbox for global polynomial optimization (Q2815514) (← links)
- Border Basis for Polynomial System Solving and Optimization (Q2819219) (← links)
- Algorithm 950: Ncpol2sdpa -- sparse semidefinite programming relaxations for polynomial optimization problems of noncommuting variables (Q2828144) (← links)
- Generation of signals with specified second-order properties for constrained systems (Q2830857) (← links)
- Exact algorithms for linear matrix inequalities (Q2834563) (← links)
- Completely positive tensors: properties, easily checkable subclasses, and tractable relaxations (Q2834695) (← links)
- Sum-of-Squares Rank Upper Bounds for Matching Problems (Q2835696) (← links)
- Equivalence of sum of squares convex relaxations for quadratic distance problems (Q2847256) (← links)
- On matrix algebras associated to sum-of-squares semidefinite programs (Q2872518) (← links)
- Nonnegative polynomials and sums of squares (Q2892812) (← links)
- Computation with Polynomial Equations and Inequalities Arising in Combinatorial Optimization (Q2897307) (← links)
- A difference algorithm to find global minimizers of a polynomial (Q2924616) (← links)
- A polynomial approach for optimal control of switched nonlinear systems (Q2925113) (← links)
- Can you compute the operator norm? (Q2930634) (← links)
- Finding the extreme Z-eigenvalues of tensors via a sequential semidefinite programming method (Q2936744) (← links)
- The <i>Z</i> -eigenvalues of a symmetric tensor and its application to spectral hypergraph theory (Q2936746) (← links)
- Global optimization of polynomials using generalized critical values and sums of squares (Q2946528) (← links)
- Strong SOCP Relaxations for the Optimal Power Flow Problem (Q2957450) (← links)
- On New Classes of Nonnegative Symmetric Tensors (Q2968174) (← links)
- Improved Convergence Rates for Lasserre-Type Hierarchies of Upper Bounds for Box-Constrained Polynomial Optimization (Q2968176) (← links)
- On the Hardest Problem Formulations for the 0/1 Lasserre Hierarchy (Q2976145) (← links)
- Sum of squares basis pursuit with linear and second order cone programming (Q2979646) (← links)
- Improved parameter bounds for set-membership EIV problems (Q3008831) (← links)
- An Iterative Scheme for Valid Polynomial Inequality Generation in Binary Polynomial Programming (Q3009764) (← links)
- Integrality Gaps of Linear and Semi-Definite Programming Relaxations for Knapsack (Q3009771) (← links)
- Robust static output feedback design for polynomial nonlinear systems (Q3057046) (← links)
- ORBITOPES (Q3087006) (← links)
- Testing the Dimension of Hilbert Spaces (Q3107674) (← links)
- Charges solve the truncated complex moment problem (Q3122073) (← links)
- Semidefinite and Linear Programming Integrality Gaps for Scheduling Identical Machines (Q3186499) (← links)
- Quantum Bilinear Optimization (Q3187180) (← links)
- A Survey of Semidefinite Programming Approaches to the Generalized Problem of Moments and Their Error Analysis (Q3296188) (← links)
- Sequential Convex Programming for the Efficient Verification of Parametric MDPs (Q3303926) (← links)
- The relation between polynomial calculus, Sherali-Adams, and sum-of-squares proofs (Q3304105) (← links)
- Preprocessing sparse semidefinite programs via matrix completion (Q3377970) (← links)
- Limitations of Algebraic Approaches to Graph Isomorphism Testing (Q3448781) (← links)
- Query Complexity in Expectation (Q3448835) (← links)
- On the Hardest Problem Formulations for the $$0/1$$ Lasserre Hierarchy (Q3448844) (← links)
