Solution of symmetric linear complementarity problems by iterative methods

DOI10.1007/BF01268170zbMath0341.65049OpenAlexW2078271509MaRDI QIDQ1231762

Olvi L. Mangasarian

Publication date: 1977

Published in: Journal of Optimization Theory and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf01268170

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Linear programming (90C05)

Related Items (only showing first 100 items - show all)

Matrix Multisplitting Methods with Applications to Linear Complementarity Problems∶ Parallel Asynchronous Methods ⋮ Accelerated modulus-based matrix splitting iteration methods for a restricted class of nonlinear complementarity problems ⋮ Iterative methods for variational and 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 class of new modulus-based matrix splitting methods for linear complementarity problem ⋮ Projected splitting methods for vertical linear complementarity problems ⋮ A GENERALIZED VARIABLE FORMULATION FOR GRADIENT DEPENDENT SOFTENING PLASTICITY ⋮ Two-Step Modulus-Based Synchronous Multisplitting Iteration Methods for Nonlinear Complementarity Problems ⋮ Complementarity problems in semi-inner product spaces ⋮ 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 Fast NCP Solver for Large Rigid-Body Problems with Contacts, Friction, and Joints ⋮ 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 ⋮ Accelerating iterative algorithms for symmetric linear complementarity problems ⋮ The nonlinear lopsided HSS-like modulus-based matrix splitting iteration method for linear complementarity problems with positive-definite matrices ⋮ Modulus-based inexact non-alternating preconditioned splitting method for linear complementarity problems ⋮ Unnamed Item ⋮ More on matrix splitting modulus-based iterative methods for solving linear complementarity problem ⋮ A concise review of small-strain phase-field modeling of ductile fracture ⋮ Modulus-based matrix splitting iteration methods for a class of implicit complementarity problems ⋮ A small deformations effective stress model of gradient plasticity phase-field fracture ⋮ Convergence analysis of projected SOR iteration method for a class of vertical linear complementarity problems ⋮ The new iteration methods for solving absolute value equations. ⋮ A fixed point iterative method for tensor complementarity problems with the implicit \(Z\)-tensors ⋮ A fixed point iterative method for tensor complementarity problems ⋮ A finite algorithm for the least two-norm solution of a linear program¹ ⋮ Solving tensor complementarity problems with \(Z\)-tensors via a weighted fixed point method ⋮ The general two-sweep modulus-based matrix splitting iteration method for solving linear complementarity problems ⋮ Matrix multisplitting relaxation methods for linear complementarity problems ⋮ A CLASS OF MULTI-PARAMETER RELAXED PARALLEL MULTISPLITTING METHODS FOR LARGE SPARSE LINEAR COMPLEMENTARITY PROBLEMS ⋮ Iterative algorithms for the linear complementarity problem ⋮ A modified modulus method for symmetric positive-definite linear complementarity problems ⋮ A Modulus Iteration Method for SPSD Linear Complementarity Problem Arising in Image Retinex ⋮ A New Preconditioned Generalised AOR Method for the Linear Complementarity Problem Based on a Generalised Hadjidimos Preconditioner ⋮ Newton's method for linear complementarity problems ⋮ A rigorous and efficient explicit algorithm for irreversibility enforcement in phase-field finite element modeling of brittle crack propagation ⋮ Foreword: special issue for the 70th birthday of professor Olvi Mangasarian ⋮ A decomposition algorithm for solving large-scale quadratic programming problems ⋮ A splitting method for quadratic programming problem ⋮ Further applications of a splitting algorithm to decomposition in variational inequalities and convex programming ⋮ Partially and totally asynchronous algorithms for linear complementarity problems ⋮ Bi-criteria optimal control of redundant robot manipulators using LVI-based primal-dual neural network ⋮ Improvements of some projection methods for monotone nonlinear variational inequalities ⋮ Convergence of accelerated modulus-based matrix splitting iteration methods for linear complementarity problem with an \(H_+\)-matrix ⋮ Shifted skew-symmetric iteration methods for nonsymmetric linear complementarity problems ⋮ A modulus-based nonsmooth Newton's method for solving horizontal linear complementarity problems ⋮ A note on the MSMAOR method for linear complementarity problems ⋮ The improved convergence of MSMMAOR method for linear complementarity problems ⋮ A note on the unique solution of linear complementarity problem ⋮ Modulus-based matrix splitting iteration methods for linear complementarity problems ⋮ The modulus-based matrix splitting algorithms for a class of weakly nonlinear 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 ⋮ Iterative methods for linear complementarity problems with upperbounds on primary variables ⋮ 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 ⋮ A fast learning algorithm for training feedforward neural networks ⋮ On the solution of the linear complementarity problem by the generalized accelerated overrelaxation iterative method ⋮ A relaxation general two-sweep modulus-based matrix splitting iteration method for solving linear complementarity problems ⋮ Random test problems and parallel methods for quadratic programs and quadratic stochastic programs^∗ ⋮ The solution of the absolute value equations using two generalized accelerated overrelaxation methods ⋮ A dual differentiable exact penalty function ⋮ Some recent advances in projection-type methods for variational inequalities ⋮ Two-sweep modulus-based matrix splitting iteration methods for linear complementarity problems ⋮ Parallel successive overrelaxation methods for symmetric linear complementarity problems and linear programs ⋮ On the preconditioned GAOR method for a linear complementarity problem with an \(M\)-matrix ⋮ On the solution of a two ball trust region subproblem ⋮ Improved convergence theorems of multisplitting methods for the linear complementarity problem ⋮ Sparsity-preserving SOR algorithms for separable quadratic and linear programming ⋮ A two-stage successive overrelaxation algorithm for solving the symmetric linear complementarity problem ⋮ Convergence of SSOR methods for linear complementarity problems ⋮ A new method for a class of linear variational inequalities ⋮ 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 ⋮ On linear convergence of iterative methods for the variational inequality problem ⋮ 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 ⋮ Modulus-based matrix splitting algorithms for the quasi-complementarity problems ⋮ A modified damped Newton method for linear complementarity problems ⋮ Linearly convergent descent methods for the unconstrained minimization of convex quadratic splines ⋮ An inexact alternating direction method of multipliers for the solution of linear complementarity problems arising from free boundary problems ⋮ The solution of the linear complementarity problem by the matrix analogue of the accelerated overrelaxation iterative method ⋮ Least-norm linear programming solution as an unconstrained minimization problem ⋮ Asynchronous parallel successive overrelaxation for the symmetric linear complementarity problem ⋮ Pairwise reactive SOR algorithm for quadratic programming of net import spatial equilibrium models ⋮ A smooth system of equations approach to complementarity problems for frictionless contacts ⋮ 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

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On recurring theorems on diagonal dominance
• Complementary pivot theory of mathematical programming
• On the number of solutions to the complementarity problem and spanning properties of complementary cones
• Methodes de Decomposition pour la Minimisation d’une Fonction sur un Espace Produit
• Linear complementarity problems solvable by A single linear program
• The Solution of a Quadratic Programming Problem Using Systematic Overrelaxation
• 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

This page was built for publication: Solution of symmetric linear complementarity problems by iterative methods