Cover Image

A finitely convergent circumcenter method for the Convex Feasibility Problem

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Behling, Roger, Bello-Cruz, Yunier, Iusem, Alfredo, Liu, Di, Santos, Luiz-Rafael
Format:	Preprint
Published:	2023
Subjects:	Optimization and Control 49M27, 65K05, 65B99, 90C25
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

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

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

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

Error Bounds for a Class of Cone-Convex Inclusion Problems
by: Huy, Nguyen Quang, et al.
Published: (2025)

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

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

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

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

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

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

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

A distributed proximal splitting method with linesearch for locally Lipschitz gradients
by: Atenas, Felipe, et al.
Published: (2024)

Deep Centralization for the Circumcentered Reflection Method
by: Barros, Pablo
Published: (2025)

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

A Jacobi-type Newton method for Nash equilibrium problems with descent guarantees
by: Kolossoski, Oliver, et al.
Published: (2022)

Tikhonov Regularization for Stochastic Non-Smooth Convex Optimization in Hilbert Spaces
by: Maulen-Soto, Rodrigo, 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)

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

Adaptive Dimension Reduction for Overlapping Group Sparsity
by: Bai, Yifan, et al.
Published: (2026)

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

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

Optimization landscape of $\ell_0$-Bregman relaxations
by: Chirinos-Rodríguez, Jonathan, et al.
Published: (2025)

Solving Semi-Discrete Optimal Transport Problems: star shapedeness and Newton's method
by: Dieci, Luca, et al.
Published: (2023)

Stochastic Inertial Dynamics Via Time Scaling and Averaging
by: Maulen-Soto, Rodrigo, et al.
Published: (2024)

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

Fast convex optimization via closed-loop time scaling of gradient dynamics
by: Attouch, Hedy, et al.
Published: (2023)

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

Robust optimality and duality for composite uncertain multiobjective optimization in Asplund spaces with its applications
by: Saadati, Maryam, et al.
Published: (2022)

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

Nonsmooth Projection-Free Optimization with Functional Constraints
by: Asgari, Kamiar, et al.
Published: (2023)

Stochastic Block Bregman Projection with Polyak-like Stepsize for Possibly Inconsistent Convex Feasibility Problems
by: Zhang, Lu, et al.
Published: (2026)

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

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

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

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

GLL-type Nonmonotone Descent Methods Revisited under Kurdyka-Łojasiewicz Property
by: Qian, Yitian, et al.
Published: (2025)

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

A Proximal-Gradient Method for Solving Regularized Optimization Problems with General Constraints
by: Curtis, Frank E., 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)

Inertial Methods with Viscous and Hessian driven Damping for Non-Convex Optimization
by: Maulen-Soto, Rodrigo, et al.
Published: (2024)