New multiplier method for solving linear complementarity problems

DOI10.1007/S11464-006-0015-9zbMATH Open1222.90069OpenAlexW2065376903MaRDI QIDQ719949FDOQ719949

Authors Li Ji Wu, Guoqing Chen 

Publication date 12 October 2011

Published in Frontiers of Mathematics in China (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s11464-006-0015-9

zbMATH Keywords

linear complementarity problemfinite convergencemultiplier methodglobal linear convergence

Mathematics Subject Classification ID

Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming) (90C33)

Recommendations

• scientific article; zbMATH DE number 2155136
• A new multiplier method for complementarity problems
• scientific article; zbMATH DE number 1059227
• An Infeasible-Interior-Point Method for Linear Complementarity Problems
• scientific article; zbMATH DE number 5060295

Cites Work

• scientific article; zbMATH DE number 53115 (Why is no real title available?)
• scientific article; zbMATH DE number 1950377 (Why is no real title available?)
• A Non-Interior-Point Continuation Method for Linear Complementarity Problems
• A Smoothing Newton Method for Extended Vertical Linear Complementarity Problems
• A non-interior continuation method for generalized linear complementarity problems
• Engineering and Economic Applications of Complementarity Problems
• Finite-Dimensional Variational Inequalities and Complementarity Problems
• One-step quadratic convergence of noninterior continuation method for NCP
• Optimization and nonsmooth analysis
• Smooth methods of multipliers for complementarity problems
• Some Noninterior Continuation Methods for Linear Complementarity Problems
• The new advances in methods for complementarity problems.

Cited In (7)

• A new multiplier method for complementarity problems
• The new advances in methods for complementarity problems.
• Using vector divisions in solving the linear complementarity problem
• A trust region algorithm for linear complementarity problems with parametrized merit function
• Title not available (Why is no real title available?)
• New criss-cross type algorithms for linear complementarity problems with sufficient matrices
• A novel convex relaxation-strategy-based algorithm for solving linear multiplicative problems

This page was built for publication: New multiplier method for solving linear complementarity problems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q719949)