Newton's method for linear complementarity problems

DOI10.1007/BF02612339zbMath0533.90088MaRDI QIDQ3316988

Muhamed Aganagic

Publication date: 1984

Published in: Mathematical Programming (Search for Journal in Brave)

zbMATH Keywords

linear complementaritycomputational resultscomputational experiences355.90040381.90072Hidden \({\mathcal Z}\)-matricesiterative, Newton- type methodleast element solutions

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Linear programming (90C05) Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming) (90C33)

Related Items

An analysis of the unified formulation for the equilibrium problem of compositional multiphase mixtures, Semi-smooth Newton methods for nonlinear complementarity formulation of compositional two-phase flow in porous media, Reformulation of mathematical programming problems as linear complementarity problems and investigation of their solution methods, A family of second-order methods for convex \(\ell _1\)-regularized optimization, A constrained optimization approach to solving certain systems of convex equations, Iterative methods for a class of complementarity problems, Fixed point approach for complementarity problems, A Newton-type method for positive-semidefinite linear complementarity problems, 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 new approach for solving nonlinear algebraic systems with complementarity conditions. Application to compositional multiphase equilibrium problems, Exact computation of an error bound for the balanced linear complementarity problem with unique solution, Iterative algorithms for the linear complementarity problem, KLERC: kernel Lagrangian expectile regression calculator, Nonconvergence of the plain Newton-min algorithm for linear complementarity problems with a \(P\)-matrix, A superlinearly convergent projection algorithm for solving the convex inequality problem, Globally Convergent Primal-Dual Active-Set Methods with Inexact Subproblem Solves, Semismooth and smoothing Newton methods for nonlinear systems with complementarity constraints: adaptivity and inexact resolution, A globally convergent primal-dual active-set framework for large-scale convex quadratic optimization

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Solution of symmetric linear complementarity problems by iterative methods
• On the solution of large, structured linear complementarity problems: The tridiagonal case
• On the solution of large, structured linear complementarity problems: the block partitioned case
• Hidden Z-matrices with positive principal minors
• Some generalizations of positive definiteness and monotonicity
• Complementary pivot theory of mathematical programming
• Equivalence of the Complementarity Problem to a System of Nonlinear Equations
• Linear complementarity problems solvable by A single linear program
• On solving linear complementarity problems as linear programs
• On a class of least-element complementarity problems
• Bimatrix Equilibrium Points and Mathematical Programming
• The Solution of a Quadratic Programming Problem Using Systematic Overrelaxation
• A Partition Theorem for Euclidean n-Space