## Abstract

We give a simple and natural method for computing approximately optimal solutions for minimizing a convex function f over a convex set K given by a separation oracle. Our method utilizes the Frank–Wolfe algorithm over the cone of valid inequalities of K and subgradients of f. Under the assumption that f is L-Lipschitz and that K contains a ball of radius r and is contained inside the origin centered ball of radius R, using O((RL)2ε2·R2r2) iterations and calls to the oracle, our main method outputs a point x∈ K satisfying f(x) ≤ ε+ min
_{z}
_{∈}
_{K}f(z) . Our algorithm is easy to implement, and we believe it can serve as a useful alternative to existing cutting plane methods. As evidence towards this, we show that it compares favorably in terms of iteration counts to the standard LP based cutting plane method and the analytic center cutting plane method, on a testbed of combinatorial, semidefinite and machine learning instances.

Original language | English |
---|---|

Pages (from-to) | 283-304 |

Number of pages | 22 |

Journal | Mathematical Programming |

Volume | 206 |

Issue number | 1-2 |

Early online date | 10 Aug 2023 |

DOIs | |

Publication status | Published - Jul 2024 |

## Keywords

- Convex optimization
- Cutting plane method
- Separation oracle
- 90C25
- 90C05