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.
- Generalized truncated moment problems with unbounded sets (Q6159298) (← links)
- Existence of the least element solution of the vertical block \(Z\)-tensor complementarity problem (Q6164965) (← links)
- An inexact projected gradient method with rounding and lifting by nonlinear programming for solving rank-one semidefinite relaxation of polynomial optimization (Q6165592) (← links)
- Conic linear optimization for computer-assisted proofs. Abstracts from the workshop held April 10--16, 2022 (Q6170529) (← links)
- A rigorous deterministic global optimization approach for the derivation of secondary information in digital maps (Q6173797) (← links)
- Exponential Convergence of Sum-of-Squares Hierarchies for Trigonometric Polynomials (Q6176427) (← links)
- Tighter bounds on transient moments of stochastic chemical systems (Q6182326) (← links)
- Invariants of SDP exactness in quadratic programming (Q6184179) (← links)
- The Spectrum of the Grigoriev–Laurent Pseudomoments (Q6187076) (← links)
- Shortest Paths in Graphs of Convex Sets (Q6188512) (← links)
- Subset Selection and the Cone of Factor-Width-<i>k</i> Matrices (Q6195312) (← links)
- How Do Exponential Size Solutions Arise in Semidefinite Programming? (Q6195320) (← links)
- Utility/privacy trade-off as regularized optimal transport (Q6201932) (← links)
- Harmonic Hierarchies for Polynomial Optimization (Q6202758) (← links)
- Degree Bounds for Putinar’s Positivstellensatz on the Hypercube (Q6202884) (← links)
- Certifying optimality of Bell inequality violations: noncommutative polynomial optimization through semidefinite programming and local optimization (Q6490315) (← links)
- A copositive framework for analysis of hybrid Ising-classical algorithms (Q6495776) (← links)
- A distributed algorithm for cooperative optimization with polynomial objective function (Q6536965) (← links)
- On difference-of-SOS and difference-of-convex-SOS decompositions for polynomials (Q6550977) (← links)
- A study of the double pendulum using polynomial optimization (Q6557701) (← links)
- Reducing nonnegativity over general semialgebraic sets to nonnegativity over simple sets (Q6561376) (← links)
- Semi-definite programming and quantum information (Q6561827) (← links)
- A tight compact quadratically constrained convex relaxation of the optimal power flow problem (Q6568415) (← links)
- Global minimization of polynomial integral functionals (Q6573176) (← links)
- Independent set in \(k\)-claw-free graphs: conditional \(\chi \)-boundedness and the power of LP/SDP relaxations (Q6574949) (← links)
- Computation of stable convex combinations of a set of matrices through LMIs with application in \(\mathcal{H}_\infty\) control of switched linear systems (Q6577541) (← links)
- Fast certifiable algorithm for the absolute pose estimation of a camera (Q6587650) (← links)
- Lower bounds of functions on finite abelian groups (Q6591628) (← links)
- Orbit spaces of Weyl groups acting on compact tori: a unified and explicit polynomial description (Q6594419) (← links)
- A strengthened SDP relaxation for quadratic optimization over the Stiefel manifold (Q6596339) (← links)
- The moment-SOS hierarchy: applications and related topics (Q6598421) (← links)
- Exploiting constant trace property in large-scale polynomial optimization (Q6599981) (← links)
- CS-TSSOS: correlative and term sparsity for large-scale polynomial optimization (Q6599983) (← links)
- Lasserre hierarchy for graph isomorphism and homomorphism indistinguishability (Q6601300) (← links)
- T-semidefinite programming relaxation with third-order tensors for constrained polynomial optimization (Q6606854) (← links)
- State polynomials: positivity, optimization and nonlinear Bell inequalities (Q6608047) (← links)
- Higher-order Newton methods with polynomial work per iteration (Q6608710) (← links)
- First-order reasoning and efficient semi-algebraic proofs (Q6614038) (← links)
- Strictly positive polynomials in the boundary of the SOS cone (Q6615407) (← links)
- On symmetry adapted bases in trigonometric optimization (Q6615410) (← links)
- Finite convergence of moment-SOS relaxations with nonreal radical ideals (Q6622756) (← links)
- Towards global solutions for nonconvex two-stage stochastic programs: a polynomial lower approximation approach (Q6622759) (← links)
- Multiscale semidefinite programming approach to positioning problems with pairwise structure (Q6629219) (← links)
- Nonconvex homogeneous optimization: a general framework and optimality conditions of first and second-order (Q6632125) (← links)
- Optimal switching of vaccination for an infectious disease model (Q6638606) (← links)
- On Łojasiewicz inequalities and the effective Putinar's Positivstellensatz (Q6639815) (← links)
- The multivariate eigenvalues of symmetric tensors (Q6641760) (← links)
- Robust approximation of chance constrained optimization with polynomial perturbation (Q6642796) (← links)
- Generalized semi-infinite polynomial optimization and semidefinite programming relaxations (Q6650707) (← links)
- Optimization-aided construction of multivariate Chebyshev polynomials (Q6651978) (← links)
