Newton's method for linear complementarity problems
From MaRDI portal
Recommendations
- A linearization method for generalized complementarity problems
- Iterative methods for a class of complementarity problems
- On finite termination of an iterative method for linear complementarity problems
- A rapid algorithm for a class of linear complementarity problems
- Global Convergence Properties of Some Iterative Methods for Linear Complementarity Problems
Cites work
- A Partition Theorem for Euclidean n-Space
- Bimatrix Equilibrium Points and Mathematical Programming
- Complementary pivot theory of mathematical programming
- Equivalence of the Complementarity Problem to a System of Nonlinear Equations
- Hidden Z-matrices with positive principal minors
- scientific article; zbMATH DE number 3532286 (Why is no real title available?)
- scientific article; zbMATH DE number 3545346 (Why is no real title available?)
- scientific article; zbMATH DE number 3554413 (Why is no real title available?)
- scientific article; zbMATH DE number 3615810 (Why is no real title available?)
- scientific article; zbMATH DE number 3212891 (Why is no real title available?)
- scientific article; zbMATH DE number 3381785 (Why is no real title available?)
- Linear complementarity problems solvable by A single linear program
- On a class of least-element complementarity problems
- On solving linear complementarity problems as linear programs
- On the solution of large, structured linear complementarity problems: the block partitioned case
- On the solution of large, structured linear complementarity problems: The tridiagonal case
- Solution of symmetric linear complementarity problems by iterative methods
- Some generalizations of positive definiteness and monotonicity
- The Solution of a Quadratic Programming Problem Using Systematic Overrelaxation
Cited in
(26)- Reformulation of mathematical programming problems as linear complementarity problems and investigation of their solution methods
- Iterative methods for a class of complementarity problems
- Fixed point approach for complementarity problems
- A superlinearly convergent projection algorithm for solving the convex inequality problem
- Gauss-Newton methods for the complementarity problem
- On finite termination of an iterative method for linear complementarity problems
- A Newton-type method for positive-semidefinite linear complementarity problems
- KLERC: kernel Lagrangian expectile regression calculator
- Semismooth and smoothing Newton methods for nonlinear systems with complementarity constraints: adaptivity and inexact resolution
- Semi-smooth Newton methods for nonlinear complementarity formulation of compositional two-phase flow in porous media
- A lower bound on the iterative complexity of the Harker and Pang globalization technique of the Newton-min algorithm for solving the linear complementarity problem
- A generalized Newton method for a class of discrete-time linear complementarity systems
- A globally convergent primal-dual active-set framework for large-scale convex quadratic optimization
- A new approach for solving nonlinear algebraic systems with complementarity conditions. Application to compositional multiphase equilibrium problems
- Globally convergent primal-dual active-set methods with inexact subproblem solves
- scientific article; zbMATH DE number 6001321 (Why is no real title available?)
- A family of second-order methods for convex \(\ell _1\)-regularized optimization
- A linearization method for generalized complementarity problems
- Iterative algorithms for the linear complementarity problem
- An analysis of the unified formulation for the equilibrium problem of compositional multiphase mixtures
- Exact computation of an error bound for the balanced linear complementarity problem with unique solution
- A deep learning approach for solving the stationary compositional two-phase equilibrium problems
- Polyhedral Newton-min algorithms for complementarity problems
- On the B-differential of the componentwise minimum of two affine vector functions
- Nonconvergence of the plain Newton-min algorithm for linear complementarity problems with a P-matrix
- A constrained optimization approach to solving certain systems of convex equations
This page was built for publication: Newton's method for linear complementarity problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3316988)
