scientific article; zbMATH DE number 1985308

MaRDI QIDQ4429172zbMATH OpenFDO

Authors Faranak Sharifi Mokhtarian

Publication date 24 September 2003

Mathematics Subject Classification ID

Convex programming (90C25) Approximation methods and heuristics in mathematical programming (90C59)

Recommendations

• A note on some analytic center cutting plane methods for convex feasibility and minimization problems
• Complexity Analysis of an Interior Cutting Plane Method for Convex Feasibility Problems
• A Nonlinear Analytic Center Cutting Plane Method for a Class of Convex Programming Problems
• A cutting plane algorithm for convex programming that uses analytic centers
• scientific article; zbMATH DE number 679864

Cited in

(1)

• Equivalence of Convex Problem Geometry and Computational Complexity in the Separation Oracle Model

This page was built for publication:

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