Search
Search Results
-
Low-rank nonnegative tensor approximation via alternating projections and sketching
We show how to construct nonnegative low-rank approximations of nonnegative tensors in Tucker and tensor train formats. We use alternating...
-
Strong Convergence of Alternating Projections
In this paper, we provide a necessary and sufficient condition under which the method of alternating projections on Hadamard spaces converges...
-
-
Exact convergence rates of alternating projections for nontransversal intersections
We consider the convergence rate of the alternating projection method for the nontransversal intersection of a semialgebraic set and a linear...
-
Alternating Projections with Applications to Gerchberg-Saxton Error Reduction
We consider convergence of alternating projections between non-convex sets and obtain applications to convergence of the Gerchberg-Saxton error...
-
A penalized method of alternating projections for weighted low-rank hankel matrix optimization
Weighted low-rank Hankel matrix optimization has long been used to reconstruct contaminated signal or forecast missing values for time series of a...
-
Augmented cellular alternating links in thickened surfaces are hyperbolic
Menasco proved that non-trivial links in the 3-sphere with connected prime alternating non-2-braid projections are hyperbolic. This was further...
-
Alternating Projection Method for Intersection of Convex Sets, Multi-Agent Consensus Algorithms, and Averaging Inequalities
AbstractThe history of the alternating projection method for finding a common point of several convex sets in Euclidean space goes back to the...
-
The circumcentered-reflection method achieves better rates than alternating projections
We study the convergence rate of the Circumcentered-Reflection Method (CRM) for solving the convex feasibility problem and compare it with the Method...
-
A variational approach to the alternating projections method
The 2-sets convex feasibility problem aims at finding a point in the nonempty intersection of two closed convex sets A and B in a Hilbert space H ....
-
Random Projections for Semidefinite Programming
Random projections can reduce the dimensionality of point sets while kee** approximate congruence. Applying random projections to optimization...
-
A Non-monotone Alternating Newton-Like Directional Method for Low-Rank and Sparse Matrix Compressive Recovery
With wide-spread real-world applications, low-rank and sparse matrix recovery, where the concerned matrix with incomplete data is divided into a...
-
The convergence properties of infeasible inexact proximal alternating linearized minimization
The proximal alternating linearized minimization (PALM) method suits well for solving block-structured optimization problems, which are ubiquitous in...
-
On Generalized Gauss–Radau Projections and Optimal Error Estimates of Upwind-Biased DG Methods for the Linear Advection Equation on Special Simplex Meshes
Generalized Gauss–Radau (GGR) projections are global projection operators that are widely used for the error analysis of discontinuous Galerkin (DG)...
-
Operator L2-Estimates for Two-Dimensional Problems with Rapidly Alternating Boundary Conditions
We consider a second order operator with complex coefficients in a plane domain with the Dirichlet boundary condition and the nonlinear third kind...
-
Alternating conditional gradient method for convex feasibility problems
The classical convex feasibility problem in a finite dimensional Euclidean space consists of finding a point in the intersection of two convex sets....
-
Solving Blind Ptychography Effectively Via Linearized Alternating Direction Method of Multipliers
The problem of blind ptychography is to determine the specimen object and the scanning probe simultaneously from diffraction data. By formulating the...
-
On Dykstra’s algorithm: finite convergence, stalling, and the method of alternating projections
A popular method for finding the projection onto the intersection of two closed convex subsets in Hilbert space is Dykstra’s algorithm. In this...
