Iterative methods for linear complementarity problems with upperbounds on primary variables
From MaRDI portal
Publication:4744082
DOI10.1007/BF02591868zbMath0506.90081OpenAlexW2028621706MaRDI QIDQ4744082
Publication date: 1983
Published in: Mathematical Programming (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf02591868
convergencelinear complementarityiterative methodsprice controlslinear variational inequalityH-matricesquadratic programsZ-matricesmulticommodity market equilibriumupperbounds
Quadratic programming (90C20) Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming) (90C33) General equilibrium theory (91B50)
Related Items
A smoothing inexact Newton method for variational inequalities with nonlinear constraints ⋮ A generalized Newton method for non-Hermitian positive definite linear complementarity problem ⋮ A general accelerated modulus-based matrix splitting iteration method for solving linear complementarity problems ⋮ On the convergence of two-step modulus-based matrix splitting iteration method ⋮ Reformulation of mathematical programming problems as linear complementarity problems and investigation of their solution methods ⋮ On the nonlinear complementarity problem ⋮ A GENERALIZED VARIABLE FORMULATION FOR GRADIENT DEPENDENT SOFTENING PLASTICITY ⋮ Complementarity problems in semi-inner product spaces ⋮ Smoothing Newton method for generalized complementarity problems based on a new smoothing function ⋮ Boundary variational formulations and numerical solution techniques for unilateral contact problems ⋮ The quasi-complementarity problem ⋮ A class of iterative methods for solving nonlinear projection equations ⋮ Iterative methods for a class of complementarity problems ⋮ Fixed point approach for complementarity problems ⋮ A modified Solodov-Svaiter method for solving nonmonotone variational inequality problems ⋮ A Gauss-Seidel type solver for the fast computation of input-constrained control systems ⋮ Symmetric Galerkin boundary element method in plasticity and gradient plasticity ⋮ The reduced order method for solving the linear complementarity problem with an \(M\)-matrix ⋮ Un algoritmo global con jacobiano suavizado para problemas de complementariedad no lineal ⋮ A new extragradient-like method for solving variational inequality problems ⋮ On solving linear complementarity problems by DC programming and DCA ⋮ Generalized SOR-like iteration method for linear complementarity problem ⋮ On the new modulus-based matrix splitting method for linear complementarity problem of \(H_+\)-matrix ⋮ The numerical study of a regularized smoothing Newton method for solving \(P_{0}\)-NCP based on the generalized smoothing Fischer-Burmeister function ⋮ Iterative algorithms for semi-linear quasi-complementarity problems ⋮ Generalized AOR method for solving absolute complementarity problems ⋮ Nonlinear quasi complementarity problems ⋮ Projection methods, isotone projection cones, and the complementarity problem ⋮ Some new error bounds for linear complementarity problems of H-matrices ⋮ Iterative algorithms for the linear complementarity problem ⋮ Finite termination of a Newton-type algorithm based on a new class of smoothing functions for the affine variational inequality problem ⋮ Convergence of a smoothing-type algorithm for the monotone affine variational inequality problem ⋮ On the finite convergence of Newton-type methods for \(P_{0}\) affine variational inequalities ⋮ A new infeasible Mehrotra-type predictor-corrector algorithm for nonlinear complementarity problems over symmetric cones ⋮ Verification for existence of solutions of linear complementarity problems ⋮ A non-interior-point smoothing method for variational inequality problem ⋮ The modulus-based matrix double splitting iteration method for linear complementarity problems ⋮ A preconditioned modulus-based iteration method for solving linear complementarity problems ofH-matrices ⋮ A Jacobian smoothing method for box constrained variational inequality problems ⋮ A new smoothing and regularization Newton method for \(P_{0}\)-NCP ⋮ A Levenberg-Marquardt method for nonlinear complementarity problems based on nonmonotone trust region and line search techniques ⋮ A smoothing Levenberg-Marquardt method for NCP ⋮ Convergence of a non-interior smoothing method for variational inequality problems ⋮ A non-modulus linear method for solving the linear complementarity problem ⋮ An iteration method for nonlinear complementarity problems ⋮ Backward errors of the linear complementarity problem ⋮ A note on the unique solution of linear complementarity problem ⋮ Error bounds for linear complementarity problems of \(MB\)-matrices ⋮ Strongly nonlinear quasivariational inequalities ⋮ A new class of neural networks for NCPs using smooth perturbations of the natural residual function ⋮ Generalized symmetric accelerated over relaxation method for solving absolute value complementarity problems ⋮ The block principal pivoting algorithm for the linear complementarity problem with an \(M\)-matrix ⋮ A new smoothing method for solving nonlinear complementarity problems ⋮ An improvement on the global error bound estimation for ELCP and its applications ⋮ Some aspects of variational inequalities ⋮ The modulus-based nonsmooth Newton's method for solving linear complementarity problems ⋮ A globally and locally superlinearly convergent inexact Newton-GMRES method for large-scale variational inequality problem ⋮ Infeasible path-following interior point algorithm for Cartesian P*(κ) nonlinear complementarity problems over symmetric cones ⋮ Basic-set algorithm for a generalized linear complementarity problem ⋮ A block principal pivoting algorithm for large-scale strictly monotone linear complementarity problems ⋮ A smoothing Broyden-like method for the mixed complementarity problems ⋮ A smooth Newton method with 3-1 piecewise NCP function for generalized nonlinear complementarity problem
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Solution of nonsymmetric, linear complementarity problems by iterative methods
- Some algorithms solving the unilateral Dirichlet problem with two constraints
- Solution of symmetric linear complementarity problems by iterative methods
- On the solution of large, structured linear complementarity problems: the block partitioned case
- On Convergence of the PIES Algorithm for Computing Equilibria
- Classes of functions and feasibility conditions in nonlinear complementarity problems
- The solution of a quadratic programming problem using fast methods to solve systems of linear equations
- Minimization of a Quadratic Function of Many Variables Subject only to Lower and Upper Bounds
- Isotone solutions of parametric linear complementarity problems
- On a class of least-element complementarity problems
- On a characterization of P-matrices
- The bounded variable problem‐an application of the dual method for quadratic programming
- The Solution of a Quadratic Programming Problem Using Systematic Overrelaxation
- Least d-Majorized Network Flows with Inventory and Statistical Applications
