The Analytic Center Cutting Plane Method with Semidefinite Cuts
Mohammad R. Oskoorouchi, Jean‐Louis Goffin · SIAM Journal on Optimization · 2003
We analyze an analytic center cutting plane algorithm for convex feasibility problems with semidefinite cuts. The problem of interest seeks a feasible point in a bounded convex set, which contains a full-dimensional ball with $\varepsilon$ $(0$ is a condition number of the field of cuts.