Complexity analysis for certain convex programming problems

DOI10.1006/JCOM.1999.0500MaRDI QIDQ1974569zbMATH OpenOpenAlexFDO

Authors 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

complexityconvex programmingbarrier methodSmale's alpha-theory

Mathematics Subject Classification ID

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

Recommendations

• A Polynomial Barrier Algorithm for Linearly Constrained Convex Programming Problems
• On the classical logarithmic barrier function method for a class of smooth convex programming problems
• An interior point algorithm of O\((\sqrt m| \ln\varepsilon |)\) iterations for \(C^ 1\)-convex programming
• Global ellipsoidal approximations and homotopy methods for solving convex analytic programs

Cites work

• scientific article; zbMATH DE number 729680 (Why is no real title available?)
• scientific article; zbMATH DE number 3992817 (Why is no real title available?)
• An interior point algorithm of O\((\sqrt m| \ln\varepsilon |)\) iterations for \(C^ 1\)-convex programming
• Complexity of Bezout's Theorem I: Geometric Aspects
• On the convergence of the method of analytic centers when applied to convex quadratic programs
• Unified complexity analysis for Newton LP methods

Cited in

(14)

• Simpliciality of strongly convex problems
• Complexity estimation for an algorithm of searching for zero of a piecewise linear convex function
• On complexity of the translational-cut algorithm for convex minimax problems
• Unified complexity analysis for Newton LP methods
• scientific article; zbMATH DE number 1146109 (Why is no real title available?)
• On the complexity of equalizing inequalities
• Global ellipsoidal approximations and homotopy methods for solving convex analytic programs
• On the Complexity of Computing Estimates of Condition Measures of a Conic Linear System
• scientific article; zbMATH DE number 1528596 (Why is no real title available?)
• Equivalence of Convex Problem Geometry and Computational Complexity in the Separation Oracle Model
• Complexity of convex optimization using geometry-based measures and a reference point
• scientific article; zbMATH DE number 519872 (Why is no real title available?)
• On the complexity of optimization over the standard simplex
• scientific article; zbMATH DE number 5799870 (Why is no real title available?)

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

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