×

zbMATH — the first resource for mathematics

Complexity analysis of an interior cutting plane method for convex feasibility problems. (English) Zbl 0856.90088

MSC:
90C25 Convex programming
90C60 Abstract computational complexity for mathematical programming problems
90C26 Nonconvex programming, global optimization
PDF BibTeX XML Cite
Full Text: DOI