Publications related to Barrier Smoothing for Nonsmooth Convex Minimization

Chat with Graph Search

Ask any question about EPFL courses, lectures, exercises, research, news, etc. or try the example questions below.

DISCLAIMER: The Graph Chatbot is not programmed to provide explicit or categorical answers to your questions. Rather, it transforms your questions into API requests that are distributed across the various IT services officially administered by EPFL. Its purpose is solely to collect and recommend relevant references to content that you can explore to help you answer your questions.

Fast Proximal algorithms for Self-concordant function minimization with application to sparse graph selection

Volkan Cevher, Anastasios Kyrillidis

The convex

\ell_1

-regularized

\log\det

divergence criterion has been shown to produce theoretically consistent graph learning. However, this objective function is challenging since the

\ell_1

-regularization is nonsmooth, the

\log\det

objective is n ...

2013

Barrier Smoothing for Nonsmooth Convex Minimization

Graph Chatbot

Chat with Graph Search

A Convex Solution to Disparity Estimation from Light Fields via the Primal-Dual Method

Composite Self-Concordant Minimization

Path-following gradient-based decomposition algorithms for separable convex optimization

Scalable sparse covariance estimation via self-concordance

A Primal-Dual Algorithmic Framework for Constrained Convex Minimization

A Convex Solution to Disparity Estimation from Light Fields via the Primal-Dual Method

Constrained convex minimization via model-based excessive gap

A proximal Newton framework for composite minimization: Graph learning without Cholesky decompositions and matrix inversions

Fast Proximal algorithms for Self-concordant function minimization with application to sparse graph selection

Inner approximations of the region of attraction for polynomial dynamical systems

Path-following gradient-based decomposition algorithms for separable convex optimization

Composite Self-Concordant Minimization

Fast Proximal algorithms for Self-concordant function minimization with application to sparse graph selection

A Convex Solution to Disparity Estimation from Light Fields via the Primal-Dual Method

A Primal-Dual Algorithmic Framework for Constrained Convex Minimization

Scalable sparse covariance estimation via self-concordance

Constrained convex minimization via model-based excessive gap

A Convex Solution to Disparity Estimation from Light Fields via the Primal-Dual Method

A proximal Newton framework for composite minimization: Graph learning without Cholesky decompositions and matrix inversions

Inner approximations of the region of attraction for polynomial dynamical systems