Pages that link to "Item:Q1942264"
From MaRDI portal
The following pages link to An exact Jacobian SDP relaxation for polynomial optimization (Q1942264):
Displaying 34 items.
- Semidefinite programming relaxation methods for global optimization problems with sparse polynomials and unbounded semialgebraic feasible sets (Q288220) (← links)
- Optimality conditions and finite convergence of Lasserre's hierarchy (Q403636) (← links)
- An improved semidefinite programming hierarchy for testing entanglement (Q529619) (← links)
- Minimizing rational functions by exact Jacobian SDP relaxation applicable to finite singularities (Q742119) (← links)
- Linear optimization with cones of moments and nonnegative polynomials (Q745685) (← links)
- Equality-constrained minimization of polynomial functions (Q892787) (← links)
- Global optimization of polynomials over real algebraic sets (Q1730308) (← links)
- Calculating entanglement eigenvalues for nonsymmetric quantum pure states based on the Jacobian semidefinite programming relaxation method (Q1730769) (← links)
- Real eigenvalues of nonsymmetric tensors (Q1753066) (← links)
- Tensor maximal correlation problems (Q1753137) (← links)
- An approach to constrained polynomial optimization via nonnegative circuit polynomials and geometric programming (Q1994127) (← links)
- On the conditions for the finite termination of ADMM and its applications to SOS polynomials feasibility problems (Q2007822) (← links)
- Solving the equality-constrained minimization problem of polynomial functions (Q2010089) (← links)
- Computing geometric measure of entanglement for symmetric pure states via the Jacobian SDP relaxation technique (Q2014679) (← links)
- An efficient alternating minimization method for fourth degree polynomial optimization (Q2070363) (← links)
- Local saddle points for unconstrained polynomial optimization (Q2125068) (← links)
- Certifying the global optimality of quartic minimization over the sphere (Q2158108) (← links)
- Stable rank-one matrix completion is solved by the level \(2\) Lasserre relaxation (Q2231643) (← links)
- Intrinsic complexity estimates in polynomial optimization (Q2251913) (← links)
- On semi-infinite systems of convex polynomial inequalities and polynomial optimization problems (Q2307704) (← links)
- Tight relaxations for polynomial optimization and Lagrange multiplier expressions (Q2330641) (← links)
- A new approximation hierarchy for polynomial conic optimization (Q2419540) (← links)
- Certifying convergence of Lasserre's hierarchy via flat truncation (Q2434992) (← links)
- Semidefinite relaxations for semi-infinite polynomial programming (Q2450900) (← links)
- Positive Maps and Separable Matrices (Q2810548) (← links)
- Semidefinite Optimization Estimating Bounds on Linear Functionals Defined on Solutions of Linear ODEs (Q5153670) (← links)
- Semidefinite Representations of Noncompact Convex Sets (Q5252601) (← links)
- Bilevel Polynomial Programs and Semidefinite Relaxation Methods (Q5348472) (← links)
- Generic Properties for Semialgebraic Programs (Q5363376) (← links)
- Well-Posedness in Unconstrained Polynomial Optimization Problems (Q5741069) (← links)
- A Semidefinite Relaxation Method for Partially Symmetric Tensor Decomposition (Q5870360) (← links)
- Homogenization for polynomial optimization with unbounded sets (Q6044977) (← links)
- A practical approach to SOS relaxations for detecting quantum entanglement (Q6050141) (← links)
- Convex Relaxations of Integral Variational Problems: Pointwise Dual Relaxation and Sum-of-Squares Optimization (Q6155878) (← links)
