Complexity analysis for certain convex programming problems

DOI10.1006/jcom.1999.0500zbMath0952.90033OpenAlexW2009774833MaRDI QIDQ1974569

Marie-Cécile Darracq

Publication date: 7 May 2000

Published in: Journal of Complexity (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1006/jcom.1999.0500

zbMATH Keywords

complexitybarrier methodconvex programmingSmale's alpha-theory

Mathematics Subject Classification ID

Convex programming (90C25) Complexity and performance of numerical algorithms (65Y20)

Cites Work

• An interior point algorithm of O\((\sqrt m| \ln\varepsilon |)\) iterations for \(C^ 1\)-convex programming
• Unified complexity analysis for Newton LP methods
• On the convergence of the method of analytic centers when applied to convex quadratic programs
• Complexity of Bezout's Theorem I: Geometric Aspects
• Unnamed Item
• Unnamed Item

This page was built for publication: Complexity analysis for certain convex programming problems