Publications associées à Towards computational complexity certification for constrained mpc based on lagrange relaxation and the fast gradient method

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

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

Graph Chatbot

Chattez avec Graph Search

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

On the Generation of a Variety of Grasps

Synthesis of sparse arrays with focused or shaped beampattern via sequential convex optimizations

Regularized Bundle Methods for Convex and Non-Convex Risks

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

GPU-accelerated Convex Multi-phase Image Segmentation

Linear Local Models for Monocular Reconstruction of Deformable Surfaces

Optimal polarization synthesis of arbitrary arrays with focused power pattern

Robust Controller Design by Convex Optimization based on Finite Frequency Samples of Spectral Models

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

Synthesis of sparse arrays with focused or shaped beampattern via sequential convex optimizations

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

Regularized Bundle Methods for Convex and Non-Convex Risks

Optimal polarization synthesis of arbitrary arrays with focused power pattern

Linear Local Models for Monocular Reconstruction of Deformable Surfaces

On the Generation of a Variety of Grasps

Robust Controller Design by Convex Optimization based on Finite Frequency Samples of Spectral Models

GPU-accelerated Convex Multi-phase Image Segmentation