A semidefinite method for tensor complementarity problems
From MaRDI portal
Publication:5379459
DOI10.1080/10556788.2018.1439489zbMath1423.90259OpenAlexW2792710073WikidataQ130164830 ScholiaQ130164830MaRDI QIDQ5379459
Publication date: 12 June 2019
Published in: Optimization Methods and Software (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/10556788.2018.1439489
Nonlinear programming (90C30) Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming) (90C33)
Related Items
On the R0-tensors and the solution map of tensor complementarity problems ⋮ Finding the Least Element of a Nonnegative Solution Set of a Class of Polynomial Inequalities ⋮ A fixed point iterative method for tensor complementarity problems with the implicit \(Z\)-tensors ⋮ A general preconditioner for tensor complementarity problems ⋮ A fixed point iterative method for tensor complementarity problems ⋮ Quadratic tensor eigenvalue complementarity problems ⋮ Solving tensor complementarity problems with \(Z\)-tensors via a weighted fixed point method ⋮ Stability of Solutions and Continuity of Solution Maps of Tensor Complementarity Problems ⋮ Bounds of the solution set of the tensor complementarity problem ⋮ Generalized Tensor Complementarity Problems Over a Polyhedral Cone ⋮ A semidefinite relaxation method for second-order cone tensor eigenvalue complementarity problems ⋮ Tensor complementarity problems. II: Solution methods ⋮ An index detecting algorithm for a class of TCP \((\mathcal{A},q)\) equipped with nonsingular \(\mathcal{M}\)-tensors ⋮ A lower dimensional linear equation approach to the m-tensor complementarity problem ⋮ Solvability of two classes of tensor complementarity problems ⋮ Linearized methods for tensor complementarity problems ⋮ Higher-degree tensor eigenvalue complementarity problems ⋮ Estimations on upper and lower bounds of solutions to a class of tensor complementarity problems ⋮ The GUS-property and modulus-based methods for tensor complementarity problems ⋮ A smoothing Newton method preserving nonnegativity for solving tensor complementarity problems with \(P_0\) mappings ⋮ A Semidefinite Relaxation Method for Partially Symmetric Tensor Decomposition
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Positive-definite tensors to nonlinear complementarity problems
- Tensor complementarity problem and semi-positive tensors
- Global uniqueness and solvability for tensor complementarity problems
- The sparsest solutions to \(Z\)-tensor complementarity problems
- Semidefinite characterization and computation of zero-dimensional real radical ideals
- Nonlinear complementarity as unconstrained and constrained minimization
- A semismooth equation approach to the solution of nonlinear complementarity problems
- A semidefinite approach for truncated \(K\)-moment problems
- A new look at smoothing Newton methods for nonlinear complementarity problems and box constrained variational inequalities
- The hierarchy of local minimums in polynomial optimization
- Certifying convergence of Lasserre's hierarchy via flat truncation
- Global Optimization with Polynomials and the Problem of Moments
- Polynomial Optimization with Real Varieties
- A New Nonsmooth Equations Approach to Nonlinear Complementarity Problems
- The Linear Complementarity Problem
- GloptiPoly 3: moments, optimization and semidefinite programming
- Equivalence of the Complementarity Problem to a System of Nonlinear Equations
- Using SeDuMi 1.02, A Matlab toolbox for optimization over symmetric cones
