Imagen de Portada

Deep Centralization for the Circumcentered Reflection Method

Fuente: arXiv

Guardado en:

Detalles Bibliográficos
Autor principal:	Barros, Pablo
Formato:	Preprint
Publicado:	2025
Materias:	Optimization and Control 65K05, 65B99, 90C25
Acceso en línea:	Acceder al recurso
Etiquetas:	Agregar Etiqueta Sin Etiquetas, Sea el primero en etiquetar este registro!

Ejemplares similares

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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