ML p(r)ior | Level-set methods for convex optimization

### Level-set methods for convex optimization

2016-02-03
1602.01506 | math.OC
Convex optimization problems arising in applications often have favorable objective functions and complicated constraints, thereby precluding first-order methods from being immediately applicable. We describe an approach that exchanges the roles of the objective and constraint functions, and instead approximately solves a sequence of parametric level-set problems. A zero-finding procedure, based on inexact function evaluations and possibly inexact derivative information, leads to an efficient solution scheme for the original problem. We describe the theoretical and practical properties of this approach for a broad range of problems, including low-rank semidefinite optimization, sparse optimization, and generalized linear models for inference.

Highlights - Most important sentences from the article

# Related Articles

2018-06-13
1806.05049 | cs.LG

We present a new proximal bundle method for Maximum-A-Posteriori (MAP) inference in structured energ… show more

Highlights - Most important sentences from the article

2018-09-30
1810.00303 | math.OC

Establishing global convergence of Newton-CG has long been limited to making strong convexity assump… show more

Highlights - Most important sentences from the article

2019-01-11
1901.03619 | cs.SY

We describe an approximate dynamic programming approach to compute lower bounds on the optimal value… show more

Highlights - Most important sentences from the article

2018-02-25
1802.09022 | math.OC

We consider an unconstrained problem of minimization of a smooth convex function which is only avail… show more

Highlights - Most important sentences from the article

2018-09-05
1809.01275 | math.OC

We propose a new primal-dual homotopy smoothing algorithm for a linearly constrained convex program,… show more

Highlights - Most important sentences from the article

2017-08-24
1708.07311 | math.OC

We consider the problem of estimating a probability distribution that maximizes the entropy while sa… show more

Highlights - Most important sentences from the article

2015-06-29
1506.08536 | stat.ML

This papers introduces an algorithm for the solution of multiple kernel learning (MKL) problems with… show more

Highlights - Most important sentences from the article

2019-01-23
1901.08087 | math.OC

Highlights - Most important sentences from the article

2019-01-25
1901.08836 | cs.DS

We propose a novel differentiable reformulation of the linearly-constrained $\ell_1$ minimization pr… show more

Highlights - Most important sentences from the article

2018-12-18
1812.07253 | cs.IT

Highlights - Most important sentences from the article

2019-05-09
1905.03488 | math.OC

Highlights - Most important sentences from the article

2018-09-03
1809.00710 | math.OC

We study the optimal convergence rates for distributed convex optimization problems over networks, w… show more

Highlights - Most important sentences from the article

2018-02-26
1802.09303 | cs.NA

The sparse generalized eigenvalue problem arises in a number of standard and modern statistical lear… show more

Highlights - Most important sentences from the article

2018-10-08
1810.03275 | math.NA

Total variation(TV) regularization is applied to X-Ray computed tomography(CT) in an effort to reduc… show more

Highlights - Most important sentences from the article

2018-03-17
1803.06523 | math.OC

We consider a family of algorithms that successively sample and minimize simple stochastic models of… show more

Highlights - Most important sentences from the article

2018-07-24
1807.09196 | eess.IV

Binary tomography is concerned with the recovery of binary images from a few of their projections (i… show more

Highlights - Most important sentences from the article