An investigation of interior-point and block pivoting algorithms for large-scale symmetric monotone linear complementarity problems
type: Item
instance of: scholarly article
title: An investigation of interior-point and block pivoting algorithms for large-scale symmetric monotone linear complementarity problems
zbMATH Open document ID: 0844.90096
DOI: 10.1007/BF00429751
author: Yanyan Li
published in: Computational Optimization and Applications
publication date: 1996-03-07T00:00:00Z
Mathematics Subject Classification ID: 90C33
Mathematics Subject Classification ID: 90C06
zbMATH DE Number: 852891
zbMATH Keywords: convex quadratic programming
zbMATH Keywords: sparse matrices
zbMATH Keywords: computational study
zbMATH Keywords: block principal pivoting
zbMATH Keywords: interior-point predictor-corrector
zbMATH Keywords: large-scale linear complementarity
zbMATH Keywords: symmetric positive definite matrices
describes a project that uses: symrcm
describes a project that uses: Harwell-Boeing sparse matrix collection
MaRDI profile type: Publication
cites work: Q3690580
cites work: Projected Newton Methods for Optimization Problems with Simple Constraints
cites work: An Estimate for the Condition Number of a Matrix
cites work: A direct active set algorithm for large sparse quadratic programs with simple bounds
cites work: A Globally and Superlinearly Convergent Algorithm for Convex Quadratic Programs with Simple Bbounds
cites work: Global Convergence of a Class of Trust Region Algorithms for Optimization with Simple Bounds
cites work: Q4003375
cites work: Q3740904
cites work: Sparse matrix test problems
cites work: A Class of penalty functions for optimization problema with bound constraints
cites work: Minimization of a Quadratic Function of Many Variables Subject only to Lower and Upper Bounds
cites work: Q3664299
cites work: Parallel and Serial Successive Overrelaxation for Multicommodity Spatial Price Equilibrium Problems
cites work: Q3348711
cites work: Q3477904
cites work: Finite-dimensional variational inequality and nonlinear complementarity problems: A survey of theory, algorithms and applications
cites work: A block principal pivoting algorithm for large-scale strictly monotone linear complementarity problems
cites work: A new polynomial-time algorithm for linear programming
cites work: A unified approach to interior point algorithms for linear complementarity problems: A summary
cites work: Q5608986
cites work: Iterative Methods for Large Convex Quadratic Programs: A Survey
cites work: On Implementing Mehrotra’s Predictor–Corrector Interior-Point Method for Linear Programming
cites work: Equivalence of the Complementarity Problem to a System of Nonlinear Equations
cites work: On the Implementation of a Primal-Dual Interior Point Method
cites work: Infeasible-Interior-Point Primal-Dual Potential-Reduction Algorithms for Linear Programming
cites work: Algorithms for bound constrained quadratic programming problems
cites work: On the Solution of Large Quadratic Programming Problems with Bound Constraints
cites work: Q3993065
cites work: On the solution of some (parametric) linear complementarity problems with applications to portfolio selection, structural engineering and actuarial graduation
cites work: Solution of $P_0 $-Matrix Linear Complementarity Problems Using a potential Reduction Algorithm
cites work: An Investigation of Interior-Point Algorithms for the Linear Transportation Problem
cites work: A class of methods for solving large, convex quadratic programs subject to box constraints
cites work: A class of linear complementarity problems solvable in polynomial time
cites work: On the Convergence of a Class of Infeasible Interior-Point Methods for the Horizontal Linear Complementarity Problem
full work available at URL: https://doi.org/10.1007/bf00429751
OpenAlex ID: W2000229425
description: scientific article; zbMATH DE number 852891