Convergence of splitting and Newton methods for complementarity problems: An application of some sensitivity results
From MaRDI portal
Publication:1803603
DOI10.1007/BF01581264zbMath0784.90089OpenAlexW2066076004MaRDI QIDQ1803603
Publication date: 29 June 1993
Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf01581264
convergencelinear complementarityNewton's methodperturbationmatrix splitting methodsmatrix classesnonlinear complementaritysolution stabilitylocally upper Lipschitzian
Variational inequalities (49J40) Sensitivity, stability, parametric optimization (90C31) Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming) (90C33)
Related Items
Matrix Multisplitting Methods with Applications to Linear Complementarity Problems∶ Parallel Asynchronous Methods, Critical multipliers in variational systems via second-order generalized differentiation, Multisplitting iteration schemes for solving a class of nonlinear complementarity problems, Matrix multisplitting relaxation methods for linear complementarity problems, NE/SQP: A robust algorithm for the nonlinear complementarity problem, A degree-theoretic approach to parametric nonsmooth equations with multivalued perturbed solution sets
Cites Work
- Unnamed Item
- Finite-dimensional variational inequality and nonlinear complementarity problems: A survey of theory, algorithms and applications
- More results on the convergence of iterative methods for the symmetric linear complementarity problem
- On the convergence of a basic iterative method for the implicit complementarity problem
- Solution of symmetric linear complementarity problems by iterative methods
- Solution differentiability and continuation of Newton's method for variational inequality problems over polyhedral sets
- Necessary and sufficient conditions for the convergence of iterative methods for the linear complementarity problem
- Iterative Methods for Large Convex Quadratic Programs: A Survey
- On the stability of solutions in honlinear programming
- On the Convergence of a Matrix Splitting Algorithm for the Symmetric Monotone Linear Complementarity Problem
- Strongly Regular Generalized Equations
- Locally unique solutions of quadratic programs, linear and nonlinear complementarity problems
- Some continuity properties of polyhedral multifunctions
- On the Linear Convergence of Descent Methods for Convex Essentially Smooth Minimization
- On Solution Stability of the Linear Complementarity Problem
- Convergence of Iterates of an Inexact Matrix Splitting Algorithm for the Symmetric Monotone Linear Complementarity Problem
- Error Bound and Convergence Analysis of Matrix Splitting Algorithms for the Affine Variational Inequality Problem
- Lipschitz Continuity of Solutions of Linear Inequalities, Programs and Complementarity Problems
- Stability of the linear complementarity problem at a solution point
- Convergence Properties of Iterative Methods for Symmetric Positive Semidefinite Linear Complementarity Problems
- A Lipschitzian Characterization of Convex Polyhedra
