An Analytic Center Based Column Generation Algorithm for Convex Quadratic Feasibility Problems
From MaRDI portal
Publication:4229488
DOI10.1137/S1052623495294943zbMath1032.90526MaRDI QIDQ4229488
Publication date: 22 February 1999
Published in: SIAM Journal on Optimization (Search for Journal in Brave)
Convex programming (90C25) Abstract computational complexity for mathematical programming problems (90C60)
Related Items
A second-order cone cutting surface method: Complexity and application ⋮ Solving variational inequalities defined on a domain with infinitely many linear constraints ⋮ Adaptive constraint reduction for convex quadratic programming ⋮ A proximal analytic center cutting plane algorithm for solving variational inequality problems ⋮ Solving the discrete \(l_p\)-approximation problem by a method of centers ⋮ Homogeneous analytic center cutting plane methods with approximate centers
This page was built for publication: An Analytic Center Based Column Generation Algorithm for Convex Quadratic Feasibility Problems
