Variants of the A-HPE and large-step A-HPE algorithms for strongly convex problems with applications to accelerated high-order tensor methods-Reference-Cited by-同舟云学术

Variants of the A-HPE and large-step A-HPE algorithms for strongly convex problems with applications to accelerated high-order tensor methods

Published:2022-02-14 Issue:6 Volume:37 Page:2021-2051
ISSN:1055-6788
Container-title:Optimization Methods and Software
language:en
Short-container-title:Optimization Methods and Software

Author:

Marques Alves M.¹

Affiliation:

1. Departamento de Matemática, Universidade Federal de Santa Catarina, Florianópolis, Brazil

Funder

CNPQ

Publisher

Informa UK Limited

Subject

Applied Mathematics,Control and Optimization,Software

Link

https://www.tandfonline.com/doi/pdf/10.1080/10556788.2021.2022148

Reference32 articles.

1. M.M. Alves, R.D.C. Monteiro, and B.F. Svaiter Primal-dual regularized SQP and SQCQP type methods for convex programming and their complexity analysis, Tech. Rep. Optimization-online 4353, 2014.

2. Regularized HPE-Type Methods for Solving Monotone Inclusions with Improved Pointwise Iteration-Complexity Bounds

3. Oracle complexity of second-order methods for smooth convex optimization

4. M. Barré, A. Taylor, and F. Bach, A note on approximate accelerated forward-backward methods with absolute and relative errors, and possibly strongly convex objectives, Tech. Rep. Arxiv:2106.15536v2 [math.oc]), 2021.

Cited by 2 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. An Accelerated Regularized Chebyshev–Halley Method for Unconstrained Optimization;Asia-Pacific Journal of Operational Research;2023-05-27

2. A control-theoretic perspective on optimal high-order optimization;Mathematical Programming;2021-10-22