Cover Image

Deep Centralization for the Circumcentered Reflection Method

Fuente: arXiv

Saved in:

Bibliographic Details
Main Author:	Barros, Pablo
Format:	Preprint
Published:	2025
Subjects:	Optimization and Control 65K05, 65B99, 90C25
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

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

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

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

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

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

Accelerating Diagonal Methods for Bilevel Optimization: Unified Convergence via Continuous-Time Dynamics
by: Boţ, Radu Ioan, et al.
Published: (2025)

Accelerated Gradient Methods with Gradient Restart: Global Linear Convergence
by: Bao, Chenglong, et al.
Published: (2024)

Sufficient Conditions for Error Distance Reduction in the (\ell^2)-norm Trust Region between Minimizers of Local Nonconvex Multivariate Quadratic Approximates
by: Xie, Pengcheng
Published: (2023)

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

Essential Convergence Rates of Continuous-Time Models for Optimization Methods
by: Ushiyama, Kansei, et al.
Published: (2025)

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

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

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

Preconditioned Proximal Gradient Methods with Conjugate Momentum: A Subspace Perspective
by: Chen, Jian, et al.
Published: (2026)

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

Dynamic FISTA for Convex Composite Bi-Level Optimization
by: Merchav, Roey, et al.
Published: (2024)

A Regression-Based Prediction-Correction Method for Stochastic Time-Varying Optimization Problems
by: Kamijima, Tomoya, et al.
Published: (2025)

A Random Active Set Method for Strictly Convex Quadratic Problem with Simple Bounds
by: Gu, Ran, et al.
Published: (2021)

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

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)

Relaxed and inertial nonlinear Forward-Backward algorithm
by: Maulén, Juan José, et al.
Published: (2025)

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

A Three-Operator Splitting Scheme Derived from Three-Block ADMM
by: Anshika, Anshika, et al.
Published: (2024)

Relaxed and Inertial Nonlinear Forward-Backward with Momentum
by: Roldán, Fernando, et al.
Published: (2024)

Forward Primal-Dual Half-Forward Algorithm for Splitting Four Operators
by: Roldán, Fernando
Published: (2023)

General Optimal Step-size for ADMM-type Algorithms: Domain Parametrization and Optimal Rates
by: Ran, Yifan
Published: (2023)

Simplex Frank-Wolfe: Linear Convergence and Its Numerical Efficiency for Convex Optimization over Polytopes
by: Wang, Haoning, et al.
Published: (2025)

Lipschitz continuity of solution multifunctions of extended $\ell_1$ regularization problems
by: Meng, Kaiwen, et al.
Published: (2024)

Performance Estimation for Smooth and Strongly Convex Sets
by: Luner, Alan, et al.
Published: (2024)

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

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

Extragradient method with feasible inexact projection to variational inequality problem
by: Millán, R. Díaz, et al.
Published: (2023)

Accuracy and Relationships of Quadratic Models in Derivative-free Optimization
by: Chen, Yiwen, et al.
Published: (2026)

Time-integrated Optimal Transport: A Robust Minimax Framework
by: Nguyen, Thai P. D., et al.
Published: (2025)

Heavy-ball dynamics with Hessian-driven damping for non-convex optimization under the Łojasiewicz condition
by: Apidopoulos, Vassilis, et al.
Published: (2025)

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

On Solution Uniqueness and Robust Recovery for Sparse Regularization with a Gauge: from Dual Point of View
by: He, Jiahuan, et al.
Published: (2023)

An SDE Perspective on Stochastic Inertial Gradient Dynamics with Time-Dependent Viscosity and Geometric Damping
by: Maulen-Soto, Rodrigo, et al.
Published: (2024)

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