Towards a strongly polynomial algorithm for strictly convex quadratic programs: An extension of Tardos' algorithm

DOI10.1007/BF01585740zbMath0694.90075MaRDI QIDQ909582

Jadranka Skorin-Kapov, Frieda Granot

Publication date: 1990

Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)

zbMATH Keywords

convex quadratic programmingpolynomially bounded algorithm

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Convex programming (90C25) Quadratic programming (90C20)

Related Items

A strongly polynomial algorithm for minimum convex separable quadratic cost flow problems on two-terminal series-parallel networks, On a quadratic programming problem involving distances in trees, On solving a non-convex quadratic programming problem involving resistance distances in graphs, On polynomial solvability of the high multiplicity total weighted tardiness problem, A Strongly Polynomial Algorithm for a Class of Minimum-Cost Flow Problems with Separable Convex Objectives, On simultaneous approximation in quadratic integer programming

Cites Work

• Unnamed Item
• Unnamed Item
• A polynomial algorithm for minimum quadratic cost flow problems
• Geometric algorithms and combinatorial optimization
• A Strongly Polynomial Algorithm to Solve Combinatorial Linear Programs
• Duality in quadratic programming
• A polynomially bounded algorithm for a singly constrained quadratic program
• An Effective Subgradient Procedure for Minimal Cost Multicommodity Flow Problems
• Dualität und Approximation bei konvexen Optimierungsproblemen
• Validation of subgradient optimization
• Symmetric dual quadratic programs
• Systems of distinct representatives and linear algebra
• On Quadratic Programming