Minimizing quasi-self-concordant functions by gradient regularization of Newton method
From MaRDI portal
Cites work
- A UNIFIED FRAMEWORK FOR SOME INEXACT PROXIMAL POINT ALGORITHMS*
- Accelerated regularized Newton methods for minimizing composite convex functions
- Accelerating the cubic regularization of Newton's method on convex problems
- Adaptive cubic regularisation methods for unconstrained optimization. I: Motivation, convergence and numerical results
- Adaptive cubic regularisation methods for unconstrained optimization. II: Worst-case function- and derivative-evaluation complexity
- An accelerated hybrid proximal extragradient method for convex optimization and its implications to second-order methods
- Augmented Lagrangians and Applications of the Proximal Point Algorithm in Convex Programming
- Contracting proximal methods for smooth convex optimization
- Cubic regularization of Newton method and its global performance
- Generalized self-concordant functions: a recipe for Newton-type methods
- Gradient regularization of Newton method with Bregman distances
- scientific article; zbMATH DE number 729680 (Why is no real title available?)
- scientific article; zbMATH DE number 3048044 (Why is no real title available?)
- Inexact accelerated high-order proximal-point methods
- Inexact and accelerated proximal point algorithms
- Inexact high-order proximal-point methods with auxiliary search procedure
- Lectures on convex optimization
- Matrix scaling and balancing via box constrained Newton's method and interior point methods
- Newton's method in general analysis.
- On Newton's method of approximation.
- Oracle complexity of second-order methods for smooth convex optimization
- Perturbation des méthodes d'optimisation. Applications
- Proximité et dualité dans un espace hilbertien
- Regularized Newton method for unconstrained convex optimization
- Regularized Newton Method with Global \({\boldsymbol{\mathcal{O}(1/{k}^2)}}\) Convergence
- Regularized Newton methods for minimizing functions with Hölder continuous hessians
- Self-concordant analysis for logistic regression
- Sharp worst-case evaluation complexity bounds for arbitrary-order nonconvex optimization with inexpensive constraints
- Smooth minimization of non-smooth functions
- Super-Universal Regularized Newton Method
- Tensor methods for minimizing convex functions with Hölder continuous higher-order derivatives
- The Elements of Statistical Learning
- Updating the regularization parameter in the adaptive cubic regularization algorithm
- Worst-case evaluation complexity for unconstrained nonlinear optimization using high-order regularized models
This page was built for publication: Minimizing quasi-self-concordant functions by gradient regularization of Newton method
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7349077)
