Cargando…
An accelerated minimax algorithm for convex-concave saddle point problems with nonsmooth coupling function
In this work we aim to solve a convex-concave saddle point problem, where the convex-concave coupling function is smooth in one variable and nonsmooth in the other and not assumed to be linear in either. The problem is augmented by a nonsmooth regulariser in the smooth component. We propose and inve...
Autores principales: | Boţ, Radu Ioan, Csetnek, Ernö Robert, Sedlmayer, Michael |
---|---|
Formato: | Online Artículo Texto |
Lenguaje: | English |
Publicado: |
Springer US
2022
|
Materias: | |
Acceso en línea: | https://www.ncbi.nlm.nih.gov/pmc/articles/PMC10643324/ https://www.ncbi.nlm.nih.gov/pubmed/37969869 http://dx.doi.org/10.1007/s10589-022-00378-8 |
Ejemplares similares
-
An Inertial Proximal-Gradient Penalization Scheme for Constrained Convex Optimization Problems
por: Boţ, Radu Ioan, et al.
Publicado: (2017) -
The Proximal Alternating Minimization Algorithm for Two-Block Separable Convex Optimization Problems with Linear Constraints
por: Bitterlich, Sandy, et al.
Publicado: (2018) -
Gradient-type penalty method with inertial effects for solving constrained convex optimization problems with smooth data
por: Boţ, Radu Ioan, et al.
Publicado: (2017) -
Fast Augmented Lagrangian Method in the convex regime with convergence guarantees for the iterates
por: Boţ, Radu Ioan, et al.
Publicado: (2022) -
A fast continuous time approach with time scaling for nonsmooth convex optimization
por: Boţ, Radu Ioan, et al.
Publicado: (2022)