Iterative methods for linear complementarity problems with upperbounds on primary variables

DOI10.1007/BF02591868zbMATH Open0506.90081OpenAlexW2028621706MaRDI QIDQ4744082FDOQ4744082

Authors: Byong-Hun Ahn 

Publication date: 1983

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

Full work available at URL: https://doi.org/10.1007/bf02591868

zbMATH Keywords

convergenceiterative methodslinear variational inequalityprice controlsH-matriceslinear complementarityquadratic programsZ-matricesmulticommodity market equilibriumupperbounds

Mathematics Subject Classification ID

Quadratic programming (90C20) Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming) (90C33) General equilibrium theory (91B50)

Cites Work

• Title not available (Why is that?)
• Solution of nonsymmetric, linear complementarity problems by iterative methods
• Solution of symmetric linear complementarity problems by iterative methods
• Classes of functions and feasibility conditions in nonlinear complementarity problems
• The Solution of a Quadratic Programming Problem Using Systematic Overrelaxation
• On the solution of large, structured linear complementarity problems: the block partitioned case
• Title not available (Why is that?)
• On Convergence of the PIES Algorithm for Computing Equilibria
• Least d-Majorized Network Flows with Inventory and Statistical Applications
• Minimization of a Quadratic Function of Many Variables Subject only to Lower and Upper Bounds
• Title not available (Why is that?)
• Title not available (Why is that?)
• Isotone solutions of parametric linear complementarity problems
• Title not available (Why is that?)
• The solution of a quadratic programming problem using fast methods to solve systems of linear equations
• On a class of least-element complementarity problems
• Some algorithms solving the unilateral Dirichlet problem with two constraints
• On a characterization of P-matrices
• The bounded variable problem‐an application of the dual method for quadratic programming

Cited In (63)

• A Jacobian smoothing inexact Newton method for solving the nonlinear complementary problem
• An improvement on the global error bound estimation for ELCP and its applications
• Complementarity problems in semi-inner product spaces
• A globally and locally superlinearly convergent inexact Newton-GMRES method for large-scale variational inequality problem
• Generalized symmetric accelerated over relaxation method for solving absolute value complementarity problems
• A smoothing Levenberg-Marquardt method for NCP
• Convergence of a non-interior smoothing method for variational inequality problems
• On solving linear complementarity problems by DC programming and DCA
• A non-interior-point smoothing method for variational inequality problem
• Error bounds for linear complementarity problems of \(MB\)-matrices
• On the new modulus-based matrix splitting method for linear complementarity problem of \(H_+\)-matrix
• The modulus-based matrix double splitting iteration method for linear complementarity problems
• A new smoothing method for solving nonlinear complementarity problems
• A preconditioned modulus-based iteration method for solving linear complementarity problems of \(H\)-matrices
• A new infeasible Mehrotra-type predictor-corrector algorithm for nonlinear complementarity problems over symmetric cones
• Infeasible path-following interior point algorithm for Cartesian \(P_\ast(\kappa )\) nonlinear complementarity problems over symmetric cones
• The numerical study of a regularized smoothing Newton method for solving \(P_{0}\)-NCP based on the generalized smoothing Fischer-Burmeister function
• A new smoothing and regularization Newton method for \(P_{0}\)-NCP
• On the nonlinear complementarity problem
• A general accelerated modulus-based matrix splitting iteration method for solving linear complementarity problems
• The quasi-complementarity problem
• Basic-set algorithm for a generalized linear complementarity problem
• On the convergence of two-step modulus-based matrix splitting iteration method
• Backward errors of the linear complementarity problem
• Projection methods, isotone projection cones, and the complementarity problem
• A class of iterative methods for solving nonlinear projection equations
• Generalized AOR method for solving absolute complementarity problems
• Smoothing Newton method for generalized complementarity problems based on a new smoothing function
• A Jacobian smoothing method for box constrained variational inequality problems
• Boundary variational formulations and numerical solution techniques for unilateral contact problems
• Reformulation of mathematical programming problems as linear complementarity problems and investigation of their solution methods
• The modulus-based nonsmooth Newton's method for solving linear complementarity problems
• A generalized Newton method for non-Hermitian positive definite linear complementarity problem
• Finite termination of a Newton-type algorithm based on a new class of smoothing functions for the affine variational inequality problem
• Iterative methods for a class of complementarity problems
• Some new error bounds for linear complementarity problems of H-matrices
• A modified Solodov-Svaiter method for solving nonmonotone variational inequality problems
• Convergence of a smoothing-type algorithm for the monotone affine variational inequality problem
• A smoothing Broyden-like method for the mixed complementarity problems
• An iteration method for nonlinear complementarity problems
• A smoothing inexact Newton method for variational inequalities with nonlinear constraints
• Verification for existence of solutions of linear complementarity problems
• A Gauss-Seidel type solver for the fast computation of input-constrained control systems
• A block principal pivoting algorithm for large-scale strictly monotone linear complementarity problems
• The reduced order method for solving the linear complementarity problem with an \(M\)-matrix
• Symmetric Galerkin boundary element method in plasticity and gradient plasticity
• Iterative algorithms for semi-linear quasi-complementarity problems
• Strongly nonlinear quasivariational inequalities
• Nonlinear quasi complementarity problems
• The block principal pivoting algorithm for the linear complementarity problem with an \(M\)-matrix
• A global Jacobian smoothing algorithm for nonlinear complementarity problems
• A non-modulus linear method for solving the linear complementarity problem
• A new class of neural networks for NCPs using smooth perturbations of the natural residual function
• A smooth Newton method with 3-1 piecewise NCP function for generalized nonlinear complementarity problem
• Iterative algorithms for the linear complementarity problem
• Generalized SOR-like iteration method for linear complementarity problem
• A note on the unique solution of linear complementarity problem
• A GENERALIZED VARIABLE FORMULATION FOR GRADIENT DEPENDENT SOFTENING PLASTICITY
• On the finite convergence of Newton-type methods for \(P_{0}\) affine variational inequalities
• A new extragradient-like method for solving variational inequality problems
• Some aspects of variational inequalities
• A Levenberg-Marquardt method for nonlinear complementarity problems based on nonmonotone trust region and line search techniques
• Fixed point approach for complementarity problems

This page was built for publication: Iterative methods for linear complementarity problems with upperbounds on primary variables

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