Cover Image

Nesterov's accelerated gradient for unbounded convex functions finds the minimum-norm point in the dual space

Fuente: arXiv

Saved in:

Bibliographic Details
Main Author:	Sakabe, Keiya
Format:	Preprint
Published:	2026
Subjects:	Optimization and Control 90C25, 90C30, 90C46
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

A nonsmooth Frank-Wolfe algorithm through a dual cutting-plane approach
by: Mazanti, Guilherme, et al.
Published: (2024)

Gradient descent for unbounded convex functions on Hadamard manifolds and its applications to scaling problems
by: Hirai, Hiroshi, et al.
Published: (2024)

Convergence, Duality and Well-Posedness in Convex Bilevel Optimization
by: Giang-Tran, Khanh-Hung, et al.
Published: (2025)

A Modified Proximal Bundle Method Under A Frank-Wolfe Perspective
by: Fersztand, David, et al.
Published: (2024)

Efficient parameter-free restarted accelerated gradient methods for convex and strongly convex optimization
by: Sujanani, Arnesh, et al.
Published: (2024)

Optimization over convex polyhedra via Hadamard parametrizations
by: Tang, Tianyun, et al.
Published: (2024)

A feasible smoothing accelerated projected gradient method for nonsmooth convex optimization
by: Nishioka, Akatsuki, et al.
Published: (2023)

Hidden convexity of quadratic systems and its application to quadratic programming
by: Huy, Nguyen Quang, et al.
Published: (2026)

Interval-Valued Optimization Problems for Strongly LU-E-Invex and Strongly LU-E-Preinvex Functions
by: Tauheed, et al.
Published: (2026)

Augmented Lagrangian methods for fully convex composite optimization
by: De Marchi, Alberto, et al.
Published: (2025)

On the convergence of proximal gradient methods for convex simple bilevel optimization
by: Latafat, Puya, et al.
Published: (2023)

A high-order augmented Lagrangian method with arbitrarily fast convergence
by: Lee, Young-Ju, et al.
Published: (2026)

Second-order sequential optimality conditions for nonlinear semidefinite optimization problems
by: Li, Huimin, et al.
Published: (2025)

On Constraint Qualifications for MPECs with Applications to Bilevel Hyperparameter Optimization for Machine Learning
by: Li, Jiani, et al.
Published: (2025)

Second-Order Necessary Conditions, Constraint Qualifications and Exact Penalty for Mathematical Programs with Switching Constraints
by: Chen, Jiawei, et al.
Published: (2024)

Duality-based single-level reformulations of bilevel optimization problems
by: Dempe, Stephan, et al.
Published: (2024)

Exact Solution Procedure for the Log-Linear Continuous Knapsack Problem
by: Lahiri, Somdeb
Published: (2024)

A second-order sequential optimality condition for nonlinear second-order cone programming problems
by: Fukuda, Ellen H., et al.
Published: (2023)

Optimality conditions for problems over symmetric cones and a simple augmented Lagrangian method
by: Lourenço, Bruno F., et al.
Published: (2017)

A symmetric primal-dual algorithmic framework for saddle point problems
by: He, Hongjin, et al.
Published: (2022)

Benign landscapes of low-dimensional relaxations for orthogonal synchronization on general graphs
by: McRae, Andrew D., et al.
Published: (2023)

A minimal face constant rank constraint qualification for reducible conic programming
by: Andreani, Roberto, et al.
Published: (2023)

Non-Attainment of Minima in Non-Polyhedral Conic Optimization: A Robust SOCP Example
by: Nguyen, Vinh
Published: (2025)

Adaptive proximal algorithms for convex optimization under local Lipschitz continuity of the gradient
by: Latafat, Puya, et al.
Published: (2023)

The Güler-type acceleration for proximal gradient, linearized augmented Lagrangian and linearized alternating direction method of multipliers
by: Zhou, Bin, et al.
Published: (2025)

A Projection-Free Method for Solving Convex Bilevel Optimization Problems
by: Giang-Tran, Khanh-Hung, et al.
Published: (2023)

A Parameterized Barzilai-Borwein Method via Interpolated Least Squares
by: Xu, Xin
Published: (2024)

On Convergence of Regularized Barzilai-Borwein Method
by: Xu, Xin
Published: (2025)

Parallelizing the Circumcentered-Reflection Method
by: Barros, Pablo, et al.
Published: (2025)

Optimal Subgradient Methods for Lipschitz Convex Optimization with Error Bounds
by: Wang, Alex L.
Published: (2025)

Lipschitz-free Projected Subgradient Method with Time-varying Step-size
by: Xia, Yong, et al.
Published: (2024)

Convergence Rate of Projected Subgradient Method with Time-varying Step-sizes
by: Zhu, Zhihan, et al.
Published: (2024)

Gaussian smoothing gradient descent for minimizing functions (GSmoothGD)
by: Starnes, Andrew, et al.
Published: (2023)

Splitting the Conditional Gradient Algorithm
by: Woodstock, Zev, et al.
Published: (2023)

Interior-point algorithms with full Newton steps for nonsymmetric convex conic optimization
by: Papp, Dávid, et al.
Published: (2025)

On Lagrange multipliers of constrained optimization in Hilbert spaces
by: Tan, Zhiyu
Published: (2023)

Randomized Subspace Nesterov Accelerated Gradient
by: Omiya, Gaku, et al.
Published: (2026)

A sensitivity-based method for bilevel optimization problems: Theoretical analysis and computational performance
by: Nolasco, Eduardo, et al.
Published: (2025)

A new dual spectral projected gradient method for log-determinant semidefinite programming with hidden clustering structures
by: Namchaisiri, Charles, et al.
Published: (2024)

Scaled Proximal Gradient Methods for Multiobjective Optimization: Improved Linear Convergence and Nesterov's Acceleration
by: Chen, Jian, et al.
Published: (2024)