scientific article; zbMATH DE number 3312380

zbMath0196.22902MaRDI QIDQ5592809

Richard W. Cottle

Publication date: 1968

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

Kuhn-Tucker conditions

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Quadratic programming (90C20)

Related Items (28)

Bounds for the solution set of linear complementarity problems ⋮ A fast algorithm for solving a class of the linear complementarity problem in a finite number of steps ⋮ Quadratic programming problems and related linear complementarity problems ⋮ Parameterized complexity of sparse linear complementarity problems ⋮ A constructive characterization ofQ o-matrices with nonnegative principal minors ⋮ An \((m+1)\)-step iterative method of convergence order \((m+2)\) for linear complementarity problems. An \((m+1)\)-step iterative method for LCPs ⋮ Positive subdefinite matrices ⋮ On the parametric linear complementarity problem: A generalized solution procedure ⋮ Direct algorithms in quadratic programming ⋮ Sign-solvable linear complementarity problems ⋮ Total dual integrality of the linear complementarity problem ⋮ The general quadratic optimization problem ⋮ 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 ⋮ On the solution of large, structured linear complementarity problems: The tridiagonal case ⋮ Algorithmic equivalence in quadratic programming. I. A least-distance programming problem ⋮ Almost \(P_ 0\)-matrices and the class \(Q\) ⋮ The linear complementarity problem, sufficient matrices, and the criss- cross method ⋮ The principal pivoting method revisited ⋮ Boundedness relations for linear constraint sets ⋮ Existence theory for the complex linear complementarity problem ⋮ A new penalty function algorithm for convex quadratic programming ⋮ An example of a nonregular semimonotone \(Q\)-matrix ⋮ A modified gradient method for finite element elastoplastic analysis by quadratic programming ⋮ Computational complexity of Van der Heyden's variable dimension algorithm and Dantzig-Cottle's principal pivoting method for solving LCP's ⋮ Solution of the complex linear complementarity problem ⋮ Basic-set algorithm for a generalized linear complementarity problem

This page was built for publication: