A block principal pivoting algorithm for large-scale strictly monotone linear complementarity problems
From MaRDI portal
Publication:1321811
DOI10.1016/0305-0548(94)90106-6zbMath0802.90106OpenAlexW2048584787MaRDI QIDQ1321811
F. M. Pires, Joaquim Joao Júdice
Publication date: 26 May 1994
Published in: Computers \& Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0305-0548(94)90106-6
Large-scale problems in mathematical programming (90C06) Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming) (90C33)
Related Items
A family of second-order methods for convex \(\ell _1\)-regularized optimization, An investigation of interior-point and block pivoting algorithms for large-scale symmetric monotone linear complementarity problems, The reduced order method for solving the linear complementarity problem with an \(M\)-matrix, A Feasible Active Set Method for Strictly Convex Quadratic Problems with Simple Bounds, Regularization of inverse problems via box constrained minimization, Optimal non-negative forecast reconciliation, Error estimates for the approximation of some unilateral problems, Improved dc programming approaches for solving the quadratic eigenvalue complementarity problem, A sequential partial linearization algorithm for the symmetric eigenvalue complementarity problem, Algorithms for nonnegative matrix and tensor factorizations: a unified view based on block coordinate descent framework, A block principal pivoting algorithm for vertical generalized LCP with a vertical block P-matrix, Splitting methods for the Eigenvalue Complementarity Problem, On the convergence of the block principal pivotal algorithm for the LCP, The block principal pivoting algorithm for the linear complementarity problem with an \(M\)-matrix, An alternating direction method of multipliers for the eigenvalue complementarity problem, A class of mathematical programs with equilibrium constraints: a smooth algorithm and applications to contact problems, Revisiting augmented Lagrangian duals
Cites Work
- A direct active set algorithm for large sparse quadratic programs with simple bounds
- Finite-dimensional variational inequality and nonlinear complementarity problems: A survey of theory, algorithms and applications
- A polynomial-time algorithm for a class of linear complementarity problems
- A generalized conjugate gradient algorithm for solving a class of quadratic programming problems
- A unified approach to interior point algorithms for linear complementarity problems: A summary
- Block pivot methods for solving the complementarity problem
- Basic-set algorithm for a generalized linear complementarity problem
- Sparse matrix test problems
- Bard-type Methods for the Linear Complementarity problem with symmetric positive Definite Matrices
- A parametric linear complementarity technique for the computation of equilibrium prices in a single commodity spatial model
- A New and Efficient Algorithm for a Class of Portfolio Selection Problems
- On the Solution of Large Quadratic Programming Problems with Bound Constraints
- Minimization of a Quadratic Function of Many Variables Subject only to Lower and Upper Bounds
- On a class of least-element complementarity problems
- On the solution of some (parametric) linear complementarity problems with applications to portfolio selection, structural engineering and actuarial graduation
- The general quadratic optimization problem
- Iterative methods for linear complementarity problems with upperbounds on primary variables
- Application of disjunctive programming to the linear complementarity problem
- A Principal Pivoting Simplex Algorithm for Linear and Quadratic Programming
- The Solution of a Quadratic Programming Problem Using Systematic Overrelaxation
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
