Tensor Complementarity Problems—Part II: Solution Methods
- 16 August 2019
- journal article
- research article
- Published by Springer Nature in Journal of Optimization Theory and Applications
- Vol. 183 (2) , 365-385
Abstract
No abstract availableKeywords
Funding Information
- The Hong Kong Research Grant Council (PolyU 15302114, 15300715)
- The Hong Kong Research Grant Council (15301716, 15300717)
- National Natural Science Foundation of China (11431002, 11871051)
This publication has 56 references indexed in Scilit:
- Modulus-based matrix splitting iteration methods for linear complementarity problemsNumerical Linear Algebra with Applications, 2010
- A potential reduction method for the generalized linear complementarity problem over a polyhedral coneJournal of Industrial and Management Optimization, 2010
- Properties of a family of generalized NCP-functions and a derivative free algorithm for complementarity problemsJournal of Computational and Applied Mathematics, 2009
- A new homotopy method for solving non-linear complementarity problemsOptimization, 2008
- Smoothing algorithms for complementarity problems over symmetric conesComputational Optimization and Applications, 2008
- Semidefinite Characterization and Computation of Zero-Dimensional Real Radical IdealsFoundations of Computational Mathematics, 2007
- Global and superlinear convergence of the smoothing Newton method and its application to general box constrained variational inequalitiesMathematics of Computation, 1998
- A special newton-type optimization methodOptimization, 1992
- Linear complementarity problems solvable by integer programmingOptimization, 1988
- Semismooth and Semiconvex Functions in Constrained OptimizationSIAM Journal on Control and Optimization, 1977