Publications associées à Path-following gradient-based decomposition algorithms for separable convex optimization

Chattez avec Graph Search

Posez n’importe quelle question sur les cours, conférences, exercices, recherches, actualités, etc. de l’EPFL ou essayez les exemples de questions ci-dessous.

AVERTISSEMENT : Le chatbot Graph n'est pas programmé pour fournir des réponses explicites ou catégoriques à vos questions. Il transforme plutôt vos questions en demandes API qui sont distribuées aux différents services informatiques officiellement administrés par l'EPFL. Son but est uniquement de collecter et de recommander des références pertinentes à des contenus que vous pouvez explorer pour vous aider à répondre à vos 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

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

Graph Chatbot

Chattez avec Graph Search

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

Geometric Variational Models for Inverse Problems in Imaging

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

Fast Proximal Algorithms For Self-Concordant Function Minimization With Application To Sparse Graph Selection

Accelerated And Inexact Forward-Backward Algorithms

Certification Aspects of the Fast Gradient Method for Solving the Dual of Parametric Convex Programs

A two-level time step technique for the partitioned solution of one-dimensional arterial networks

Container Terminal Management

Towards computational complexity certification for constrained mpc based on lagrange relaxation and the fast gradient method

Online-Batch Strongly Convex Multi Kernel Learning

Geometric Variational Models for Inverse Problems in Imaging

Towards computational complexity certification for constrained mpc based on lagrange relaxation and the fast gradient method

Certification Aspects of the Fast Gradient Method for Solving the Dual of Parametric Convex Programs

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

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

Container Terminal Management

A two-level time step technique for the partitioned solution of one-dimensional arterial networks

Online-Batch Strongly Convex Multi Kernel Learning

Accelerated And Inexact Forward-Backward Algorithms