Approximating parameterized convex optimization problems
Approximating parameterized convex optimization problems
We consider parameterized convex optimization problems over the unit simplex, that depend on one parameter. We provide a simple and efficient scheme for maintaining an ϵ-approximate solution (and a corresponding ϵ-coreset) along the entire parameter path. We prove correctness and optimality of the method. Practically relevant instances of the abstract …