A decomposition algorithm for quadratic programming
From MaRDI portal
Publication:3870676
DOI10.1007/BF01588293zbMath0432.90061MaRDI QIDQ3870676
Publication date: 1980
Published in: Mathematical Programming (Search for Journal in Brave)
computational experience; comparison of algorithms; pivot algorithm; decomposition algorithm; Lemke's method; unbounded feasible region; finiteness of the algorithm
65K05: Numerical mathematical programming methods
90C20: Quadratic programming
68Q60: Specification and verification (program logics, model checking, etc.)
Related Items
Parametric Computation of Minimum-Cost Flows with Piecewise Quadratic Costs, Algorithm 431, The problem of projecting the origin of Euclidean space onto the convex polyhedron, An equivalence between two algorithms for quadratic programming, A variable dimension algorithm with the Dantzig-Wolfe decomposition for structured stationary point problems
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