A semidefinite relaxation method for second-order cone polynomial complementarity problems
From MaRDI portal
Recommendations
- A semidefinite relaxation method for second-order cone tensor eigenvalue complementarity problems
- A semidefinite method for tensor complementarity problems
- Tensor complementarity problems. II: Solution methods
- Tensor \(Z\)-eigenvalue complementarity problems
- A new method for solving second-order cone eigenvalue complementarity problems
Cites work
- scientific article; zbMATH DE number 4029737 (Why is no real title available?)
- scientific article; zbMATH DE number 2212211 (Why is no real title available?)
- A complete semidefinite algorithm for detecting copositive matrices and tensors
- A semidefinite approach for truncated \(K\)-moment problems
- All real eigenvalues of symmetric tensors
- An efficient matrix splitting method for the second-order cone complementarity problem
- An introduction to polynomial and semi-algebraic optimization
- An unconstrained smooth minimization reformulation of the second-order cone complementarity problem
- Certifying convergence of Lasserre's hierarchy via flat truncation
- Column sufficient tensors and tensor complementarity problems
- Finite-Dimensional Variational Inequalities and Complementarity Problems
- Global error bounds for the tensor complementarity problem with a \(P\)-tensor
- Global optimization with polynomials and the problem of moments
- GloptiPoly 3: moments, optimization and semidefinite programming
- Optimization over polynomials: selected topics
- Polynomial optimization with real varieties
- Properties of S-tensors
- Properties of tensor complementarity problem and some classes of structured tensors
- Real eigenvalues of nonsymmetric tensors
- SDP relaxation algorithms for \(\mathbf{P(P}_0)\)-tensor detection
- Smoothing functions for second-order-cone complementarity problems
- Stochastic R₀ tensors to stochastic tensor complementarity problems
- Sums of squares, moment matrices and optimization over polynomials
- Tensor complementarity problems. I: Basic theory
- Tensor complementarity problems. II: Solution methods
- Tensor eigenvalue complementarity problems
- The best rank-one approximation ratio of a tensor space
- The maximum tensor complementarity eigenvalues
- Truncated \(K\)-moment problems in several variables
- Using SeDuMi 1.02, A Matlab toolbox for optimization over symmetric cones
- \(\mathrm{P}\)-tensors, \(\mathrm{P}_0\)-tensors, and their applications
Cited in
(9)- A semidefinite method for tensor complementarity problems
- A descent method for a reformulation of the second-order cone complementarity problem
- A semidefinite relaxation method for second-order cone tensor eigenvalue complementarity problems
- On polyhedral and second-order cone decompositions of semidefinite optimization problems
- Bounds of the solution set to the polynomial complementarity problem
- Second-Order Cone Relaxations for Binary Quadratic Polynomial Programs
- Strict feasibility for the polynomial complementarity problem
- Semidefinite relaxation method for polynomial optimization with second-order cone complementarity constraints
- Smoothing penalty approach for solving second-order cone complementarity problems
This page was built for publication: A semidefinite relaxation method for second-order cone polynomial complementarity problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2307702)
