A semidefinite relaxation method for second-order cone polynomial complementarity problems

DOI10.1007/s10589-019-00162-1zbMath1441.15015OpenAlexW2996395503MaRDI QIDQ2307702

Lulu Cheng, Xinzhen Zhang

Publication date: 25 March 2020

Published in: Computational Optimization and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10589-019-00162-1

zbMATH Keywords

second-order conesemidefinite relaxationtensor complementarity problemLasserre's hierarchy

Mathematics Subject Classification ID

Semidefinite programming (90C22) Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming) (90C33) Eigenvalues, singular values, and eigenvectors (15A18) Multilinear algebra, tensor calculus (15A69)

Related Items (1)

Semidefinite relaxation method for polynomial optimization with second-order cone complementarity constraints

Uses Software

• SeDuMi
• GloptiPoly

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Column sufficient tensors and tensor complementarity problems
• \(\mathrm{P}\)-tensors, \(\mathrm{P}_0\)-tensors, and their applications
• Tensor eigenvalue complementarity problems
• Real eigenvalues of nonsymmetric tensors
• A semidefinite approach for truncated \(K\)-moment problems
• Tensor complementarity problems. I: Basic theory
• Tensor complementarity problems. II: Solution methods
• SDP relaxation algorithms for \(\mathbf{P(P}_0)\)-tensor detection
• Global error bounds for the tensor complementarity problem with a \(P\)-tensor
• Stochastic \(R_0\) tensors to stochastic tensor complementarity problems
• Certifying convergence of Lasserre's hierarchy via flat truncation
• An unconstrained smooth minimization reformulation of the second-order cone complementarity problem
• Global Optimization with Polynomials and the Problem of Moments
• Smoothing Functions for Second-Order-Cone Complementarity Problems
• Polynomial Optimization with Real Varieties
• An Introduction to Polynomial and Semi-Algebraic Optimization
• An Efficient Matrix Splitting Method for the Second-Order Cone Complementarity Problem
• The Best Rank-One Approximation Ratio of a Tensor Space
• GloptiPoly 3: moments, optimization and semidefinite programming
• Using SeDuMi 1.02, A Matlab toolbox for optimization over symmetric cones
• Properties of Tensor Complementarity Problem and Some Classes of Structured Tensors
• Properties of S-tensors
• A Complete Semidefinite Algorithm for Detecting Copositive Matrices and Tensors
• Finite-Dimensional Variational Inequalities and Complementarity Problems
• All Real Eigenvalues of Symmetric Tensors
• The maximum tensor complementarity eigenvalues

This page was built for publication: A semidefinite relaxation method for second-order cone polynomial complementarity problems