Cover Image

A distributed proximal splitting method with linesearch for locally Lipschitz gradients

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Atenas, Felipe, Dao, Minh N., Tam, Matthew K.
Format:	Preprint
Published:	2024
Subjects:	Optimization and Control 90C25, 68W15, 49M27, 65K05
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

A relaxed version of Ryu's three-operator splitting method for structured nonconvex optimization
by: Alcantara, Jan Harold, et al.
Published: (2025)

The iterates of FISTA convergence even under inexact computations and stochastic gradients
by: Salzo, Saverio
Published: (2025)

A proximal splitting algorithm for generalized DC programming with applications in signal recovery
by: Pham, Tan Nhat, et al.
Published: (2024)

Distributed Gradient-Regularized Newton Method: Scheduled Consensus and O(epsilon^{-1}) Global Iteration Complexity
by: Hu, Wei, et al.
Published: (2026)

Variable Stepsize Distributed Forward-Backward Splitting Methods as Relocated Fixed-Point Iterations
by: Atenas, Felipe, et al.
Published: (2026)

Understanding the Douglas-Rachford splitting method through the lenses of Moreau-type envelopes
by: Atenas, Felipe
Published: (2023)

Shadow splitting methods for nonconvex optimisation: epi-approximation, convergence and saddle point avoidance
by: Atenas, Felipe
Published: (2025)

On the boundedness of the sequence generated by minibatch stochastic gradient descent
by: Bauschke, Heinz H., et al.
Published: (2025)

Connections between convex optimization algorithms and subspace correction methods
by: Jiang, Boou, et al.
Published: (2025)

A proximal subgradient algorithm with extrapolation for structured nonconvex nonsmooth problems
by: Pham, Tan Nhat, et al.
Published: (2022)

Delayed Feedback in Online Non-Convex Optimization: A Non-Stationary Approach with Applications
by: Lara, Felipe, et al.
Published: (2024)

A finitely convergent circumcenter method for the Convex Feasibility Problem
by: Behling, Roger, et al.
Published: (2023)

Convergence of iterates and improved rates for accelerated augmented Lagrangian methods for linearly constrained convex optimization
by: He, Xin, et al.
Published: (2026)

Bregman Proximal Linearized ADMM for Minimizing Separable Sums Coupled by a Difference of Functions
by: Pham, Tan Nhat, et al.
Published: (2024)

Primal-Dual Coordinate Descent for Nonconvex-Nonconcave Saddle Point Problems Under the Weak MVI Assumption
by: Walwil, Iyad, et al.
Published: (2025)

MGProx: A nonsmooth multigrid proximal gradient method with adaptive restriction for strongly convex optimization
by: Ang, Andersen, et al.
Published: (2023)

The Golden Ratio Proximal ADMM with Norm Independent Step-Sizes for Separable Convex Optimization
by: Soe, Santanu, et al.
Published: (2025)

Parallel Polyhedral Projection Method for the Convex Feasibility Problem
by: Barros, Pablo, et al.
Published: (2025)

Fejér* monotonicity in optimization algorithms
by: Behling, Roger, et al.
Published: (2024)

Curvature-Aware Derivative-Free Optimization
by: Kim, Bumsu, et al.
Published: (2021)

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

An inertial iteratively regularized extragradient method for bilevel variational inequality problems
by: Alves, M. Marques, et al.
Published: (2025)

Visibility in Polygonal Environments with Holes: Finding Best Spots for Hiding and Surveillance
by: Banzal, Neilabh, et al.
Published: (2026)

Minimization Over the Nonconvex Sparsity Constraint Using A Hybrid First-order method
by: Yang, Xiangyu, et al.
Published: (2021)

Bregman proximal gradient method for linear optimization under entropic constraints
by: Briceño-Arias, Luis M., et al.
Published: (2025)

On the Convergence Rates of Iterative Regularization Algorithms for Composite Bi-Level Optimization
by: Shtern, Shimrit, et al.
Published: (2025)

Fast Reflected Forward-Backward algorithm: achieving fast convergence rates for convex optimization with linear cone constraints
by: Bot, Radu Ioan, et al.
Published: (2024)

An interior proximal gradient method for nonconvex optimization
by: De Marchi, Alberto, et al.
Published: (2022)

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

Linesearch-free adaptive Bregman proximal gradient for convex minimization without relative smoothness
by: Ou, Hongjia, et al.
Published: (2025)

Identification of Active Subfunctions in Finite-Max Minimisation via a Smooth Reformulation
by: Ras, Charl, et al.
Published: (2024)

An extension of the projected gradient method to a Banach space setting with application in structural topology optimization
by: Blank, Luise, et al.
Published: (2015)

Convergence of ZH-type nonmonotone descent method for Kurdyka-Łojasiewicz optimization problems
by: Qian, Yitian, et al.
Published: (2024)

Linear Convergence of Resolvent Splitting with Minimal Lifting and its Application to a Primal-Dual Algorithm
by: Simi, Farhana A., et al.
Published: (2024)

A full splitting algorithm for fractional programs with structured numerators and denominators
by: Boţ, Radu Ioan, et al.
Published: (2023)

A smoothed proximal trust-region algorithm for nonconvex optimization problems with $L^p$-regularization, $p\in (0,1)$
by: Antil, Harbir, et al.
Published: (2025)

Log-Averaged Mirror Prox for Fast, Large-Scale Optimal Transport in Linear Space
by: Burns, Matthew X., et al.
Published: (2025)

prunAdag: an adaptive pruning-aware gradient method
by: Porcelli, Margherita, et al.
Published: (2025)

On circumcentered direct methods for monotone variational inequality problems
by: Behling, Roger, et al.
Published: (2025)

Accelerated Proximal Gradient Methods in the affine-quadratic case: Strong convergence and limit identification
by: Moursi, Walaa M., et al.
Published: (2025)