An algorithm for the fast solution of symmetric linear complementarity problems

DOI10.1007/s00211-008-0183-5zbMath1157.65389OpenAlexW2138272465MaRDI QIDQ998634

José Luis Morales, Mikhail Smelyanskiy, Nocedal, Jorge

Publication date: 9 February 2009

Published in: Numerische Mathematik (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00211-008-0183-5

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05)

Related Items

Using a meshless kernel-based method to solve the Black-Scholes variational inequality of American options, A Gauss-Seidel type solver for the fast computation of input-constrained control systems, A framework for multivariable algebraic loops in linear anti-windup implementations, Using spectral element method to solve variational inequalities with applications in finance, An RLT approach for solving the binary-constrained mixed linear complementarity problem, Parallel two-grid semismooth Newton-Krylov-Schwarz method for nonlinear complementarity problems, On the solution of complementarity problems arising in American options pricing, A Krylov Subspace Method for Large-Scale Second-Order Cone Linear Complementarity Problem, Fundamental Domains for Symmetric Optimization: Construction and Search

Uses Software

• LANCELOT
• PARDISO
• SPG
• L-BFGS-B
• L-BFGS
• TRON
• Open Dynamics Engine
• COPS

Cites Work

• Unnamed Item
• Unnamed Item
• On fast factorization pivoting methods for sparse symmetric indefinite systems
• A generalized conjugate gradient algorithm for solving a class of quadratic programming problems
• An iterative two-step algorithm for linear complementarity problems
• Formulating dynamic multi-rigid-body contact problems with friction as solvable linear complementarity problems
• Efficient sparse LU factorization with left-right looking strategy on shared memory multiprocessors
• Projected Barzilai-Borwein methods for large-scale box-constrained quadratic programming
• Large-scale active-set box-constrained optimization method with spectral projected gradients
• Complementary pivot theory of mathematical programming
• A New Active Set Algorithm for Box Constrained Optimization
• Global Convergence of a Class of Trust Region Algorithms for Optimization with Simple Bounds
• On the Identification of Active Constraints
• On the Solution of Large Quadratic Programming Problems with Bound Constraints
• Algorithm 778: L-BFGS-B
• Engineering and Economic Applications of Complementarity Problems
• Nonmonotone Spectral Projected Gradient Methods on Convex Sets
• Limited memory solution of bound constrained convex quadratic problems arising in video games
• Newton's Method for Large Bound-Constrained Optimization Problems
• Projected Newton Methods for Optimization Problems with Simple Constraints
• Algorithm 813