Pages that link to "Item:Q3396396"
From MaRDI portal
The following pages link to GloptiPoly 3: moments, optimization and semidefinite programming (Q3396396):
Displaying 50 items.
- A robust unscented transformation for uncertain moments (Q1738657) (← links)
- Handelman's Positivstellensatz for polynomial matrices positive definite on polyhedra (Q1752981) (← links)
- Real eigenvalues of nonsymmetric tensors (Q1753066) (← links)
- Tensor maximal correlation problems (Q1753137) (← links)
- Approximating Pareto curves using semidefinite relaxations (Q1785276) (← links)
- A MAX-CUT formulation of 0/1 programs (Q1785732) (← links)
- Plane-based resection for metric affine cameras (Q1799582) (← links)
- A ``joint + marginal'' heuristic for 0/1 programs (Q1928265) (← links)
- A semidefinite approach for truncated \(K\)-moment problems (Q1928277) (← links)
- An algorithm for semi-infinite polynomial optimization (Q1935882) (← links)
- An exact Jacobian SDP relaxation for polynomial optimization (Q1942264) (← links)
- The tracial moment problem and trace-optimization of polynomials (Q1942272) (← links)
- Convex underestimators of polynomials (Q1955542) (← links)
- Gradient formulae for nonlinear probabilistic constraints with non-convex quadratic forms (Q1985288) (← links)
- An approach to constrained polynomial optimization via nonnegative circuit polynomials and geometric programming (Q1994127) (← links)
- Conic programming: infeasibility certificates and projective geometry (Q1996078) (← links)
- A new bounded degree hierarchy with SOCP relaxations for global polynomial optimization and conic convex semi-algebraic programs (Q2010098) (← links)
- Computing geometric measure of entanglement for symmetric pure states via the Jacobian SDP relaxation technique (Q2014679) (← links)
- A semidefinite relaxation method for second-order cone tensor eigenvalue complementarity problems (Q2022328) (← links)
- Convex computation of extremal invariant measures of nonlinear dynamical systems and Markov processes (Q2022606) (← links)
- The Gauss-Seidel method for generalized Nash equilibrium problems of polynomials (Q2028496) (← links)
- Tensor \(Z\)-eigenvalue complementarity problems (Q2028497) (← links)
- Lower bounds for cubic optimization over the sphere (Q2031942) (← links)
- Multi-objective convex polynomial optimization and semidefinite programming relaxations (Q2038921) (← links)
- Distributionally robust optimization with moment ambiguity sets (Q2111170) (← links)
- An SDP relaxation method for Perron pairs of a nonnegative tensor (Q2113709) (← links)
- Convergence of Lasserre's hierarchy: the general case (Q2119755) (← links)
- Local saddle points for unconstrained polynomial optimization (Q2125068) (← links)
- A globally convergent method for solving a quartic generalized Markowitz portfolio problem (Q2143112) (← links)
- Sparse noncommutative polynomial optimization (Q2144551) (← links)
- Linearisation techniques and the dual algorithm for a class of mixed singular/continuous control problems in reinsurance. I: Theoretical aspects (Q2152720) (← links)
- The saddle point problem of polynomials (Q2162120) (← links)
- A tighter relaxation for the relative pose problem between cameras (Q2163347) (← links)
- Graph recovery from incomplete moment information (Q2165577) (← links)
- Time minimal saturation of a pair of spins and application in magnetic resonance imaging (Q2175612) (← links)
- A moment approach for entropy solutions to nonlinear hyperbolic PDEs (Q2175615) (← links)
- One-shot set-membership identification of generalized Hammerstein-Wiener systems (Q2188270) (← links)
- Hermitian completely positive matrices (Q2197205) (← links)
- Completely positive tensors in the complex field (Q2197844) (← links)
- Distributionally robust polynomial chance-constraints under mixture ambiguity sets (Q2220666) (← links)
- Globally maximizing the sum of squares of quadratic forms over the unit sphere (Q2228375) (← 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)
- Sieve-SDP: a simple facial reduction algorithm to preprocess semidefinite programs (Q2293657) (← links)
- A new updating method for the damped mass-spring systems (Q2306758) (← links)
- A semidefinite relaxation method for second-order cone polynomial complementarity problems (Q2307702) (← links)
- SDP relaxation algorithms for \(\mathbf{P(P}_0)\)-tensor detection (Q2307706) (← 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)
