An Analytic Center Based Column Generation Algorithm for Convex Quadratic Feasibility Problems

DOI10.1137/S1052623495294943zbMATH Open1032.90526MaRDI QIDQ4229488FDOQ4229488

Jie Sun, Zhi-Quan Luo

Publication date: 22 February 1999

Published in: SIAM Journal on Optimization (Search for Journal in Brave)

Recommendations

• An analytic center quadratic cut method for the convex quadratic feasibility problem
• scientific article; zbMATH DE number 679864
• A polynomial cutting surfaces algorithm for the convex feasibility problem defined by self-concordant inequalities

zbMATH Keywords

column generationanalytic centerpotential reductionconvex quadratic feasibility problem

Mathematics Subject Classification ID

Convex programming (90C25) Abstract computational complexity for mathematical programming problems (90C60)

Cited In (11)

• A column generation approach to the discrete barycenter problem
• A second-order cone cutting surface method: Complexity and application
• An analytic center quadratic cut method for the convex quadratic feasibility problem
• Adaptive constraint reduction for convex quadratic programming
• A proximal analytic center cutting plane algorithm for solving variational inequality problems
• Solving variational inequalities defined on a domain with infinitely many linear constraints
• Chebyshev center based column generation
• Homogeneous analytic center cutting plane methods with approximate centers
• Solving the discrete \(l_p\)-approximation problem by a method of centers
• Complexity Analysis of an Interior Cutting Plane Method for Convex Feasibility Problems
• Title not available (Why is that?)

This page was built for publication: An Analytic Center Based Column Generation Algorithm for Convex Quadratic Feasibility Problems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4229488)