scientific article; zbMATH DE number 3718852

MaRDI QIDQ3908771zbMATH OpenFDO

Authors Mark S. Goheen, R. W. Cottle

Publication date 1978

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)

Cited in

(13)

• 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
• Hidden Z-matrices with positive principal minors
• Iterative methods for variational and complementarity problems
• On a class of least-element complementarity problems
• Iterative methods for linear complementarity problems with upperbounds on primary variables
• On cone orderings and the linear complementarity 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 Q3908771)