( en | de | ru )

 

Disambiguation of "Themelis, Andreas"

Author of the publication

copydeleteadd this publication to your clipboard
Forward-backward quasi-Newton methods for nonsmooth optimization problems.

, , and . Comput. Optim. Appl., 67 (3): 443-487 (2017)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

Ioannis Themelis

Nikolaos Themelis

Andreas

Andreas Eickelkamp

Der Nutzwertjournalismus. Uni Leipzig, (2009)

Andreas Nilsson

BSCCO superconductors processed by the glass ceramic route: critical aspects of process, crystallization and incorporation of oxygen, composition dependence on phase formation. TU Dresden, (2009)
 

Other publications of authors with the same name

SuperMann: A Superlinearly Convergent Algorithm for Finding Fixed Points of Nonexpansive Operators., and . IEEE Trans. Automat. Contr., 64 (12): 4875-4890 (2019)Forward-backward quasi-Newton methods for nonsmooth optimization problems., , and . Comput. Optim. Appl., 67 (3): 443-487 (2017)A Bregman Forward-Backward Linesearch Algorithm for Nonconvex Composite Optimization: Superlinear Convergence to Nonisolated Local Minima., , and . SIAM J. Optim., 31 (1): 653-685 (2021)Douglas-Rachford splitting and ADMM for nonconvex optimization: accelerated and Newton-type linesearch algorithms., , and . Comput. Optim. Appl., 82 (2): 395-440 (2022)Flock navigation with dynamic hierarchy and subjective weights using nonlinear MPC., , , and . CCTA, page 1135-1140. IEEE, (2022)A new envelope function for nonsmooth DC optimization., , and . CDC, page 4697-4702. IEEE, (2020)Forward-Backward Envelope for the Sum of Two Nonconvex Functions: Further Properties and Nonmonotone Linesearch Algorithms., , and . SIAM J. Optimization, 28 (3): 2274-2303 (2018)QPALM: a proximal augmented lagrangian method for nonconvex quadratic programs., , and . Math. Program. Comput., 14 (3): 497-541 (2022)Dualities for Non-Euclidean Smoothness and Strong Convexity under the Light of Generalized Conjugacy., , and . SIAM J. Optim., 33 (4): 2721-2749 (December 2023)After Pierre Fabre: the future of online distribution under competition policy.. Int. J. Law Inf. Technol., 20 (4): 346-369 (2012)