A decomposition algorithm for quadratic programming

DOI10.1007/BF01588293zbMath0432.90061MaRDI QIDQ3870676

Richard S. Sacher

Publication date: 1980

Published in: Mathematical Programming (Search for Journal in Brave)

zbMATH Keywords

computational experiencecomparison of algorithmspivot algorithmdecomposition algorithmLemke's methodunbounded feasible regionfiniteness of the algorithm

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Quadratic programming (90C20) Specification and verification (program logics, model checking, etc.) (68Q60)

Related Items (5)

A variable dimension algorithm with the Dantzig-Wolfe decomposition for structured stationary point problems ⋮ Parametric Computation of Minimum-Cost Flows with Piecewise Quadratic Costs ⋮ The problem of projecting the origin of Euclidean space onto the convex polyhedron ⋮ An equivalence between two algorithms for quadratic programming ⋮ Algorithm 431

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Complementary pivot theory of mathematical programming
• Decomposition Principle for Linear Programs
• Optimal Routing in a Packet-Switched Computer Network
• A finite algorithm to maximize certain pseudoconcave functions on polytopes
• Simplicial decomposition in nonlinear programming algorithms
• Robust implementation of Lemke's method for the linear complementarity problem
• An extension of the frank and Wolfe method of feasible directions
• Über den Aufwand zur Lösung quadratischer Optimierungsprobleme mit den Algorithmen von Beale und von Lemke
• Convex Analysis
• Elements of Large-Scale Mathematical Programming Part I: Concepts

This page was built for publication: A decomposition algorithm for quadratic programming