On the convergence of a basic iterative method for the implicit complementarity problem
From MaRDI portal
Publication:1162935
DOI10.1007/BF00934765zbMath0482.90084OpenAlexW2011026819MaRDI QIDQ1162935
Publication date: 1982
Published in: Journal of Optimization Theory and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf00934765
convergenceiterative algorithmlinear complementarity problemexistence of solutionuniqueness of solutionimplicit complementarity problemsuccessive over- relaxation
Related Items
Matrix Multisplitting Methods with Applications to Linear Complementarity Problems∶ Parallel Asynchronous Methods, Some recent advances in projection-type methods for variational inequalities, Iterative methods for variational and complementarity problems, New trends in general variational inequalities, Sparsity-preserving SOR algorithms for separable quadratic and linear programming, Projected splitting methods for vertical linear complementarity problems, An LP-based successive overrelaxation method for linear complementarity problems, The convergence of modulus-based matrix splitting iteration methods for implicit complementarity problems, Inexact multisplitting methods for linear complementarity problems, Modified relaxation two-sweep modulus-based matrix splitting iteration method for solving a class of implicit complementarity problems, Complementarity problems in semi-inner product spaces, On linear convergence of iterative methods for the variational inequality problem, The quasi-complementarity problem, Perturbed proximal point algorithms for generalized quasivariational inclusions, Iterative methods for a class of complementarity problems, Fixed point approach for complementarity problems, A modified damped Newton method for linear complementarity problems, An inexact alternating direction method of multipliers for the solution of linear complementarity problems arising from free boundary problems, A modulus-based formulation for the vertical linear complementarity problem, New modulus-based matrix splitting methods for implicit complementarity problem, Asynchronous parallel successive overrelaxation for the symmetric linear complementarity problem, Parallel Newton methods for the nonlinear complementarity problem, Multisplitting iteration schemes for solving a class of nonlinear complementarity problems, On the generalized implicit quasivariational inequalities, Superlinearly convergent methods for solving a class of implicit complementarity problems based on sign analysis, Accelerating iterative algorithms for symmetric linear complementarity problems, A new characterization of real H-matrices with positive diagonals, Modulus-based inexact non-alternating preconditioned splitting method for linear complementarity problems, Convergence analysis of modulus-based matrix splitting iterative methods for implicit complementarity problems, Modulus-based matrix splitting iteration methods for a class of implicit complementarity problems, A locally convergent inexact projected Levenberg-Marquardt-type algorithm for large-scale constrained nonsmooth equations, On optimization of systems governed by implicit complementarity problems*, Newton-type methods for solving quasi-complementarity problems via sign-based equation, A fixed point iterative method for tensor complementarity problems with the implicit \(Z\)-tensors, A nonsmooth Newton method for solving the generalized complementarity problem, Quadratic programming with M-matrices, Iterative algorithms for semi-linear quasi-complementarity problems, Matrix multisplitting relaxation methods for linear complementarity problems, The convergence of a modulus-based matrix splitting iteration method for solving the implicit complementarity problems, The boundary element-linear complementarity method for the Signorini problem, Iterative algorithms for the linear complementarity problem, Solving quasi-variational inequalities via their KKT conditions, On a class of generalized nonlinear implicit quasivariational inclusions, On the linear convergence of the approximate proximal splitting method for non-smooth convex optimization, Projected successive overrelaxation method for finite-element solutions to the Dirichlet problem for a system of nonlinear elliptic equations, The semismooth Newton method for the solution of quasi-variational inequalities, A modified modulus method for symmetric positive-definite linear complementarity problems, A Modulus Iteration Method for SPSD Linear Complementarity Problem Arising in Image Retinex, Two-stage parallel iterative methods for the symmetric linear complementarity problem, Abstract variational inequality problems and a basic theorem of complementarity, Two-step modulus-based matrix splitting iteration method for linear complementarity problems, A note on the implementation of the successive overrelaxation method for linear complementarity problems, Generalized strongly nonlinear quasi-complementarity problems in Hilbert spaces, Generalized strongly nonlinear quasi-complementarity problems in Hilbert spaces, Two-step modulus-based matrix splitting iteration methods for implicit complementarity problems, On the modulus algorithm for the linear complementarity problem., A modified modulus-based matrix splitting iteration method for solving implicit complementarity problems, Monotonicity of Mangasarian's iterative algorithm for generalized linear complementarity problems, Shifted skew-symmetric iteration methods for nonsymmetric linear complementarity problems, Convergence of splitting and Newton methods for complementarity problems: An application of some sensitivity results, Hidden Z-matrices with positive principal minors, A class of two-step modulus-based matrix splitting iteration methods for quasi-complementarity problems, Local convergence analysis of projection-type algorithms: unified approach, Modulus-based matrix splitting iteration methods for linear complementarity problems, On cone orderings and the linear complementarity problem, An unconstrained differentiable penalty method for implicit complementarity problems, Necessary and sufficient conditions for the convergence of iterative methods for the linear complementarity problem, The implicit general order complementarity problem, models and iterative methods, More results on the convergence of iterative methods for the symmetric linear complementarity problem, A generalized two-step modulus-based matrix splitting iteration method for implicit complementarity problems of H+-matrices, Error bounds and convergence analysis of feasible descent methods: A general approach, Some aspects of variational inequalities, A multi-grid method for variational inequalities in contact problems, An alternating direction implicit algorithm for the solution of linear complementarity problems arising from free boundary problems, Finite-dimensional variational inequality and nonlinear complementarity problems: A survey of theory, algorithms and applications
Cites Work
- On cone orderings and the linear complementarity problem
- Solution of nonsymmetric, linear complementarity problems by iterative methods
- On recurring theorems on diagonal dominance
- Solution of symmetric linear complementarity problems by iterative methods
- M-matrix characterizations. I: nonsingular M-matrices
- On the solution of large, structured linear complementarity problems: the block partitioned case
- The Solution of a Quadratic Programming Problem Using Systematic Overrelaxation
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item