default search action
Andreas Themelis
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [j16]Pourya Behmandpoor
, Puya Latafat
SPIRAL: a superlinearly convergent incremental proximal algorithm for nonconvex finite sum minimization. Comput. Optim. Appl. 88(1): 71-106 (2024) - [j15]Ziyuan Wang, Andreas Themelis, Hongjia Ou, Xianfu Wang:
A Mirror Inertial Forward-Reflected-Backward Splitting: Convergence Analysis Beyond Convexity and Lipschitz Smoothness. J. Optim. Theory Appl. 203(2): 1127-1159 (2024) - [c13]Ou Hongjia, Andreas Themelis:
Safeguarding adaptive methods: global convergence of Barzilai-Borwein and other stepsize choices. CoDIT 2024: 2802-2807 - [c12]Konstantinos A. Oikonomidis, Emanuel Laude, Puya Latafat, Andreas Themelis, Panagiotis Patrinos:
Adaptive Proximal Gradient Methods Are Universal Without Approximation. ICML 2024 - [c11]Puya Latafat, Andreas Themelis, Panagiotis Patrinos:
On the convergence of adaptive first order methods: proximal gradient and alternating minimization algorithms. L4DC 2024: 197-208 - [i7]Konstantinos A. Oikonomidis, Emanuel Laude, Puya Latafat, Andreas Themelis, Panagiotis Patrinos:
Adaptive proximal gradient methods are universal without approximation. CoRR abs/2402.06271 (2024) - [i6]Ou Hongjia, Andreas Themelis:
Safeguarding adaptive methods: global convergence of Barzilai-Borwein and other stepsize choices. CoRR abs/2404.09617 (2024) - 2023
- [j14]Emanuel Laude
Dualities for Non-Euclidean Smoothness and Strong Convexity under the Light of Generalized Conjugacy. SIAM J. Optim. 33(4): 2721-2749 (2023) - [i5]Puya Latafat, Andreas Themelis, Lorenzo Stella, Panagiotis Patrinos:
Adaptive proximal algorithms for convex optimization under local Lipschitz continuity of the gradient. CoRR abs/2301.04431 (2023) - [i4]Puya Latafat, Andreas Themelis, Panagiotis Patrinos:
On the convergence of adaptive first order methods: proximal gradient and alternating minimization algorithms. CoRR abs/2311.18431 (2023) - 2022
- [j13]Andreas Themelis
Douglas-Rachford splitting and ADMM for nonconvex optimization: accelerated and Newton-type linesearch algorithms. Comput. Optim. Appl. 82(2): 395-440 (2022) - [j12]Alberto De Marchi
Proximal Gradient Algorithms Under Local Lipschitz Gradient Continuity. J. Optim. Theory Appl. 194(3): 771-794 (2022) - [j11]Puya Latafat
Block-coordinate and incremental aggregated proximal gradient methods for nonsmooth nonconvex problems. Math. Program. 193(1): 195-224 (2022) - [j10]Ben Hermans, Andreas Themelis
QPALM: a proximal augmented lagrangian method for nonconvex quadratic programs. Math. Program. Comput. 14(3): 497-541 (2022) - [j9]Puya Latafat
Bregman Finito/MISO for Nonconvex Regularized Finite Sum Minimization without Lipschitz Gradient Continuity. SIAM J. Optim. 32(3): 2230-2262 (2022) - [c10]Aneek Nag, Shuo Huang, Andreas Themelis
Flock navigation with dynamic hierarchy and subjective weights using nonlinear MPC. CCTA 2022: 1135-1140 - [i3]Pourya Behmandpoor, Puya Latafat, Andreas Themelis, Marc Moonen, Panagiotis Patrinos
SPIRAL: A Superlinearly Convergent Incremental Proximal Algorithm for Nonconvex Finite Sum Minimization. CoRR abs/2207.08195 (2022) - [i2]Pieter Pas, Andreas Themelis, Panagiotis Patrinos
Gauss-Newton meets PANOC: A fast and globally convergent algorithm for nonlinear optimal control. CoRR abs/2212.04391 (2022) - 2021
- [j8]Masoud Ahookhosh
A Bregman Forward-Backward Linesearch Algorithm for Nonconvex Composite Optimization: Superlinear Convergence to Nonisolated Local Minima. SIAM J. Optim. 31(1): 653-685 (2021) - [c9]Brecht Evens
Neural Network Training as an Optimal Control Problem : - An Augmented Lagrangian Approach -. CDC 2021: 5136-5143 - [c8]Miguel Simões, Andreas Themelis
Lasry-Lions Envelopes and Nonconvex Optimization: A Homotopy Approach. EUSIPCO 2021: 2089-2093 - [i1]Miguel Simões, Andreas Themelis
Lasry-Lions Envelopes and Nonconvex Optimization: A Homotopy Approach. CoRR abs/2103.08533 (2021) - 2020
- [j7]Andreas Themelis
Douglas-Rachford Splitting and ADMM for Nonconvex Optimization: Tight Convergence Results. SIAM J. Optim. 30(1): 149-181 (2020) - [c7]Andreas Themelis
A new envelope function for nonsmooth DC optimization. CDC 2020: 4697-4702 - [c6]Nico Vervliet, Andreas Themelis
A Quadratically Convergent Proximal Algorithm For Nonnegative Tensor Decomposition. EUSIPCO 2020: 1020-1024
2010 – 2019
- 2019
- [j6]Lorenzo Stella
Newton-Type Alternating Minimization Algorithm for Convex Optimization. IEEE Trans. Autom. Control. 64(2): 697-711 (2019) - [j5]Andreas Themelis
SuperMann: A Superlinearly Convergent Algorithm for Finding Fixed Points of Nonexpansive Operators. IEEE Trans. Autom. Control. 64(12): 4875-4890 (2019) - [c5]Ben Hermans, Andreas Themelis
QPALM: A Newton-type Proximal Augmented Lagrangian Method for Quadratic Programs. CDC 2019: 4325-4330 - 2018
- [j4]Andreas Themelis
Forward-Backward Envelope for the Sum of Two Nonconvex Functions: Further Properties and Nonmonotone Linesearch Algorithms. SIAM J. Optim. 28(3): 2274-2303 (2018) - [c4]Ajay Sathya, Pantelis Sopasakis
Embedded nonlinear model predictive control for obstacle avoidance using PANOC. ECC 2018: 1523-1528 - 2017
- [j3]Lorenzo Stella
Forward-backward quasi-Newton methods for nonsmooth optimization problems. Comput. Optim. Appl. 67(3): 443-487 (2017) - [c3]Lorenzo Stella, Andreas Themelis
A simple and efficient algorithm for nonlinear model predictive control. CDC 2017: 1939-1944 - [c2]Pantelis Sopasakis, Andreas Themelis
A primal-dual line search method and applications in image processing. EUSIPCO 2017: 1065-1069 - 2016
- [c1]Andreas Themelis
Stochastic gradient methods for stochastic model predictive control. ECC 2016: 154-159 - 2013
- [j2]Andreas Themelis:
Information and Intermediation, Abuse of Dominance and Internet 'Neutrality': 'Updating' Competition Policy under the Digital Single Market and the Google Investigations(?). Eur. J. Law Technol. 4(3) (2013) - 2012
- [j1]Andreas Themelis:
After Pierre Fabre: the future of online distribution under competition policy. Int. J. Law Inf. Technol. 20(4): 346-369 (2012)
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 2024-11-25 22:41 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: