An \(O(n^ 2)\) active set method for solving a certain parametric quadratic program

DOI10.1007/BF00940516zbMath0793.90046MaRDI QIDQ1321144

Nilotpal Chakravarti, Michael J. Best

Publication date: 27 April 1994

Published in: Journal of Optimization Theory and Applications (Search for Journal in Brave)

zbMATH Keywords

active set methodsparametric quadratic programstrong polynomialitytax programming

Mathematics Subject Classification ID

Abstract computational complexity for mathematical programming problems (90C60) Quadratic programming (90C20) Sensitivity, stability, parametric optimization (90C31)

Related Items (2)

A sequential method for a class of box constrained quadratic programming problems ⋮ Active set algorithms for isotonic regression; a unifying framework

Cites Work

• Unnamed Item
• Unnamed Item
• Active set algorithms for isotonic regression; a unifying framework
• An O(n) algorithm for quadratic knapsack problems
• A compact formulation of an elastoplastic analysis problem
• Equivalence of some quadratic programming algorithms
• Technical Note—A Polynomial Simplex Method for the Assignment Problem
• A competitive (dual) simplex method for the assignment problem
• A polynomially bounded algorithm for a singly constrained quadratic program

This page was built for publication: An \(O(n^ 2)\) active set method for solving a certain parametric quadratic program