Publications associées à Scalable Convex Methods for Phase Retrieval

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

Scalable Convex Methods for Phase Retrieval

Graph Chatbot

Chattez avec Graph Search

An Augmented Lagrangian Coordination-Decomposition Algorithm for Solving Distributed Non-Convex Programs

An Augmented Lagrangian Coordination-Decomposition Algorithm for Solving Distributed Non-Convex Programs

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

Time-Optimal Path Following for Robots With Convex-Concave Constraints Using Sequential Convex Programming

Use of Convex Model Approximations for Real-Time Optimization via Modifier Adaptation

Approximate dynamic programming via sum of squares programming

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

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

Temperature Control of High Performance Multicore Platforms Using Convex Optimization

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

Time-Optimal Path Following for Robots With Convex-Concave Constraints Using Sequential Convex Programming

An Augmented Lagrangian Coordination-Decomposition Algorithm for Solving Distributed Non-Convex Programs

Use of Convex Model Approximations for Real-Time Optimization via Modifier Adaptation

Approximate dynamic programming via sum of squares programming

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

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

An Augmented Lagrangian Coordination-Decomposition Algorithm for Solving Distributed Non-Convex Programs

Temperature Control of High Performance Multicore Platforms Using Convex Optimization