Super-Universal Regularized Newton Method (Q6136654)

scientific article; zbMATH DE number 7790168

Language	Label	Description	Also known as
English	Super-Universal Regularized Newton Method	scientific article; zbMATH DE number 7790168

Statements

instance of

scholarly article

0 references

title

Super-Universal Regularized Newton Method (English)

0 references

author

Nikita Doikov

0 references

Konstantin Mishchenko

0 references

Yu. E. Nesterov

0 references

published in

SIAM Journal on Optimization

0 references

publication date

17 January 2024

0 references

full work available at URL

https://arxiv.org/abs/2208.05888

0 references

zbMATH Keywords

Newton method

0 references

regularization

0 references

global convergence

0 references

convex optimization

0 references

global complexity bounds

0 references

universal methods

0 references

MaRDI profile type

MaRDI publication profile

0 references

cites work

Oracle complexity of second-order methods for smooth convex optimization

0 references

A Descent Lemma Beyond Lipschitz Gradient Continuity: First-Order Methods Revisited and Applications

0 references

Worst-case evaluation complexity for unconstrained nonlinear optimization using high-order regularized models

0 references

Adaptive cubic regularisation methods for unconstrained optimization. I: Motivation, convergence and numerical results

0 references

Adaptive cubic regularisation methods for unconstrained optimization. II: Worst-case function- and derivative-evaluation complexity

0 references

Sharp Worst-Case Evaluation Complexity Bounds for Arbitrary-Order Nonconvex Optimization with Inexpensive Constraints

0 references

Trust Region Methods

0 references

Contracting Proximal Methods for Smooth Convex Optimization

0 references

Minimizing uniformly convex functions by cubic regularization of Newton method

0 references

Local convergence of tensor methods

0 references

Affine-invariant contracting-point methods for convex optimization

0 references

Maximization by Quadratic Hill-Climbing

0 references

Regularized Newton Methods for Minimizing Functions with Hölder Continuous Hessians

0 references

Accelerated Regularized Newton Methods for Minimizing Composite Convex Functions

0 references

Tensor Methods for Minimizing Convex Functions with Hölder Continuous Higher-Order Derivatives

0 references

On inexact solution of auxiliary problems in tensor methods for convex optimization

0 references

Near-Optimal Hyperfast Second-Order Method for Convex Optimization

0 references

Q5791786

0 references

A method for the solution of certain non-linear problems in least squares

0 references

Relatively Smooth Convex Optimization by First-Order Methods, and Applications

0 references

An Algorithm for Least-Squares Estimation of Nonlinear Parameters

0 references

An Accelerated Hybrid Proximal Extragradient Method for Convex Optimization and Its Implications to Second-Order Methods

0 references

Accelerating the cubic regularization of Newton's method on convex problems

0 references

Lectures on convex optimization

0 references

Implementable tensor methods in unconstrained convex optimization

0 references

Inexact accelerated high-order proximal-point methods

0 references

Superfast second-order methods for unconstrained convex optimization

0 references

Q4324980

0 references

Cubic regularization of Newton method and its global performance

0 references

Iterative Solution of Nonlinear Equations in Several Variables

0 references

Newton's method and its use in optimization

0 references

Regularized Newton method for unconstrained convex optimization

0 references

A regularized Newton method without line search for unconstrained optimization

0 references

Identifiers

arXiv ID

2208.05888

0 references

Mathematics Subject Classification ID

0 references

0 references

0 references

0 references

0 references

0 references

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:6136654