Newton-type methods for solving vertical linear complementarity problems
From MaRDI portal
Publication:6664929
DOI10.1016/j.cam.2024.116418MaRDI QIDQ6664929
Publication date: 16 January 2025
Published in: Journal of Computational and Applied Mathematics (Search for Journal in Brave)
Could not fetch data.
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Two-sweep modulus-based matrix splitting iteration methods for linear complementarity problems
- Two-step modulus-based matrix splitting iteration method for linear complementarity problems
- A modified damped Newton method for linear complementarity problems
- The generalized Leontief input-output model and its application to the choice of new technology
- On quadratic and \(O(\sqrt{n}L)\) convergence of a predictor-corrector algorithm for LCP
- Local convergence of interior-point algorithms for degenerate monotone LCP
- A preconditioned general modulus-based matrix splitting iteration method for linear complementarity problems of \(H\)-matrices
- Modulus-based matrix splitting iteration methods for a class of nonlinear complementarity problem
- A superquadratic infeasible-interior-point method for linear complementarity problems
- A preconditioned two-step modulus-based matrix splitting iteration method for linear complementarity problem
- An inexact alternating direction method of multipliers for a kind of nonlinear complementarity problems
- Fast modulus-based matrix splitting iteration methods for implicit complementarity problems
- Projected splitting methods for vertical linear complementarity problems
- A modulus-based formulation for the vertical linear complementarity problem
- A new kind of modulus-based matrix splitting methods for vertical linear complementarity problems
- A modified general modulus-based matrix splitting method for linear complementarity problems of \(H\)-matrices
- Modulus-based matrix splitting iteration methods for linear complementarity problems
- Optimization and nonsmooth analysis
- Superlinearly Convergent $O ( \sqrt{n} L )$-Iteration Interior-Point Algorithms for Linear Programming and the Monotone Linear Complementarity Problem
- Improved Inexact Alternating Direction Methods for a Class of Nonlinear Complementarity Problems
- On a Characterization ofP-Matrices
- Piecewise-Linear Theory of Nonlinear Networks
- A class of modulus-based matrix splitting methods for vertical linear complementarity problem
- Modulus-based matrix splitting iteration methods with new splitting scheme for horizontal implicit complementarity problems
- Improved modulus-based matrix splitting iteration methods for quasi-complementarity problems
- Modulus-based synchronous multisplitting iteration methods for large sparse vertical linear complementarity problems
This page was built for publication: Newton-type methods for solving vertical linear complementarity problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6664929)