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.
- On semi-infinite systems of convex polynomial inequalities and polynomial optimization problems (Q2307704) (← links)
- SDP relaxation algorithms for \(\mathbf{P(P}_0)\)-tensor detection (Q2307706) (← links)
- Iterative methods for computing U-eigenvalues of non-symmetric complex tensors with application in quantum entanglement (Q2307708) (← links)
- Higher-degree tensor eigenvalue complementarity problems (Q2307709) (← links)
- Saddle points of rational functions (Q2307710) (← links)
- Set-completely-positive representations and cuts for the max-cut polytope and the unit modulus lifting (Q2307758) (← links)
- Modeling and estimation of thermal flows based on transport and balance equations (Q2308071) (← links)
- Unfoldings and the rank-one approximation of the tensor (Q2309259) (← links)
- Test of copositive tensors (Q2313772) (← links)
- A semidefinite relaxation algorithm for checking completely positive separable matrices (Q2313773) (← links)
- An overview of semidefinite relaxations for optimal power flow problem (Q2320274) (← links)
- Lower bounds on matrix factorization ranks via noncommutative polynomial optimization (Q2329041) (← links)
- T-optimal designs for multi-factor polynomial regression models via a semidefinite relaxation method (Q2329795) (← links)
- Tight relaxations for polynomial optimization and Lagrange multiplier expressions (Q2330641) (← links)
- Sherali-Adams relaxations of graph isomorphism polytopes (Q2339812) (← links)
- Set membership identification of switched linear systems with known number of subsystems (Q2342531) (← links)
- Minimizing trigonometric matrix polynomials over semi-algebraic sets (Q2342782) (← links)
- The 2013 Newton Institute Programme on polynomial optimization (Q2349128) (← links)
- Completely positive reformulations for polynomial optimization (Q2349130) (← links)
- An alternative proof of a PTAS for fixed-degree polynomial optimization over the simplex (Q2349131) (← links)
- Certification of real inequalities: templates and sums of squares (Q2349133) (← links)
- The hierarchy of local minimums in polynomial optimization (Q2349136) (← links)
- Cutting planes for RLT relaxations of mixed 0-1 polynomial programs (Q2349139) (← links)
- Exploiting symmetry in copositive programs via semidefinite hierarchies (Q2349140) (← links)
- Rank-constrained fundamental matrix estimation by polynomial global optimization versus the eight-point algorithm (Q2354819) (← links)
- Error bounds for polynomial optimization over the hypercube using Putinar type representations (Q2355314) (← links)
- Univariate parameterization for global optimization of mixed-integer polynomial problems (Q2355892) (← links)
- Quantum de Finetti theorems under local measurements with applications (Q2358805) (← links)
- Approximate gcds of polynomials and sparse SOS relaxations (Q2378493) (← links)
- Computing sum of squares decompositions with rational coefficients (Q2378506) (← links)
- A robust algorithm for quadratic optimization under quadratic constraints (Q2385494) (← links)
- Certificates for nonnegativity of polynomials with zeros on compact semialgebraic sets (Q2388440) (← links)
- A recursive algorithm of exactness verification of relaxations for robust SDPs (Q2390543) (← links)
- Convex sets with semidefinite representation (Q2391000) (← links)
- An alternative Kalman-Yakubovich-Popov lemma and some extensions (Q2391340) (← links)
- When only global optimization matters (Q2392106) (← links)
- Generalized S-lemma and strong duality in nonconvex quadratic programming (Q2392110) (← links)
- Correlative sparsity structures and semidefinite relaxations for concave cost transportation problems with change of variables (Q2392116) (← links)
- High-dimensional change-point estimation: combining filtering with convex optimization (Q2397167) (← links)
- A bounded degree SOS hierarchy for polynomial optimization (Q2397758) (← links)
- Dual form reduction in the atomic optimization method (Q2399760) (← links)
- A sums-of-squares extension of policy iterations (Q2406948) (← links)
- Solving rank-constrained semidefinite programs in exact arithmetic (Q2409017) (← links)
- Error bounds for monomial convexification in polynomial optimization (Q2414910) (← links)
- Sums of Hermitian squares decomposition of non-commutative polynomials in non-symmetric variables using NCSOStools (Q2418156) (← links)
- A new approximation hierarchy for polynomial conic optimization (Q2419540) (← links)
- Optimized choice of parameters in interior-point methods for linear programming (Q2419556) (← links)
- A toric positivstellensatz with applications to delay systems (Q2431137) (← links)
- Certifying convergence of Lasserre's hierarchy via flat truncation (Q2434992) (← links)
- Exact determinations of the maximal output admissible set for a class of nonlinear systems (Q2440630) (← links)
