Cover Image

Swarm-Based Gradient Descent Method for Non-Convex Optimization

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Lu, Jingcheng, Tadmor, Eitan, Zenginoglu, Anil
Format:	Preprint
Published:	2022
Subjects:	Numerical Analysis Optimization and Control 90C26, 65K10, 92D25
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

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

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

Adaptive Preconditioned Gradient Descent with Energy
by: Liu, Hailiang, et al.
Published: (2023)

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

Nonsmooth Convex Optimization using the Specular Gradient Method with Root-Linear Convergence
by: Jung, Kiyuob, et al.
Published: (2024)

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

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

A Symplectic Discretization Based Proximal Point Algorithm for Convex Minimization
by: Yuan, Ya-xiang, et al.
Published: (2024)

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

Global Descent Method for Non-convex Multi-objective Optimization Problems
by: Adhikary, Bikram, et al.
Published: (2025)

A Trust Region Proximal Gradient Method for Nonlinear Multi-objective Optimization Problems
by: Ansary, Md Abu Talhamainuddin
Published: (2024)

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

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

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)

Grassmannian optimization is NP-hard
by: Lai, Zehua, et al.
Published: (2024)

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

Heavy Ball Momentum for Non-Strongly Convex Optimization
by: Aujol, Jean-François, 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)

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

An adaptive framework for first-order gradient methods
by: Hu, Xiaozhe, et al.
Published: (2026)

A Stochastic Gradient Descent Method for Globally Minimizing Nearly Convex Functions
by: Bao, Chenglong, et al.
Published: (2025)

An Adaptive Order Caputo Fractional Gradient Descent Method for Multi-objective Optimization Problems
by: Shaw, Barsha, et al.
Published: (2025)

Subgradient Regularization: A Descent-Oriented Subgradient Method for Nonsmooth Optimization
by: Li, Hanyang, et al.
Published: (2025)

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

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

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

Bilevel Learning via Inexact Stochastic Gradient Descent
by: Salehi, Mohammad Sadegh, et al.
Published: (2025)

The Global R-linear Convergence of Nesterov's Accelerated Gradient Method with Unknown Strongly Convex Parameter
by: Bao, Chenglong, et al.
Published: (2023)

Parameter-Free Accelerated Quasi-Newton Method for Nonconvex Optimization
by: Marumo, Naoki
Published: (2025)

cuHALLaR: A GPU Accelerated Low-Rank Augmented Lagrangian Method for Large-Scale Semidefinite Programming
by: Aguirre, Jacob M., et al.
Published: (2025)

Discretization of Total Variation in Optimization with Integrality Constraints
by: Schiemann, Annika, et al.
Published: (2024)

Preconditioned primal-dual dynamics in convex optimization: non-ergodic convergence rates
by: Apidopoulos, Vassilis, et al.
Published: (2025)

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 Inexact Boosted Difference of Convex Algorithm for Nondifferentiable Functions
by: Ferreira, Orizon P., et al.
Published: (2024)

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)

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

On Averaging and Extrapolation for Gradient Descent
by: Luner, Alan, et al.
Published: (2024)

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