:: Library Catalog

Cover Image

Saved in:

Bibliographic Details
Main Author:	Wang, Jun-Kun
Format:	Preprint
Published:	2024
Subjects:	Optimization and Control
Online Access:	https://arxiv.org/abs/2402.13988
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Quantum Hamiltonian Descent for Non-smooth Optimization
by: Leng, Jiaqi, et al.
Published: (2025)

Perturbed Gradient Descent via Convex Quadratic Approximation for Nonconvex Bilevel Optimization
by: Abolfazli, Nazanin, et al.
Published: (2025)

When Descent Is Too Stable: Event-Triggered Hamiltonian Learning to Optimize
by: Wang, Yi, et al.
Published: (2026)

Revisiting Stochastic Gradient Descent for Strongly Convex Objectives: Tight Uniform-in-Time Bounds
by: Chen, Kang, et al.
Published: (2025)

Quantum Optimization via Gradient-Based Hamiltonian Descent
by: Leng, Jiaqi, et al.
Published: (2025)

Quantum Hamiltonian Descent based Augmented Lagrangian Method for Constrained Nonconvex Nonlinear Optimization
by: Li, Mingze, et al.
Published: (2025)

Riemannian Inexact Gradient Descent for Quadratic Discrimination
by: Talwar, Uday, et al.
Published: (2025)

QHDOPT: A Software for Nonlinear Optimization with Quantum Hamiltonian Descent
by: Kushnir, Samuel, et al.
Published: (2024)

Gradient Descent for Convex and Smooth Noisy Optimization
by: Hu, Feifei, et al.
Published: (2024)

Hamiltonian Descent Algorithms for Optimization: Accelerated Rates via Randomized Integration Time
by: Fu, Qiang, et al.
Published: (2025)

Online Convex Optimization Using Coordinate Descent Algorithms
by: Lin, Yankai, et al.
Published: (2022)

Adaptive Accelerated Gradient Descent Methods for Convex Optimization
by: Xu, Zeyi, et al.
Published: (2026)

Lipschitz-Free Mirror Descent Methods for Relatively Strongly Convex Functions with/without Absolute and Relative Inexactness
by: Alkousa, Mohammad S., et al.
Published: (2026)

Asynchronous Decentralized SGD under Non-Convexity: A Block-Coordinate Descent Framework
by: Zhou, Yijie, et al.
Published: (2025)

A Proximal Descent Method for Minimizing Weakly Convex Optimization
by: Liao, Feng-Yi, et al.
Published: (2025)

On a Family of Relaxed Gradient Descent Methods for Quadratic Minimization
by: MacDonald, Liam, et al.
Published: (2024)

More Optimal Fractional-Order Stochastic Gradient Descent for Non-Convex Optimization Problems
by: Partohaghighi, Mohammad, et al.
Published: (2025)

Effective Dimension Aware Fractional-Order Stochastic Gradient Descent for Convex Optimization Problems
by: Partohaghighi, Mohammad, et al.
Published: (2025)

A Homogeneous Second-Order Descent Ascent Algorithm for Nonconvex-Strongly Concave Minimax Problems
by: Chen, Jia-Hao, et al.
Published: (2026)

Analysis of Gradient Descent with Varying Step Sizes using Integral Quadratic Constraints
by: Padmanabhan, Ram, et al.
Published: (2022)

The Sample Complexity of Gradient Descent in Stochastic Convex Optimization
by: Livni, Roi
Published: (2024)

The Randomized Block Coordinate Descent Method in the Hölder Smooth Setting
by: Maia, Leandro Farias, et al.
Published: (2024)

Block Coordinate Descent Network Simplex Methods for Optimal Transport
by: Li, Lingrui, et al.
Published: (2025)

Descent-Net: Learning Descent Directions for Constrained Optimization
by: Zhou, Zisheng, et al.
Published: (2025)

A Mirror Descent Perspective of Smoothed Sign Descent
by: Wang, Shuyang, et al.
Published: (2024)

A New Inexact Gradient Descent Method with Applications to Nonsmooth Convex Optimization
by: Khanh, Pham Duy, et al.
Published: (2023)

Projected Block Coordinate Descent for sparse spike estimation
by: Bénard, Pierre-Jean, et al.
Published: (2024)

Random Coordinate Descent on the Wasserstein Space of Probability Measures
by: Xu, Yewei, et al.
Published: (2026)

Stochastic Adaptive Gradient Descent Without Descent
by: Aujol, Jean-François, et al.
Published: (2025)

Quantum Natural Stochastic Pairwise Coordinate Descent
by: Sohail, Mohammad Aamir, et al.
Published: (2024)

Differentially Private Random Block Coordinate Descent
by: Maranjyan, Artavazd, et al.
Published: (2024)

Distributed Stochastic Block Coordinate Descent for Time-Varying Multi-Agent Optimization
by: Yu, Zhan, et al.
Published: (2019)

Provable Benefit of Random Permutations over Uniform Sampling in Stochastic Coordinate Descent
by: Kim, Donghwa, et al.
Published: (2025)

Computing Stationary Distribution via Dirichlet-Energy Minimization by Coordinate Descent
by: Avrachenkov, Konstantin, et al.
Published: (2026)

Natural Gradient Descent for Control
by: Esmzad, Ramin, et al.
Published: (2025)

Tight Analysis of Difference-of-Convex Algorithm (DCA) Improves Convergence Rates for Proximal Gradient Descent
by: Rotaru, Teodor, et al.
Published: (2025)

Lipschitz-Free Mirror Descent Methods for Non-Smooth Optimization Problems
by: Yuan, Bowen, et al.
Published: (2025)

Local Curvature Descent: Squeezing More Curvature out of Standard and Polyak Gradient Descent
by: Richtárik, Peter, et al.
Published: (2024)

Open Problem: Anytime Convergence Rate of Gradient Descent
by: Kornowski, Guy, et al.
Published: (2024)

On Gradient Descent Ascent for Nonconvex-Concave Minimax Problems
by: Lin, Tianyi, et al.
Published: (2019)