Solution of symmetric linear complementarity problems by iterative methods
From MaRDI portal
Cites work
- Complementary pivot theory of mathematical programming
- scientific article; zbMATH DE number 3545331 (Why is no real title available?)
- scientific article; zbMATH DE number 3215568 (Why is no real title available?)
- scientific article; zbMATH DE number 3245945 (Why is no real title available?)
- scientific article; zbMATH DE number 3332061 (Why is no real title available?)
- scientific article; zbMATH DE number 3352737 (Why is no real title available?)
- scientific article; zbMATH DE number 3354513 (Why is no real title available?)
- scientific article; zbMATH DE number 3366440 (Why is no real title available?)
- scientific article; zbMATH DE number 3393631 (Why is no real title available?)
- scientific article; zbMATH DE number 3403376 (Why is no real title available?)
- Linear complementarity problems solvable by a single linear program
- Methodes de Decomposition pour la Minimisation d’une Fonction sur un Espace Produit
- On matrices with non-positive off-diagonal elements and positive principal minors
- On recurring theorems on diagonal dominance
- On the number of solutions to the complementarity problem and spanning properties of complementary cones
- The Method of Christopherson for Solving Free Boundary Problems for Infinite Journal Bearings by Means of Finite Differences
- THE NUMERICAL SOLUTION OF REYNOLDS‘ EQUATION FOR A JOURNAL BEARING
- The Solution of a Quadratic Programming Problem Using Systematic Overrelaxation
Cited in
(only showing first 100 items - show all)- Nonstationary extrapolated modulus algorithms for the solution of the linear complementarity problem
- More results on the convergence of iterative methods for the symmetric linear complementarity problem
- An alternating direction implicit algorithm for the solution of linear complementarity problems arising from free boundary problems
- Parallel successive overrelaxation methods for symmetric linear complementarity problems and linear programs
- Sparsity-preserving SOR algorithms for separable quadratic and linear programming
- Reformulation of mathematical programming problems as linear complementarity problems and investigation of their solution methods
- A note on a quadratic formulation for linear complementarity problems
- A new result in the theory and computation of the least-norm solution of a linear program
- On the nonlinear complementarity problem
- A dual exact penalty formulation for the linear complementarity problem
- An LP-based successive overrelaxation method for linear complementarity problems
- Error bounds for strongly convex programs and (super)linearly convergent iterative schemes for the least 2-norm solution of linear programs
- The quasi-complementarity problem
- Iterative methods for a class of complementarity problems
- Fixed point approach for complementarity problems
- Asynchronous parallel successive overrelaxation for the symmetric linear complementarity problem
- Pairwise reactive SOR algorithm for quadratic programming of net import spatial equilibrium models
- Implementing proximal point methods for linear programming
- Solution of nonsymmetric, linear complementarity problems by iterative methods
- On the convergence of a basic iterative method for the implicit complementarity problem
- The solution of linear complementarity problems on an array processor
- A Gauss-Seidel iteration method for nonlinear variational inequality problems over rectangles
- Projected successive overrelaxation method for finite-element solutions to the Dirichlet problem for a system of nonlinear elliptic equations
- Solution of projection problems over polytopes
- A projection and contraction method for a class of linear complementarity problems and its application in convex quadratic programming
- Parallel gradient projection successive overrelaxation for symmetric linear complementarity problems and linear programs
- On a global error bound for a class of monotone affine variational inequality problems
- Two-stage parallel iterative methods for the symmetric linear complementarity problem
- A note on the implementation of the successive overrelaxation method for linear complementarity problems
- A successive projection method
- Nonlinear relaxation methods for solving symmetric linear complementary problems
- Parallel computation of intertemporal multicommodity spatial price equilibria in the presence of quotas
- Error bounds and convergence analysis of feasible descent methods: A general approach
- Adjustment process-based approach for computing a Nash-Cournot equilibrium
- Descent methods for convex essentially smooth minimization
- Gauss-Newton methods for the complementarity problem
- On a class of iterative projection and contraction methods for linear programming
- On the solution of a two ball trust region subproblem
- A two-stage successive overrelaxation algorithm for solving the symmetric linear complementarity problem
- A new method for a class of linear variational inequalities
- On the parameter identification problem for failure criteria in anisotropic bodies
- Modified AOR methods for linear complementarity problem
- A modified projection algorithm for large strictly-convex quadratic programs
- Modulus-based matrix splitting algorithms for the quasi-complementarity problems
- An inexact alternating direction method of multipliers for the solution of linear complementarity problems arising from free boundary problems
- A smooth system of equations approach to complementarity problems for frictionless contacts
- Comparison of three classes of algorithms for the solution of the linear complementarity problem with an \(H_+\)-matrix
- Splitting methods for a class of horizontal linear complementarity problems
- Overlapping restricted additive Schwarz method with damping factor for \(H\)-matrix linear complementarity problem
- Modulus-based matrix splitting iteration methods for a class of nonlinear complementarity problem
- Linear complementarity problems on extended second order cones
- On an iterative method for solving absolute value equations
- How to improve MAOR method convergence area for linear complementarity problems
- Convergence of splitting and Newton methods for complementarity problems: An application of some sensitivity results
- Iterations for solving linear variational inequalities on domains with nonlinear boundaries
- Local convergence analysis of projection-type algorithms: unified approach
- Multi-sweep asynchronous parallel successive overrelaxation for the nonsymmetric linear complementarity problem
- On multilevel iterative methods for optimization problems
- Necessary and sufficient conditions for the convergence of iterative methods for the linear complementarity problem
- The adventures of a simple algorithm
- Some recent advances in projection-type methods for variational inequalities
- On linear convergence of iterative methods for the variational inequality problem
- Linearly convergent descent methods for the unconstrained minimization of convex quadratic splines
- A multisplitting method for symmetric linear complementarity problems
- Elastic-plastic unilateral contact problems for slackened systems
- Computer analysis of slackened systems under variable loads
- Generalized equations and the generalized Newton method
- A nonlinear complementarity approach for elastoplastic problems by BEM without internal cells
- Accelerated modulus-based matrix splitting iteration method for a class of nonlinear complementarity problems
- On the equivalence between some projected and modulus-based splitting methods for linear complementarity problems
- MSSOR-based alternating direction method for symmetric positive-definite linear complementarity problems
- Modulus-based matrix splitting methods for a class of horizontal nonlinear complementarity problems
- A modulus-based nonsmooth Newton's method for solving horizontal linear complementarity problems
- A preconditioned general two-step modulus-based accelerated overrelaxation iteration method for nonlinear complementarity problems
- A generalization of the equivalence relations between modulus-based and projected splitting methods
- A relaxation general two-sweep modulus-based matrix splitting iteration method for solving linear complementarity problems
- A class of new modulus-based matrix splitting methods for linear complementarity problem
- Projected splitting methods for vertical linear complementarity problems
- Two new iteration methods with optimal parameters for solving absolute value equations
- Numerical solution of the absolute value equations using two matrix splitting fixed point iteration methods
- Upper norm bounds for the inverse of locally doubly strictly diagonally dominant matrices with its applications in 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 fixed point iterative method for tensor complementarity problems
- The general two-sweep modulus-based matrix splitting iteration method for solving linear complementarity problems
- A rigorous and efficient explicit algorithm for irreversibility enforcement in phase-field finite element modeling of brittle crack propagation
- Further applications of a splitting algorithm to decomposition in variational inequalities and convex programming
- Partially and totally asynchronous algorithms for linear complementarity problems
- A preconditioned general two-step modulus-based matrix splitting iteration method for linear complementarity problems of \(H_+\)-matrices
- A preconditioned multisplitting and Schwarz method for linear complementarity problem
- On the solution of the linear complementarity problem by the generalized accelerated overrelaxation iterative method
- Accelerated modulus-based matrix splitting iteration methods for a restricted class of nonlinear complementarity problems
- A generalized Newton method for non-Hermitian positive definite linear complementarity problem
- On the convergence of iterative methods for symmetric linear complementarity problems
- Generalized AOR methods for linear complementarity problem
- A rapid algorithm for a class of linear complementarity problems
- A decomposition algorithm for solving large-scale quadratic programming problems
- Convergence of accelerated modulus-based matrix splitting iteration methods for linear complementarity problem with an H_+-matrix
- Complementarity problems in semi-inner product spaces
- The nonlinear lopsided HSS-like modulus-based matrix splitting iteration method for linear complementarity problems with positive-definite matrices
- Two-sweep modulus-based matrix splitting iteration methods for linear complementarity problems
This page was built for publication: Solution of symmetric linear complementarity problems by iterative methods
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1231762)
