default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDEmanuel Laude
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2026
[j6]Konstantinos A. Oikonomidis
, Alexander Bodard, Emanuel Laude, Panagiotis Patrinos:
Global convergence analysis of the power proximal point and augmented Lagrangian method. Comput. Optim. Appl. 93(2): 617-649 (2026)- 2025
- [j5]Emanuel Laude, Panagiotis Patrinos:
Anisotropic proximal gradient. Math. Program. 214(1): 801-845 (2025) - [j4]Alexander Bodard, Konstantinos A. Oikonomidis, Emanuel Laude, Panagiotis Patrinos:
The inexact power augmented Lagrangian method for constrained nonconvex optimization. Trans. Mach. Learn. Res. 2025 (2025) - [c10]Konstantinos A. Oikonomidis, Jan Quan, Emanuel Laude, Panagiotis Patrinos:
Nonlinearly Preconditioned Gradient Methods under Generalized Smoothness. ICML 2025 - [i9]Santiago A. Cadena, Andrea Merlo, Emanuel Laude, Alexander Bauer, Atul Agrawal, Maria Pascu, Marija Savtchouk, Enrico Guiraud, Lukas Bonauer, Stuart Hudson, Markus Kaiser:
ConStellaration: A dataset of QI-like stellarator plasma boundaries and optimization benchmarks. CoRR abs/2506.19583 (2025) - 2024
- [c9]Robin Kenis, Emanuel Laude, Panagiotis Patrinos:
Convex Relaxations for Manifold-Valued Markov Random Fields with Approximation Guarantees. ECCV (87) 2024: 160-176 - [c8]Konstantinos A. Oikonomidis, Emanuel Laude, Puya Latafat, Andreas Themelis, Panagiotis Patrinos:
Adaptive Proximal Gradient Methods Are Universal Without Approximation. ICML 2024: 38663-38682 - [i8]Konstantinos A. Oikonomidis, Emanuel Laude, Puya Latafat, Andreas Themelis, Panagiotis Patrinos:
Adaptive proximal gradient methods are universal without approximation. CoRR abs/2402.06271 (2024) - [i7]Alexander Bodard, Konstantinos A. Oikonomidis, Emanuel Laude, Panagiotis Patrinos:
The inexact power augmented Lagrangian method for constrained nonconvex optimization. CoRR abs/2410.20153 (2024) - 2023
- [j3]Emanuel Laude, Andreas Themelis, Panagiotis Patrinos:
Dualities for Non-Euclidean Smoothness and Strong Convexity under the Light of Generalized Conjugacy. SIAM J. Optim. 33(4): 2721-2749 (2023) - 2022
- [j2]Hartmut Bauermeister, Emanuel Laude, Thomas Möllenhoff, Michael Möller, Daniel Cremers:
Lifting the Convex Conjugate in Lagrangian Relaxations: A Tractable Approach for Continuous Markov Random Fields. SIAM J. Imaging Sci. 15(3): 1253-1281 (2022) - 2021
- [c7]Mahesh Chandra Mukkamala, Felix Westerkamp, Emanuel Laude, Daniel Cremers, Peter Ochs:
Bregman Proximal Gradient Algorithms for Deep Matrix Factorization. SSVM 2021: 204-215 - [i6]Hartmut Bauermeister, Emanuel Laude, Thomas Möllenhoff, Michael Möller, Daniel Cremers:
Lifting the Convex Conjugate in Lagrangian Relaxations: A Tractable Approach for Continuous Markov Random Fields. CoRR abs/2107.06028 (2021) - 2020
- [j1]Emanuel Laude, Peter Ochs, Daniel Cremers:
Bregman Proximal Mappings and Bregman-Moreau Envelopes Under Relative Prox-Regularity. J. Optim. Theory Appl. 184(3): 724-761 (2020) - [c6]Nikolaus Demmel, Maolin Gao, Emanuel Laude, Tao Wu, Daniel Cremers:
Distributed Photometric Bundle Adjustment. 3DV 2020: 140-149
2010 – 2019
- 2019
- [c5]Emanuel Laude, Tao Wu, Daniel Cremers:
Optimization of Inf-Convolution Regularized Nonconvex Composite Problems. AISTATS 2019: 547-556 - [i5]Emanuel Laude, Tao Wu, Daniel Cremers:
Optimization of Inf-Convolution Regularized Nonconvex Composite Problems. CoRR abs/1903.11690 (2019) - [i4]Mahesh Chandra Mukkamala, Felix Westerkamp, Emanuel Laude, Daniel Cremers, Peter Ochs:
Bregman Proximal Framework for Deep Linear Neural Networks. CoRR abs/1910.03638 (2019) - 2018
- [c4]Emanuel Laude, Tao Wu, Daniel Cremers:
A Nonconvex Proximal Splitting Algorithm under Moreau-Yosida Regularization. AISTATS 2018: 491-499 - [c3]Emanuel Laude, Jan-Hendrik Lange, Jonas Schüpfer, Csaba Domokos, Laura Leal-Taixé, Frank R. Schmidt, Bjoern Andres, Daniel Cremers:
Discrete-Continuous ADMM for Transductive Inference in Higher-Order MRFs. CVPR 2018: 1614-1624 - 2017
- [i3]Emanuel Laude, Jan-Hendrik Lange, Frank R. Schmidt, Bjoern Andres, Daniel Cremers:
Discrete-Continuous Splitting for Weakly Supervised Learning. CoRR abs/1705.05020 (2017) - 2016
- [c2]Thomas Möllenhoff, Emanuel Laude, Michael Möller, Jan Lellmann, Daniel Cremers:
Sublabel-Accurate Relaxation of Nonconvex Energies. CVPR 2016: 3948-3956 - [c1]Emanuel Laude, Thomas Möllenhoff, Michael Möller, Jan Lellmann, Daniel Cremers:
Sublabel-Accurate Convex Relaxation of Vectorial Multilabel Energies. ECCV (1) 2016: 614-627 - [i2]Emanuel Laude, Thomas Möllenhoff, Michael Möller, Jan Lellmann, Daniel Cremers:
Sublabel-Accurate Convex Relaxation of Vectorial Multilabel Energies. CoRR abs/1604.01980 (2016) - 2015
- [i1]Thomas Möllenhoff, Emanuel Laude, Michael Möller, Jan Lellmann, Daniel Cremers:
Sublabel-Accurate Relaxation of Nonconvex Energies. CoRR abs/1512.01383 (2015)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2026-02-27 00:26 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
