Finding the Least Element of a Nonnegative Solution Set of a Class of Polynomial Inequalities
From MaRDI portal
Publication:6101123
DOI10.1137/22m1476733zbMath1519.90244MaRDI QIDQ6101123
Yu-Fan Li, Zheng-Hai Huang, Xin-He Miao
Publication date: 31 May 2023
Published in: SIAM Journal on Matrix Analysis and Applications (Search for Journal in Brave)
Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming) (90C33) Numerical methods for variational inequalities and related problems (65K15)
Cites Work
- 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
- Formulating an \(n\)-person noncooperative game as a tensor complementarity problem
- Implicit solution function of P\(_{0}\) and Z matrix linear complementarity constraints
- The generalized linear complementarity problem: Least element theory and Z-matrices
- The tensor splitting with application to solve multi-linear systems
- An iterative method for finding the least solution to the tensor complementarity problem
- A continuation method for tensor complementarity problems
- Positive definite and Gram tensor complementarity problems
- Global uniqueness and solvability of tensor complementarity problems for \(\mathcal{H}_+\)-tensors
- The nonnegative zero-norm minimization under generalized \(Z\)-matrix measurement
- Tensor complementarity problems. I: Basic theory
- Tensor complementarity problems. II: Solution methods
- Tensor complementarity problems. III: Applications
- An equivalent tensor equation to the tensor complementarity problem with positive semi-definite \(Z\)-tensor
- Properties of some classes of structured tensors
- Solving multi-linear systems with \(\mathcal {M}\)-tensors
- A homotopy method for solving multilinear systems with M-tensors
- A mixed integer programming approach to the tensor complementarity problem
- Nonnegative generalized inverses and least elements of polyhedral sets
- \(M\)-tensors and nonsingular \(M\)-tensors
- Eigenvalues of a real supersymmetric tensor
- Exceptionally regular tensors and tensor complementarity problems
- $M$-Tensors and Some Applications
- GloptiPoly 3: moments, optimization and semidefinite programming
- Algorithm 862
- Fixed Point Equations and Nonlinear Eigenvalue Problems in Ordered Banach Spaces
- A note on polyhedral sets having A least element
- Linear complementarity problems solvable by A single linear program
- A Least-Element Theory of Solving Linear Complementarity Problems as Linear Programs
- Using SeDuMi 1.02, A Matlab toolbox for optimization over symmetric cones
- Properties of Tensor Complementarity Problem and Some Classes of Structured Tensors
- Tensor complementarity problems: the GUS-property and an algorithm
- Finite-Dimensional Variational Inequalities and Complementarity Problems
- On the properties of tensor complementarity problems
- Finding a Nonnegative Solution to an M-Tensor Equation
- Modified gradient dynamic approach to the tensor complementarity problem
- A semidefinite method for tensor complementarity problems
- Polyhedral sets having a least element