The following pages link to Andreas Themelis (Q2088966):
Displaying 20 items.
- QPALM: a proximal augmented Lagrangian method for nonconvex quadratic programs (Q2088967) (← links)
- Block-coordinate and incremental aggregated proximal gradient methods for nonsmooth nonconvex problems (Q2133414) (← links)
- Douglas-Rachford splitting and ADMM for nonconvex optimization: accelerated and Newton-type linesearch algorithms (Q2141355) (← links)
- Proximal gradient algorithms under local Lipschitz gradient continuity. A convergence and robustness analysis of PANOC (Q2159445) (← links)
- Forward-backward quasi-Newton methods for nonsmooth optimization problems (Q2364124) (← links)
- Forward-Backward Envelope for the Sum of Two Nonconvex Functions: Further Properties and Nonmonotone Linesearch Algorithms (Q4586171) (← links)
- Newton-type Alternating Minimization Algorithm for Convex Optimization (Q4629822) (← links)
- Douglas--Rachford Splitting and ADMM for Nonconvex Optimization: Tight Convergence Results (Q5210517) (← links)
- SuperMann: A Superlinearly Convergent Algorithm for Finding Fixed Points of Nonexpansive Operators (Q5211256) (← links)
- A Bregman Forward-Backward Linesearch Algorithm for Nonconvex Composite Optimization: Superlinear Convergence to Nonisolated Local Minima (Q5853567) (← links)
- Bregman Finito/MISO for Nonconvex Regularized Finite Sum Minimization without Lipschitz Gradient Continuity (Q5869813) (← links)
- Dualities for Non-Euclidean Smoothness and Strong Convexity under the Light of Generalized Conjugacy (Q6076867) (← links)
- SPIRAL: a superlinearly convergent incremental proximal algorithm for nonconvex finite sum minimization (Q6498409) (← links)
- A quadratically convergent proximal algorithm for nonnegative tensor decomposition (Q6503936) (← links)
- A new envelope function for nonsmooth DC optimization (Q6504221) (← links)
- An interior proximal gradient method for nonconvex optimization (Q6506355) (← links)
- A mirror inertial forward-reflected-backward splitting: Global convergence and linesearch extension beyond convexity and Lipschitz smoothness (Q6507218) (← links)
- On the convergence of proximal gradient methods for convex simple bilevel optimization (Q6509969) (← links)
- An interior proximal gradient method for nonconvex optimization (Q6584340) (← links)
- A mirror inertial forward-reflected-backward splitting: convergence analysis beyond convexity and Lipschitz smoothness (Q6644234) (← links)
