Pages that link to "Item:Q2349136"
From MaRDI portal
The following pages link to The hierarchy of local minimums in polynomial optimization (Q2349136):
Displaying 26 items.
- Global uniqueness and solvability of tensor variational inequalities (Q1637354) (← links)
- Tensor eigenvalue complementarity problems (Q1659680) (← 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)
- 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)
- Complexity aspects of local minima and related notions (Q2074805) (← links)
- An adaptive high order method for finding third-order critical points of nonconvex optimization (Q2079692) (← links)
- Distributionally robust optimization with moment ambiguity sets (Q2111170) (← links)
- Local saddle points for unconstrained polynomial optimization (Q2125068) (← links)
- Learning diagonal Gaussian mixture models and incomplete tensor decompositions (Q2135086) (← links)
- Tensor complementarity problems. II: Solution methods (Q2275317) (← links)
- On types of degenerate critical points of real polynomial functions (Q2284966) (← links)
- Higher-degree tensor eigenvalue complementarity problems (Q2307709) (← links)
- Local minima, marginal functions, and separating hyperplanes in discrete optimization (Q2473013) (← links)
- Convex generalized Nash equilibrium problems and polynomial optimization (Q2693649) (← links)
- Loss functions for finite sets (Q2696910) (← links)
- (Q4281505) (← links)
- Minimizer Extraction in Polynomial Optimization Is Robust (Q4561225) (← links)
- Low order polynomial bounds on the expected performance of local improvement algorithms (Q4721084) (← links)
- A semidefinite method for tensor complementarity problems (Q5379459) (← links)
- The maximum tensor complementarity eigenvalues (Q5859001) (← links)
- A Semidefinite Relaxation Method for Partially Symmetric Tensor Decomposition (Q5870360) (← links)
- Homogenization for polynomial optimization with unbounded sets (Q6044977) (← links)
- A proximal alternating minimization algorithm for the largest C-eigenvalue of piezoelectric-type tensors (Q6064027) (← links)
- On types of isolated KKT points in polynomial optimization (Q6594973) (← links)
