Iterative methods for linear complementarity problems with upperbounds on primary variables
From MaRDI portal
Publication:4744082
Cites work
- scientific article; zbMATH DE number 3718852 (Why is no real title available?)
- scientific article; zbMATH DE number 3461705 (Why is no real title available?)
- scientific article; zbMATH DE number 3554050 (Why is no real title available?)
- scientific article; zbMATH DE number 3212891 (Why is no real title available?)
- scientific article; zbMATH DE number 3352737 (Why is no real title available?)
- Classes of functions and feasibility conditions in nonlinear complementarity problems
- Isotone solutions of parametric linear complementarity problems
- 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
- On Convergence of the PIES Algorithm for Computing Equilibria
- On a characterization of P-matrices
- On a class of least-element complementarity problems
- On the solution of large, structured linear complementarity problems: the block partitioned case
- Solution of nonsymmetric, linear complementarity problems by iterative methods
- Solution of symmetric linear complementarity problems by iterative methods
- Some algorithms solving the unilateral Dirichlet problem with two constraints
- The Solution of a Quadratic Programming Problem Using Systematic Overrelaxation
- The bounded variable problem‐an application of the dual method for quadratic programming
- The solution of a quadratic programming problem using fast methods to solve systems of linear equations
Cited in
(63)- 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
- A Jacobian smoothing inexact Newton method for solving the nonlinear complementary problem
- Generalized symmetric accelerated over relaxation method for solving absolute value complementarity problems
- A smooth Newton method with 3-1 piecewise NCP function for generalized nonlinear complementarity problem
- Strongly nonlinear quasivariational inequalities
- Iterative methods for a class of complementarity problems
- Some new error bounds for linear complementarity problems of H-matrices
- Reformulation of mathematical programming problems as linear complementarity problems and investigation of their solution methods
- A modified Solodov-Svaiter method for solving nonmonotone variational inequality problems
- Error bounds for linear complementarity problems of \(MB\)-matrices
- A GENERALIZED VARIABLE FORMULATION FOR GRADIENT DEPENDENT SOFTENING PLASTICITY
- Verification for existence of solutions of linear complementarity problems
- A Levenberg-Marquardt method for nonlinear complementarity problems based on nonmonotone trust region and line search techniques
- Nonlinear quasi complementarity problems
- The modulus-based matrix double splitting iteration method for linear complementarity 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 numerical study of a regularized smoothing Newton method for solving \(P_{0}\)-NCP based on the generalized smoothing Fischer-Burmeister function
- Basic-set algorithm for a generalized linear complementarity problem
- Infeasible path-following interior point algorithm for Cartesian \(P_\ast(\kappa )\) nonlinear complementarity problems over symmetric cones
- The block principal pivoting algorithm for the linear complementarity problem with an \(M\)-matrix
- Iterative algorithms for semi-linear quasi-complementarity problems
- A generalized Newton method for non-Hermitian positive definite linear complementarity problem
- Iterative algorithms for the linear complementarity problem
- A smoothing Levenberg-Marquardt method for NCP
- Generalized SOR-like iteration method for linear complementarity problem
- A new smoothing and regularization Newton method for \(P_{0}\)-NCP
- A Jacobian smoothing method for box constrained variational inequality problems
- On solving linear complementarity problems by DC programming and DCA
- A preconditioned modulus-based iteration method for solving linear complementarity problems of \(H\)-matrices
- On the convergence of two-step modulus-based matrix splitting iteration method
- Boundary variational formulations and numerical solution techniques for unilateral contact problems
- A class of iterative methods for solving nonlinear projection equations
- Generalized AOR method for solving absolute complementarity problems
- A global Jacobian smoothing algorithm for nonlinear complementarity problems
- On the new modulus-based matrix splitting method for linear complementarity problem of \(H_+\)-matrix
- A block principal pivoting algorithm for large-scale strictly monotone linear complementarity problems
- Fixed point approach for complementarity problems
- A non-modulus linear method for solving the linear complementarity problem
- A new extragradient-like method for solving variational inequality problems
- A smoothing Broyden-like method for the mixed complementarity problems
- A non-interior-point smoothing method for variational inequality problem
- The reduced order method for solving the linear complementarity problem with an \(M\)-matrix
- On the nonlinear complementarity problem
- Backward errors of the linear complementarity problem
- On the finite convergence of Newton-type methods for \(P_{0}\) affine variational inequalities
- A new smoothing method for solving nonlinear complementarity problems
- A new class of neural networks for NCPs using smooth perturbations of the natural residual function
- A note on the unique solution of linear complementarity problem
- A new infeasible Mehrotra-type predictor-corrector algorithm for nonlinear complementarity problems over symmetric cones
- Convergence of a smoothing-type algorithm for the monotone affine variational inequality problem
- An iteration method for nonlinear complementarity problems
- Finite termination of a Newton-type algorithm based on a new class of smoothing functions for the affine variational inequality problem
- The modulus-based nonsmooth Newton's method for solving linear complementarity problems
- Projection methods, isotone projection cones, and the complementarity problem
- A general accelerated modulus-based matrix splitting iteration method for solving linear complementarity problems
- Smoothing Newton method for generalized complementarity problems based on a new smoothing function
- Some aspects of variational inequalities
- The quasi-complementarity problem
- Convergence of a non-interior smoothing method for variational inequality problems
- A smoothing inexact Newton method for variational inequalities with nonlinear constraints
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)
