A polynomial cutting surfaces algorithm for the convex feasibility problem defined by self-concordant inequalities

DOI10.1023/A:1008787027641zbMath0947.90128OpenAlexW1525133469MaRDI QIDQ1567481

Jie Sun, Zhi-Quan Luo

Publication date: 30 October 2000

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

Full work available at URL: https://doi.org/10.1023/a:1008787027641

zbMATH Keywords

column generationanalytic centerconvex feasibility problempotential reduction

Mathematics Subject Classification ID

Convex programming (90C25) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) 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 ⋮ Learning lyapunov functions for hybrid systems ⋮ An extension of Chubanov's algorithm to symmetric cones ⋮ Solving the discrete \(l_p\)-approximation problem by a method of centers