Cover Image

Adaptive Preconditioned Gradient Descent with Energy

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Liu, Hailiang, Nurbekyan, Levon, Tian, Xuping, Yang, Yunan
Format:	Preprint
Published:	2023
Subjects:	Optimization and Control Numerical Analysis 65K10, 90C26
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Swarm-Based Gradient Descent Method for Non-Convex Optimization
by: Lu, Jingcheng, et al.
Published: (2022)

A New Linear Programming Approach and a New Backtracking Strategy for Multiple-Gradient Descent in Multi-Objective Optimization
by: Della Santa, Francesco
Published: (2024)

Inf-Sup neural networks for high-dimensional elliptic PDE problems
by: Huo, Xiaokai, et al.
Published: (2024)

Stochastic momentum ADMM for nonconvex and nonsmooth optimization with application to PnP algorithm
by: Deng, Kangkang, et al.
Published: (2025)

Discovering new phases via computing second-order stationary states of Landau-Brazovskii model
by: Bao, Chenglong, et al.
Published: (2026)

Dynamic behavior for a gradient algorithm with energy and momentum
by: Liu, Hailiang, et al.
Published: (2022)

SVD-Preconditioned Gradient Descent Method for Solving Nonlinear Least Squares Problems
by: Chang, Zhipeng, et al.
Published: (2026)

Inexact Riemannian Gradient Descent Method for Nonconvex Optimization
by: Zhou, Juan, et al.
Published: (2024)

Globally Optimal Solutions to a Class of Fractional Optimization Problems Based on Proximal Gradient Algorithm
by: Lin, Yizun, et al.
Published: (2023)

An Algebraically Converging Stochastic Gradient Descent Algorithm for Global Optimization
by: Engquist, Björn, et al.
Published: (2022)

A preconditioned difference of convex functions algorithm with extrapolation and line search
by: Zhang, Ran, et al.
Published: (2025)

Swarm-based optimization with random descent
by: Tadmor, Eitan, et al.
Published: (2023)

A Globally Convergent Third-Order Newton Method via Unified Semidefinite Programming Subproblems
by: Cai, Yubo, et al.
Published: (2026)

Swarm-based gradient descent meets simulated annealing
by: Ding, Zhiyan, et al.
Published: (2024)

A Convergent ADMM Algorithm for Grain Boundary Energy Minimization
by: Wu, Yue, et al.
Published: (2024)

A low-rank augmented Lagrangian method for large-scale semidefinite programming based on a hybrid convex-nonconvex approach
by: Monteiro, Renato D. C., et al.
Published: (2024)

Swarm-based optimization with jumps: a kinetic BGK framework and convergence analysis
by: Borghi, Giacomo, et al.
Published: (2025)

Continuous iterative algorithms for anti-Cheeger cut
by: Shao, Sihong, et al.
Published: (2021)

Tight Error Bounds for the Sign-Constrained Stiefel Manifold
by: Chen, Xiaojun, et al.
Published: (2022)

Projected gradient descent accumulates at Bouligand stationary points
by: Olikier, Guillaume, et al.
Published: (2024)

EnKSGD: A Class Of Preconditioned Black Box Optimization And Inversion Algorithms
by: Irwin, Brian, et al.
Published: (2023)

Convergence of Descent Optimization Algorithms under Polyak-Łojasiewicz-Kurdyka Conditions
by: Bento, G. C., et al.
Published: (2024)

Nonlinear tomographic reconstruction via nonsmooth optimization
by: Charisopoulos, Vasileios, et al.
Published: (2024)

ASPEN: An Additional Sampling Penalty Method for Finite-Sum Optimization Problems with Nonlinear Equality Constraints
by: Krejić, Nataša, et al.
Published: (2025)

Computing the Proximal Operator of the $q$-th Power of the $\ell_{1,q}$-norm for Group Sparsity
by: Lin, Rongrong, et al.
Published: (2024)

A simple iterative algorithm for maxcut
by: Shao, Sihong, et al.
Published: (2018)

AS-BOX: Additional Sampling Method for Weighted Sum Problems with Box Constraints
by: Krejić, Nataša, et al.
Published: (2025)

Adaptive Stochastic Gradient Descent Ascent Algorithm for Nonconvex Minimax Problems with Decision-Dependent Distributions
by: Gao, Yan, et al.
Published: (2025)

On the Global Convergence of Particle Swarm Optimization Methods
by: Huang, Hui, et al.
Published: (2022)

Consensus-Based Optimization Methods Converge Globally
by: Fornasier, Massimo, et al.
Published: (2021)

Convergence of Anisotropic Consensus-Based Optimization in Mean-Field Law
by: Fornasier, Massimo, et al.
Published: (2021)

Implicit augmented Lagrangian and generalized optimization
by: De Marchi, Alberto
Published: (2023)

On the role of semismoothness in nonsmooth numerical analysis: Theory
by: Gfrerer, H., et al.
Published: (2024)

On the role of semismoothness in the implicit programming approach to selected nonsmooth optimization problems
by: Gfrerer, Helmut, et al.
Published: (2024)

Proximal Gradient Descent Ascent Methods for Nonsmooth Nonconvex-Concave Minimax Problems on Riemannian Manifolds
by: Xie, Xiyuan, et al.
Published: (2025)

The Intrinsic Riemannian Proximal Gradient Method for Nonconvex Optimization
by: Bergmann, Ronny, et al.
Published: (2025)

An Additively Preconditioned Trust Region Strategy for Machine Learning
by: Alegría, Samuel Cruz, et al.
Published: (2025)

An apocalypse-free first-order low-rank optimization algorithm with at most one rank reduction attempt per iteration
by: Olikier, Guillaume, et al.
Published: (2022)

Low-rank optimization methods based on projected projected-gradient descent that accumulate at Bouligand stationary points
by: Olikier, Guillaume, et al.
Published: (2022)

Computing Bouligand stationary points efficiently in low-rank optimization
by: Olikier, Guillaume, et al.
Published: (2024)