Gradient regularization of Newton method with Bregman distances

DOI10.1007/s10107-023-01943-7arXiv2112.02952OpenAlexW4360829127MaRDI QIDQ6201850

Yu. E. Nesterov, Nikita Doikov

Publication date: 21 February 2024

Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2112.02952

zbMATH Keywords

convex optimizationregularizationlarge-scale optimizationNewton methodglobal complexity bounds

Mathematics Subject Classification ID

Convex programming (90C25) Nonlinear programming (90C30) Methods of quasi-Newton type (90C53)

Cites Work

• Unnamed Item
• Unnamed Item
• Smooth minimization of non-smooth functions
• Adaptive cubic regularisation methods for unconstrained optimization. I: Motivation, convergence and numerical results
• Lectures on convex optimization
• Regularized Newton method for unconstrained convex optimization
• Global convergence rate analysis of unconstrained optimization methods based on probabilistic models
• Cubic-regularization counterpart of a variable-norm trust-region method for unconstrained minimization
• Cubic regularization of Newton method and its global performance
• Contracting Proximal Methods for Smooth Convex Optimization