Andreas Themelis

Andreas Themelis

Auto-generated profile, based on publicly available information

Andreas Themelis

Faculty of Information Science and Electrical Engineering (ISEE), Kyushu University, Fukuoka, Japan

Research Focus & Metrics

Academic Career Length

11Years (2016-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
10 April 2017 in Computational Optimization and Applications
Verified
Journal Article
Closed access
PDF file
LSLorenzo Stella
Lorenzo Stella
ATAndreas Themelis
Andreas Themelis
PPPanagiotis Patrinos
Panagiotis Patrinos

9 January 2020 in SIAM Journal on Optimization
Verified
Journal Article
Closed access
ATAndreas Themelis
Andreas Themelis
PPPanagiotis Patrinos
Panagiotis Patrinos
Although originally designed and analyzed for convex problems, the alternating direction method of multipliers (ADMM) and its close relatives, Douglas--Rachford splitting (DRS) and Peaceman--Rachfo...

1 January 2018 in SIAM Journal on Optimization
Verified
Journal Article
Closed access
ATAndreas Themelis
Andreas Themelis
LSLorenzo Stella
Lorenzo Stella
PPPanagiotis Patrinos
Panagiotis Patrinos
We propose \sf ZeroFPR, a nonmonotone linesearch algorithm for minimizing the sum of two nonconvex functions, one of which is smooth and the other possibly nonsmooth. \sf ZeroFPR is the first algorithm that, despite being fit for fully nonconvex problems and requiring only the black-box oracle of forward-backward splitting (FBS)---namely evaluations of the gradient of the smooth term and of the proximity operator of the nonsmooth one---achieves superlinear convergence rates under mild assumptions at the limit point when the linesearch directions satisfy a Dennis--Moré condition, and we show that this is the case for Broyden's quasi-Newton directions. Our approach is based on the forward-backward envelope (FBE), an exact and strictly continuous penalty function for the original cost. Extending previous results we show that, despite being nonsmooth for fully nonconvex problems, the FBE still enjoys favorable first- and second-order properties which are key for the convergence results of \sf ZeroFPR. Our the...

1 December 2017
Verified
Conference Paper
Closed access
LSLorenzo Stella
Lorenzo Stella
ATAndreas Themelis
Andreas Themelis
PSPantelis Sopasakis
Pantelis Sopasakis
PPPanagiotis Patrinos
Panagiotis Patrinos
We present PANOC, a new algorithm for solving optimal control problems arising in nonlinear model predictive control (NMPC). A usual approach to this type of problems is sequential quadratic programming (SQP), which requires the solution of a quadratic program at every iteration and, consequently, inner iterative procedures. As a result, when the problem is ill-conditioned or the prediction horizon is large, each outer iteration becomes computationally very expensive. We propose a line-search algorithm that combines forward-backward iterations (FB) and Newton-type steps over the recently introduced forward-backward envelope (FBE), a continuous, real-valued, exact merit function for the original problem. The curvature information of Newton-type methods enables asymptotic superlinear rates under mild assumptions at the limit point, and the proposed algorithm is based on very simple operations: access to first-order information of the cost and dynamics and low-cost direct linear algebra. No inner iterative procedure nor Hessian evaluation is required, making our approach computationally simpler than SQP methods. The low-memory requirements and simple implementation make our method particularly suited for embedded NMPC applications.

1 June 2018
Verified
Conference Paper
Closed access
ASAjay Sathya
Ajay Sathya
PSPantelis Sopasakis
Pantelis Sopasakis
RPRuben Van Parys
Ruben Van Parys
ATAndreas Themelis
Andreas Themelis
GPGoele Pipeleers
Goele Pipeleers
PPPanagiotis Patrinos
Panagiotis Patrinos

27 March 2019 in IEEE Transactions on Automatic Control
Verified
Journal Article
Closed access
ATAndreas Themelis
Andreas Themelis
PPPanagiotis Patrinos
Panagiotis Patrinos
Operator splitting techniques have recently gained popularity in convex optimization problems arising in various control fields. Being fixed-point iterations of nonexpansive operators, such methods suffer many well known downsides, which include high sensitivity to ill conditioning and parameter selection, and consequent low accuracy and robustness. As universal solution we propose SuperMann, a Newton-type algorithm for finding fixed points of nonexpansive operators. It generalizes the classical Krasnosel'skii-Mann scheme, enjoys its favorable global convergence properties and requires exactly the same oracle. It is based on a novel separating hyperplane projection tailored for nonexpansive mappings which makes it possible to include steps along any direction. In particular, when the directions satisfy a Dennis-More condition we show that SuperMann converges superlinearly under mild assumptions, which, surprisingly, do not entail nonsingularity of the Jacobian at the solution but merely metric subregularity. As a result, SuperMann enhances and robustifies all operator splitting schemes for structured convex optimization, overcoming their well known sensitivity to ill conditioning.