Oct 22, 2013 · We propose restricted memory level bundle methods for minimizing constrained convex nonsmooth optimization problems whose objective and constraint functions ...

We propose restricted memory level bundle methods for minimizing constrained convex nonsmooth optimization problems whose objective and constraint functions ...

We propose restricted memory level bundle methods for minimizing constrained convex nonsmooth optimization problems whose objective and constraint functions ...

We propose restricted memory level bundle methods for minimizing constrained convex nonsmooth optimization problems whose objective and constraint functions ...

We propose restricted memory level bundle methods for minimizing constrained convex nonsmooth optimization problems whose objective and constraint functions ...

We propose restricted memory level bundle methods for minimizing constrained convex nonsmooth optimization problems whose objective and constraint functions ...

We introduce a family of constrained bundle methods, based on the so-called improvement functions, that is shown to be convergent and encompasses many previous ...

For non-smooth convex optimization, level bundle methods built using an oracle that computes values for the objective function and a subgradient at any ...

As for the level bundle method, the proximal bundle algorithm also has many ... Level bundle methods for constrained convex optimization with various oracles.

SAGASTIZABAL, Level bundle methods for oracles ... SOLODOV, An infeasible bundle method for nonsmooth convex constrained optimization without a penalty.