:: Library Catalog

Cover Image

Saved in:

Bibliographic Details
Main Authors:	Karmarkar, Tanmaya, Lucet, Yves
Format:	Preprint
Published:	2025
Subjects:	Optimization and Control Symbolic Computation 90C25, 65K10, 49M29, 26B25
Online Access:	https://arxiv.org/abs/2505.06442
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

The Influence of an Adjoint Mismatch on the Primal-Dual Douglas-Rachford Method
by: Naldi, Emanuele, 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)

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

New Primal-Dual Algorithm for Convex Problems
by: Liu, Shuning, et al.
Published: (2025)

Accelerated primal dual fixed point algorithm
by: Zhu, Ya-Nan
Published: (2025)

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

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

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

Nonlinear conjugate gradient for smooth convex functions
by: Karimi, Sahar, et al.
Published: (2021)

On the Douglas-Rachford and Peaceman-Rachford algorithms in the presence of uniform monotonicity and the absence of minimizers
by: Burachik, Regina S., et al.
Published: (2022)

ItsOPT: An inexact two-level smoothing framework for nonconvex optimization via high-order Moreau envelope
by: Kabgani, Alireza, et al.
Published: (2024)

A double iteratively reweighted algorithm for solving group sparse nonconvex optimization models
by: Nie, Wanqin, et al.
Published: (2025)

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

A Tunneling Method for Nonlinear Multi-objective Optimization Problems
by: Adhikary, Bikram, et al.
Published: (2024)

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

One-parameter Filled Function Method for Non-convex Multi-objective Optimization Problems
by: Adhikary, Bikram, et al.
Published: (2026)

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)

A full splitting algorithm for structured difference-of-convex programs
by: Bot, Radu Ioan, et al.
Published: (2025)

On a robust approach to "split" feasibility problems: solvability and global error bound conditions
by: Uderzo, Amos
Published: (2025)

ItsDEAL: Inexact two-level smoothing descent algorithms for weakly convex optimization
by: Kabgani, Alireza, et al.
Published: (2025)

A new Lagrangian approach to control affine systems with a quadratic Lagrange term
by: Leyendecker, Sigrid, et al.
Published: (2023)

Forward-Reflected-Backward and Shadow-Douglas--Rachford with partial inverse for Solving Monotone Inclusions
by: Roldán, Fernando
Published: (2023)

The Chambolle-Pock method also converges weakly with $0 < θ\le 1$ and $τσ\|L\|^{2} < 4θ(2-θ)/(1 - 2θ+ 9θ^{2} - 4θ^{3})$
by: Upadhyaya, Manu
Published: (2026)

Stability of Nonhomogeneous Split Equality and Split Feasibility Problems with Possibly Nonconvex Constraint Sets
by: Huong, Vu Thi, et al.
Published: (2024)

Stability analysis of split equality and split feasibility problems
by: Huong, Vu Thi, et al.
Published: (2024)

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

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

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

A cut-and-project perspective for linearized Bregman iterations
by: Dai, Yu-Hong, et al.
Published: (2024)

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

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

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

The Golden Ratio Proximal ADMM with Norm Independent Step-Sizes for Separable Convex Optimization
by: Soe, Santanu, 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)

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

Recognizing weighted means in geodesic spaces
by: Goodwin, Ariel, et al.
Published: (2024)

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

A $\operatorname{prox}$-Based Semi-Smooth Newton Method for TV-Minimization
by: Bartels, Sören, et al.
Published: (2026)

A Flexible Algorithmic Framework for Strictly Convex Quadratic Minimization
by: MacDonald, Liam, et al.
Published: (2025)

Optimality conditions via exact penalty functions
by: Ivanov, Vsevolod Ivanov
Published: (2026)