Pages that link to "Item:Q4681658"
From MaRDI portal
The following pages link to Detecting Global Optimality and Extracting Solutions in GloptiPoly (Q4681658):
Displayed 50 items.
- GloptiPoly (Q16522) (← links)
- Computing the distance between the linear matrix pencil and the completely positive cone (Q301674) (← links)
- Optimality conditions and finite convergence of Lasserre's hierarchy (Q403636) (← links)
- On the structure of generalized plant convexifying static \(H_\infty\) control problems (Q458880) (← links)
- Design of Marx generators as a structured eigenvalue assignment (Q472612) (← links)
- The \(\mathcal A\)-truncated \(K\)-moment problem (Q486690) (← links)
- Zero-convex functions, perturbation resilience, and subgradient projections for feasibility-seeking methods (Q494329) (← links)
- 2D system analysis via dual problems and polynomial matrix inequalities (Q501511) (← links)
- Lebesgue decomposition in action via semidefinite relaxations (Q503483) (← links)
- A semidefinite algorithm for completely positive tensor decomposition (Q513715) (← links)
- Necessary global optimality conditions for nonlinear programming problems with polynomial constraints (Q623367) (← links)
- Norm bounds and underestimators for unconstrained polynomial integer minimization (Q684153) (← links)
- Minimizing rational functions by exact Jacobian SDP relaxation applicable to finite singularities (Q742119) (← links)
- Monotonically positive matrices (Q745213) (← links)
- Linear optimization with cones of moments and nonnegative polynomials (Q745685) (← links)
- Moments and sums of squares for polynomial optimization and related problems (Q842714) (← links)
- Representations of positive polynomials on noncompact semialgebraic sets via KKT ideals (Q863907) (← links)
- Partially positive matrices (Q892772) (← links)
- Interiors of completely positive cones (Q897047) (← links)
- Border basis relaxation for polynomial optimization (Q898268) (← links)
- An algorithm for the global optimization of a class of continuous minimax problems (Q1028590) (← links)
- A prolongation-projection algorithm for computing the finite real variety of an ideal (Q1029340) (← links)
- Semidefinite characterization and computation of zero-dimensional real radical ideals (Q1029543) (← links)
- Global optimization of robust chance constrained problems (Q1029686) (← links)
- A generalized flat extension theorem for moment matrices (Q1039946) (← links)
- Completely positive tensor recovery with minimal nuclear value (Q1639713) (← links)
- Tensor eigenvalue complementarity problems (Q1659680) (← links)
- Optimal control of switching topology networks (Q1718012) (← links)
- Real eigenvalues of nonsymmetric tensors (Q1753066) (← links)
- Tensor maximal correlation problems (Q1753137) (← links)
- How to generate weakly infeasible semidefinite programs via Lasserre's relaxations for polynomial optimization (Q1926632) (← links)
- A semidefinite approach for truncated \(K\)-moment problems (Q1928277) (← links)
- An exact Jacobian SDP relaxation for polynomial optimization (Q1942264) (← links)
- The tracial moment problem and trace-optimization of polynomials (Q1942272) (← links)
- The Gauss-Seidel method for generalized Nash equilibrium problems of polynomials (Q2028496) (← links)
- Multi-objective convex polynomial optimization and semidefinite programming relaxations (Q2038921) (← links)
- A sublevel moment-SOS hierarchy for polynomial optimization (Q2070330) (← links)
- Unconstrained minimization of block-circulant polynomials via semidefinite program in third-order tensor space (Q2079694) (← links)
- Distributionally robust optimization with moment ambiguity sets (Q2111170) (← links)
- Local saddle points for unconstrained polynomial optimization (Q2125068) (← links)
- Positivity certificates and polynomial optimization on non-compact semialgebraic sets (Q2149557) (← links)
- Certifying the global optimality of quartic minimization over the sphere (Q2158108) (← links)
- The saddle point problem of polynomials (Q2162120) (← links)
- Hermitian completely positive matrices (Q2197205) (← links)
- Completely positive tensors in the complex field (Q2197844) (← 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)
- Test of copositive tensors (Q2313772) (← links)
- A semidefinite relaxation algorithm for checking completely positive separable matrices (Q2313773) (← links)