Cover Image

Universal Reduced-Operator Method and High-Order Global Curvature Bounds

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Doikov, Nikita, Nesterov, Yurii
Format:	Preprint
Published:	2025
Subjects:	Optimization and Control
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

On the Complexity of Lower-Order Implementations of Higher-Order Methods
by: Doikov, Nikita, et al.
Published: (2025)

Universal Complexity Bounds for Universal Gradient Methods in Nonlinear Optimization
by: Nesterov, Yurii
Published: (2025)

Local and Global Convergence of Greedy Parabolic Target-Following Methods for Linear Programming
by: Nesterov, Yurii
Published: (2024)

Theorem of Alternative for Extended Homogeneous Linear System and its Application in Conic Optimization
by: Nesterov, Yurii
Published: (2026)

Unified Convergence Theory of Stochastic and Variance-Reduced Cubic Newton Methods
by: Chayti, El Mahdi, et al.
Published: (2023)

Spectral Preconditioning for Gradient Methods on Graded Non-convex Functions
by: Doikov, Nikita, et al.
Published: (2024)

Complexity of Minimizing Regularized Convex Quadratic Functions
by: Thomsen, Daniel Berg, et al.
Published: (2024)

Asymmetric Long-Step Primal-Dual Interior-Point Methods with Dual Centering
by: Nesterov, Yurii
Published: (2025)

Gradient-Normalized Smoothness for Optimization with Approximate Hessians
by: Semenov, Andrei, et al.
Published: (2025)

Convex quartic problems: homogenized gradient method and preconditioning
by: Dragomir, Radu-Alexandru, et al.
Published: (2023)

Multiconic Optimization for Symmetric Cones and Hyperbolic Coupling
by: -Nagy, Marianna E., et al.
Published: (2026)

Improving Stochastic Cubic Newton with Momentum
by: Chayti, El Mahdi, et al.
Published: (2024)

Cubic regularized subspace Newton for non-convex optimization
by: Zhao, Jim, et al.
Published: (2024)

Conic-Optimization Based Algorithms for Nonnegative Matrix Factorization
by: Leplat, Valentin, et al.
Published: (2021)

On Convergence of Incremental Gradient for Non-Convex Smooth Functions
by: Koloskova, Anastasia, et al.
Published: (2023)

Improved global performance guarantees of second-order methods in convex minimization
by: Dvurechensky, Pavel, et al.
Published: (2024)

Elongation of Curvature-Bounded Path
by: Chen, Zheng, et al.
Published: (2021)

Curvature-Dependent Lower Bounds for Frank-Wolfe
by: Halbey, Jannis, et al.
Published: (2026)

Dictionary-Restricted First-Order Descent Methods: Bounds and Convergence Rates
by: Berasategui, Miguel, et al.
Published: (2026)

On the Reachability of 3-Dimensional Paths with a Prescribed Curvature Bound
by: Bae, Juho, et al.
Published: (2024)

Negative Curvature Methods with High-Probability Complexity Guarantees for Stochastic Nonconvex Optimization
by: Berahas, Albert S., et al.
Published: (2026)

An optimal lower bound for smooth convex functions
by: Florea, Mihai I., et al.
Published: (2024)

Interior-Point Algorithms for Monotone Linear Complementarity Problem Based on Different Predictor Directions
by: -Nagy, Marianna E., et al.
Published: (2025)

INTHOP: A Second-Order Globally Convergent Method for Nonconvex Optimization
by: Kumar, Krishan, et al.
Published: (2025)

Intrinsic Decentralized Stochastic Riemannian Optimization on Manifolds with Bounded Sectional Curvature
by: Nguyen, Duc Toan, et al.
Published: (2026)

Global Convergence of High-Order Regularization Methods with Sums-of-Squares Taylor Models
by: Zhu, Wenqi, et al.
Published: (2024)

Sign Operator for Coping with Heavy-Tailed Noise in Non-Convex Optimization: High Probability Bounds Under $(L_0, L_1)$-Smoothness
by: Kornilov, Nikita, et al.
Published: (2025)

On Solving Minimization and Min-Max Problems by First-Order Methods with Relative Error in Gradients
by: Vasin, Artem, et al.
Published: (2025)

OPTAMI: Global Superlinear Convergence of High-order Methods
by: Kamzolov, Dmitry, et al.
Published: (2024)

Exploring Jacobian Inexactness in Second-Order Methods for Variational Inequalities: Lower Bounds, Optimal Algorithms and Quasi-Newton Approximations
by: Agafonov, Artem, et al.
Published: (2024)

Asymptotic Convergence Analysis of High-Order Proximal-Point Methods Beyond Sublinear Rates
by: Ahookhosh, Masoud, et al.
Published: (2025)

Operational Research: Methods and Applications
by: Petropoulos, Fotios, et al.
Published: (2023)

First-Order Methods for Linear Programming
by: Lu, Haihao
Published: (2024)

Robust Learning Meets Quasar-Convex Optimization: Inexact High-Order Proximal-Point Methods
by: Kabgani, Alireza, et al.
Published: (2026)

Efficient First Order Method for Saddle Point Problems with Higher Order Smoothness
by: Wang, Nuozhou, et al.
Published: (2023)

Nonlinear MPC for Feedback-Interconnected Systems: a Suboptimal and Reduced-Order Model Approach
by: Di Gregorio, Stefano, et al.
Published: (2025)

Beyond Bounded Variance: Variance-Reduced Normalized Methods for Nonconvex Optimization under Blum-Gladyshev Noise
by: Upadhyay, Antesh, et al.
Published: (2026)

The Geometry of Monotone Operator Splitting Methods
by: Combettes, Patrick L.
Published: (2023)

Picking Operations in Warehouses with Dynamically Arriving Orders: How Good is Reoptimization?
by: Lorenz, Catherine, et al.
Published: (2024)

Tight Lower Bounds under Asymmetric High-Order Hölder Smoothness and Uniform Convexity
by: Bai, Cedar Site, et al.
Published: (2024)