More results on the convergence of iterative methods for the symmetric linear complementarity problem
From MaRDI portal
Publication:1061019
DOI10.1007/BF00939250zbMath0568.90096MaRDI QIDQ1061019
Publication date: 1986
Published in: Journal of Optimization Theory and Applications (Search for Journal in Brave)
convergenceiterative methodsmatrix splittingstrictly convex quadratic programsymmetric linear complementarity
Numerical mathematical programming methods (65K05) Convex programming (90C25) Quadratic programming (90C20) Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming) (90C33)
Related Items
Asymmetric variational inequality problems over product sets: Applications and iterative methods, On the solution of a two ball trust region subproblem, On the convergence of iterative methods for symmetric linear complementarity problems, Error bounds for inconsistent linear inequalities and programs, On linear convergence of iterative methods for the variational inequality problem, Linearly convergent descent methods for the unconstrained minimization of convex quadratic splines, Implementing proximal point methods for linear programming, A new characterization of real H-matrices with positive diagonals, Decomposition algorithm for convex differentiable minimization, On a global error bound for a class of monotone affine variational inequality problems, Algorithms for quadratic constrained matrix problems, Two-stage parallel iterative methods for the symmetric linear complementarity problem, A splitting method for quadratic programming problem, Convergence of splitting and Newton methods for complementarity problems: An application of some sensitivity results, Hidden Z-matrices with positive principal minors, On the convergence properties of Hildreth's quadratic programming algorithm, Inexact Newton methods for the nonlinear complementarity problem, Error bounds and convergence analysis of feasible descent methods: A general approach, The adventures of a simple algorithm, Descent methods for convex essentially smooth minimization
Cites Work
- Sparsity-preserving SOR algorithms for separable quadratic and linear programming
- On the convergence of a basic iterative method for the implicit complementarity problem
- Solution of symmetric linear complementarity problems by iterative methods
- Necessary and sufficient conditions for the convergence of iterative methods for the linear complementarity problem
- Complementary pivot theory of mathematical programming
- On the number of solutions to the complementarity problem and spanning properties of complementary cones
- Some continuity properties of polyhedral multifunctions
- On the convergence of a block successive over-relaxation method for a class of linear complementarity problems
- A dual differentiable exact penalty function
- Quasi-Newton Methods, Motivation and Theory
- Augmented Lagrangians and Applications of the Proximal Point Algorithm in Convex Programming
- State Constraints in Convex Control Problems of Bolza
- On the basic theorem of complementarity
- On Quadratic Programming
- Unnamed Item
- Unnamed Item
