Superfast second-order methods for unconstrained convex optimization
From MaRDI portal
Publication:2664892
DOI10.1007/S10957-021-01930-YzbMATH Open1480.90195OpenAlexW3092425772MaRDI QIDQ2664892FDOQ2664892
Recommendations
- Near-optimal hyperfast second-order method for convex optimization
- A second order method for unconstrained optimization
- Acceleration of conjugate gradient algorithms for unconstrained optimization
- Accelerated methods for nonconvex optimization
- An accelerated hybrid proximal extragradient method for convex optimization and its implications to second-order methods
- Accelerated Uzawa methods for convex optimization
- Faster Lagrangian-based methods in convex optimization
- Accelerated first-order methods for large-scale convex optimization: nearly optimal complexity under strong convexity
- Fast alternating direction optimization methods
- A family of second-order methods for convex \(\ell _1\)-regularized optimization
Cites Work
- scientific article; zbMATH DE number 729680 (Why is no real title available?)
- A descent lemma beyond Lipschitz gradient continuity: first-order methods revisited and applications
- Accelerating the cubic regularization of Newton's method on convex problems
- An accelerated hybrid proximal extragradient method for convex optimization and its implications to second-order methods
- Cubic regularization of Newton method and its global performance
- Implementable tensor methods in unconstrained convex optimization
- Lectures on convex optimization
- On inexact solution of auxiliary problems in tensor methods for convex optimization
- Oracle complexity of second-order methods for smooth convex optimization
- Relatively smooth convex optimization by first-order methods, and applications
- Worst-case evaluation complexity for unconstrained nonlinear optimization using high-order regularized models
Cited In (15)
- Super-Universal Regularized Newton Method
- Inexact tensor methods and their application to stochastic convex optimization
- Oracle complexity of second-order methods for smooth convex optimization
- Adaptive Third-Order Methods for Composite Convex Optimization
- Fast Curvature Matrix-Vector Products for Second-Order Gradient Descent
- High-order methods beyond the classical complexity bounds: inexact high-order proximal-point methods
- Near-optimal hyperfast second-order method for convex optimization
- Near-optimal tensor methods for minimizing the gradient norm of convex functions and accelerated primal–dual tensor methods
- A concise second-order complexity analysis for unconstrained optimization using high-order regularized models
- Inexact accelerated high-order proximal-point methods
- Fast convex optimization via a third-order in time evolution equation
- Perseus: a simple and optimal high-order method for variational inequalities
- Inexact high-order proximal-point methods with auxiliary search procedure
- Hyperfast second-order local solvers for efficient statistically preconditioned distributed optimization
- Regularized Newton Method with Global \({\boldsymbol{\mathcal{O}(1/{k}^2)}}\) Convergence
This page was built for publication: Superfast second-order methods for unconstrained convex optimization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2664892)
