Pages that link to "Item:Q870344"
From MaRDI portal
The following pages link to On the complexity of Putinar's Positivstellensatz (Q870344):
Displaying 50 items.
- Some applications of polynomial optimization in operations research and real-time decision making (Q276318) (← links)
- Computing the distance between the linear matrix pencil and the completely positive cone (Q301674) (← links)
- Real algebraic geometry with a view toward systems control and free positivity. Abstracts from the workshop held April 6--12, 2014. (Q347197) (← links)
- Welfare-maximizing correlated equilibria using Kantorovich polynomials with sparsity (Q367164) (← links)
- An approximation bound analysis for Lasserre's relaxation in multivariate polynomial optimization (Q384182) (← links)
- Generating exact nonlinear ranking functions by symbolic-numeric hybrid method (Q394460) (← links)
- Convergence rates of moment-sum-of-squares hierarchies for optimal control problems (Q511733) (← links)
- Convergence analysis for Lasserre's measure-based hierarchy of upper bounds for polynomial optimization (Q517310) (← links)
- Partitioning procedure for polynomial optimization (Q604960) (← links)
- Exact certification in global polynomial optimization via sums-of-squares of rational functions with rational coefficients (Q654030) (← links)
- Norm bounds and underestimators for unconstrained polynomial integer minimization (Q684153) (← links)
- A semidefinite programming approach for solving multiobjective linear programming (Q742135) (← links)
- Linear optimization with cones of moments and nonnegative polynomials (Q745685) (← links)
- Semidefinite representation of convex sets (Q847843) (← links)
- Representations of positive polynomials on noncompact semialgebraic sets via KKT ideals (Q863907) (← links)
- On the complexity of Schmüdgen's Positivstellensatz (Q876820) (← links)
- Convergence rates of moment-sum-of-squares hierarchies for volume approximation of semialgebraic sets (Q1749771) (← links)
- A quantitative version of Catlin-D'Angelo-Quillen theorem (Q1941773) (← links)
- An exact Jacobian SDP relaxation for polynomial optimization (Q1942264) (← links)
- Polynomials of almost normal arguments in \(C^*\)-algebras (Q1943737) (← links)
- On the exactness of Lasserre relaxations and pure states over real closed fields (Q2007851) (← links)
- On exact Reznick, Hilbert-Artin and Putinar's representations (Q2029015) (← links)
- Near-optimal analysis of Lasserre's univariate measure-based bounds for multivariate polynomial optimization (Q2044964) (← links)
- Semi-algebraic approximation using Christoffel-Darboux kernel (Q2067503) (← links)
- The linearization problem of a binary quadratic problem and its applications (Q2070726) (← links)
- Convergence rates of RLT and Lasserre-type hierarchies for the generalized moment problem over the simplex and the sphere (Q2080815) (← links)
- On the complexity of Putinar-Vasilescu's Positivstellensatz (Q2145082) (← links)
- Positivity certificates and polynomial optimization on non-compact semialgebraic sets (Q2149557) (← links)
- A few more extensions of Putinar's Positivstellensatz to non-compact sets (Q2157802) (← links)
- Certifying the global optimality of quartic minimization over the sphere (Q2158108) (← links)
- A version of Putinar's Positivstellensatz for cylinders (Q2220198) (← links)
- On solving a class of fractional semi-infinite polynomial programming problems (Q2231044) (← links)
- A hierarchy of semidefinite relaxations for completely positive tensor optimization problems (Q2274887) (← links)
- On semi-infinite systems of convex polynomial inequalities and polynomial optimization problems (Q2307704) (← links)
- On an extension of Pólya's Positivstellensatz (Q2342945) (← links)
- Error bounds for polynomial optimization over the hypercube using Putinar type representations (Q2355314) (← links)
- Łojasiewicz inequalities with explicit exponents for smallest singular value functions (Q2360667) (← links)
- Convex sets with semidefinite representation (Q2391000) (← links)
- A toric positivstellensatz with applications to delay systems (Q2431137) (← links)
- Certifying convergence of Lasserre's hierarchy via flat truncation (Q2434992) (← links)
- Global minimization of rational functions and the nearest GCDs (Q2481368) (← links)
- An effective version of Schmüdgen's Positivstellensatz for the hypercube (Q2693779) (← links)
- The CP-matrix approximation problem (Q2790067) (← links)
- Matrix convex hulls of free semialgebraic sets (Q2790584) (← links)
- Exact algorithms for linear matrix inequalities (Q2834563) (← links)
- Nonnegative polynomials and sums of squares (Q2892812) (← links)
- On the Generation of Positivstellensatz Witnesses in Degenerate Cases (Q3088010) (← links)
- A Survey of Semidefinite Programming Approaches to the Generalized Problem of Moments and Their Error Analysis (Q3296188) (← links)
- Improved Approximation Guarantees through Higher Levels of SDP Hierarchies (Q3541786) (← links)
- Exact Certification in Global Polynomial Optimization Via Rationalizing Sums-Of-Squares (Q3576578) (← links)
