相关论文: Q-quadratic convergence of the centralized circumc…

This paper is devoted to deriving the first circumcenter iteration scheme that does not employ a product space reformulation for finding a point in the intersection of two closed convex sets. We introduce a so-called centralized version of…

We study the convergence rate of the Circumcentered-Reflection Method (CRM) for solving the convex feasibility problem and compare it with the Method of Alternating Projections (MAP). Under an error bound assumption, we prove that both…

The ancient concept of circumcenter has recently given birth to the Circumcentered-Reflection method (CRM). CRM was first employed to solve best approximation problems involving affine subspaces. In this setting, it was shown to outperform…

We establish finite convergence of circumcentered-reflection method (CRM) for the case of intersection of two closed convex cones in a real Hilbert space. We apply this result to prove the finite convergence for two polyhedral sets in R^n.

The Circumcentered Reflection Method (CRM) is a recently developed projection method for solving convex feasibility problems. It offers preferable convergence properties compared to classic methods such as the Douglas-Rachford and the…

The circumcentered-reflection method (CRM) has been applied for solving convex feasibility problems. CRM iterates by computing a circumcenter upon a composition of reflections with respect to convex sets. Since reflections are based on…

The circumcentered-reflection method (CRM) has been recently proposed as a methodology for accelerating several algorithms for solving the Convex Feasibility Problem (CFP), equivalent to finding a common fixed-point of the orthogonal…

This paper introduces the Parallelized Circumcentered Reflection Method (P-CRM), a circumcentric approach that parallelizes the Circumcentered Reflection Method (CRM) for solving Convex Feasibility Problems in affine settings. Beyond…

We introduce the extended centralized circumcentered reflection method (ecCRM), a framework for two-set convex feasibility that encompasses the classical centralized CRM (cCRM) of Behling, Bello-Cruz, Iusem and Santos as a special case. Our…

Under conditions that prevent tangential intersection, we prove quadratic convergence of a projection algorithm for the feasibility problem of finding a point in the intersection of a smooth curve and line in $\mathbb{R}^2$. This nonconvex…

In view of the great performance of circumcentered isometry methods for solving the best approximation problem, in this work we further investigate the locally proper circumcenter mapping and circumcentered method. Various examples of…

Let X be an orbifold with crepant resolution Y. The Crepant Resolution Conjectures of Ruan and Bryan-Graber assert, roughly speaking, that the quantum cohomology of X becomes isomorphic to the quantum cohomology of Y after analytic…

We construct a Convolution Quadrature (CQ) scheme for the quasilinear subdiffusion equation of order $\alpha$ and supply it with the fast and oblivious implementation. In particular, we find a condition for the CQ to be admissible and…

We consider Riemannian optimization problems with inequality and equality constraints and analyze a class of Riemannian interior point methods for solving them. The algorithm of interest consists of outer and inner iterations. We show that,…

In this paper we present the successive centralization of the circumcenter reflection scheme with several control sequences for solving the convex feasibility problem in Euclidean space. Assuming that a standard error bound holds, we prove…

The objective of this paper is to understand the superlinear convergence behavior of the GMRES method when the coefficient matrix has clustered eigenvalues. In order to understand the phenomenon, we analyze the convergence using the…

In this paper, we present a variant of the circumcenter method for the Convex Feasibility Problem (CFP), ensuring finite convergence under a Slater assumption. The method replaces exact projections onto the convex sets with projections onto…

In this paper we consider the cubic regularization (CR) method for minimizing a twice continuously differentiable function. While the CR method is widely recognized as a globally convergent variant of Newton's method with superior iteration…

Random matrix theory (RMT) provides a powerful framework for analyzing universal features of strongly coupled physical systems. In quantum chromodynamics (QCD), cold quark matter at asymptotically high density is expected to exhibit color…

In this paper, a reconstruction method for the spatially distributed dielectric constant of a medium from the back scattering wave field in the frequency domain is considered. Our approach is to propose a globally convergent algorithm,…