Copertina

Swarm-based optimization with random descent

Fuente: arXiv

Salvato in:

Dettagli Bibliografici
Autori principali:	Tadmor, Eitan, Zenginoglu, Anil
Natura:	Preprint
Pubblicazione:	2023
Soggetti:	Optimization and Control Numerical Analysis 90C26, 65K10, 92D25
Accesso online:	Acceder al recurso
Tags:	Aggiungi Tag Nessun Tag, puoi essere il primo ad aggiungerne!!

Documenti analoghi

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

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

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

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

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

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

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

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

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

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

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

Complexity-optimal and parameter-free first-order methods for finding stationary points of composite optimization problems
di: Kong, Weiwei
Pubblicazione: (2022)

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

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

Wirtinger gradient descent methods for low-dose Poisson phase retrieval
di: Diederichs, Benedikt, et al.
Pubblicazione: (2024)

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

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

A User Manual for cuHALLaR: A GPU Accelerated Low-Rank Semidefinite Programming Solver
di: Aguirre, Jacob, et al.
Pubblicazione: (2025)

A proximal-gradient inertial algorithm with Tikhonov regularization: strong convergence to the minimal norm solution
di: László, Szilárd Csaba
Pubblicazione: (2024)

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

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

Convergence analysis of dynamical systems for optimization by an improved Lyapunov framework
di: Tabei, Atsushi, et al.
Pubblicazione: (2026)

Implicit augmented Lagrangian and generalized optimization
di: De Marchi, Alberto
Pubblicazione: (2023)

Stiefel optimization is NP-hard
di: Lai, Zehua, et al.
Pubblicazione: (2025)

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

A Busemann hybrid projection-proximal point algorithm for optimization problems on Hadamard manifolds
di: Millán, R. Díaz, et al.
Pubblicazione: (2026)

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

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

Convergence analysis of a primal-dual optimization-by-continuation algorithm
di: Loris, Ignace, et al.
Pubblicazione: (2023)

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

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

Monomial barrier functions for the box-constrained convex optimization problems
di: Fayed, Hatem
Pubblicazione: (2024)

Splitting the Conditional Gradient Algorithm
di: Woodstock, Zev, et al.
Pubblicazione: (2023)

A general framework for floating point error analysis of simplex derivatives
di: Chen, Yiwen, et al.
Pubblicazione: (2024)

Solving nonconvex optimization problems via a second order dynamical system with unbounded damping
di: László, Szilárd Csaba
Pubblicazione: (2025)

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

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

An accelerated randomized Bregman-Kaczmarz method for strongly convex linearly constraint optimization
di: Tondji, Lionel, et al.
Pubblicazione: (2025)

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

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