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