scientific article; zbMATH DE number 3312380

Cited in

(31)

Bounds for the solution set of linear complementarity problems
Quadratic programming problems and related linear complementarity problems
Positive subdefinite matrices
On the parametric linear complementarity problem: A generalized solution procedure
On the solution of large, structured linear complementarity problems: The tridiagonal case
Algorithmic equivalence in quadratic programming. I. A least-distance programming problem
The linear complementarity problem, sufficient matrices, and the criss- cross method
A new penalty function algorithm for convex quadratic programming
Basic-set algorithm for a generalized linear complementarity problem
An \((m+1)\)-step iterative method of convergence order \((m+2)\) for linear complementarity problems. An \((m+1)\)-step iterative method for LCPs
Total dual integrality of the linear complementarity problem
Almost \(P_ 0\)-matrices and the class \(Q\)
An example of a nonregular semimonotone Q-matrix
Parameterized complexity of sparse linear complementarity problems
Boundedness relations for linear constraint sets
Existence theory for the complex linear complementarity problem
A modified gradient method for finite element elastoplastic analysis by quadratic programming
Solution of the complex linear complementarity problem
A fast algorithm for solving a class of the linear complementarity problem in a finite number of steps
scientific article; zbMATH DE number 4217201 (Why is no real title available?)
Computational complexity of Van der Heyden's variable dimension algorithm and Dantzig-Cottle's principal pivoting method for solving LCP's
A constructive characterization ofQ o-matrices with nonnegative principal minors
Superlinearly convergent quasi-newton algorithms for nonlinearly constrained optimization problems
Superlinearly convergent variable metric algorithms for general nonlinear programming problems
Large-scale linearly constrained optimization
scientific article; zbMATH DE number 1226265 (Why is no real title available?)
The general quadratic optimization problem
Direct algorithms in quadratic programming
An interior-point algorithm for LCP based on a parameterized hyperbolic kernel function
The principal pivoting method revisited
Sign-solvable linear complementarity problems

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5592809)