scientific article

zbMath0458.90049MaRDI QIDQ3908771

Mark S. Goheen, Richard W. Cottle

Publication date: 1978

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

zbMATH Keywords

algorithmscomputational experienceKuhn-Tucker theorynonpositive mixed partial derivativessimply structured quadratic programsstrictly convex minimandsthousands of variablesupper and lower bounds on variablesvery large size

Mathematics Subject Classification ID

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

Related Items (13)

Iterative methods for variational and complementarity problems ⋮ Algorithms for bound constrained quadratic programming problems ⋮ A new characterization of real H-matrices with positive diagonals ⋮ Some n by dn linear complementarity problems ⋮ Quadratic programming with M-matrices ⋮ A generalized conjugate gradient algorithm for solving a class of quadratic programming problems ⋮ On the convergence of a basic iterative method for the implicit complementarity problem ⋮ Solving some optimal control problems using the barrier penalty function method ⋮ Elastoplastic torsion by quadratic programming ⋮ On a class of least-element complementarity problems ⋮ Hidden Z-matrices with positive principal minors ⋮ On cone orderings and the linear complementarity problem ⋮ Iterative methods for linear complementarity problems with upperbounds on primary variables

This page was built for publication: