Publications associées à An adaptive primal-dual framework for nonsmooth convex minimization

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.

A first-order primal-dual method with adaptivity to local smoothness

Volkan Cevher, Maria-Luiza Vladarean

We consider the problem of finding a saddle point for the convex-concave objective

\min_x \max_y f(x) + \langle Ax, y\rangle - g^*(y)

, where

f

is a convex function with locally Lipschitz gradient and

g

is convex and possibly non-smooth. We propose an ...

2021

An adaptive primal-dual framework for nonsmooth convex minimization

Graph Chatbot

Chattez avec Graph Search

Augmented Lagrangian Methods for Provable and Scalable Machine Learning

A Spatial Branch and Bound Algorithm for Continuous Pricing with Advanced Discrete Choice Demand Modeling

Universal and adaptive methods for robust stochastic optimization

A combined Control by Interconnection—Model Predictive Control design for constrained Port-Hamiltonian systems

A first-order primal-dual method with adaptivity to local smoothness

Adaptation in Stochastic Algorithms: From Nonsmooth Optimization to Min-Max Problems and Beyond

Bootstrapping massive quantum field theories

Stochastic Frank-Wolfe for Composite Convex Minimization

Allocation of Active Power Reserve from Active Distribution Networks Using a Cost-Benefit Approach: Application to Swissgrid Network

Safe Convex Learning under Uncertain Constraints

Augmented Lagrangian Methods for Provable and Scalable Machine Learning

A Spatial Branch and Bound Algorithm for Continuous Pricing with Advanced Discrete Choice Demand Modeling

Universal and adaptive methods for robust stochastic optimization

A first-order primal-dual method with adaptivity to local smoothness

A combined Control by Interconnection—Model Predictive Control design for constrained Port-Hamiltonian systems

Adaptation in Stochastic Algorithms: From Nonsmooth Optimization to Min-Max Problems and Beyond

Bootstrapping massive quantum field theories

Stochastic Frank-Wolfe for Composite Convex Minimization

Allocation of Active Power Reserve from Active Distribution Networks Using a Cost-Benefit Approach: Application to Swissgrid Network

Safe Convex Learning under Uncertain Constraints