Related papers: Centering Projection Methods for Wavelet Feasibili…
A new family of wavelets is introduced, which is associated with Legendre polynomials. These wavelets, termed spherical harmonic or Legendre wavelets, possess compact support. The method for the wavelet construction is derived from the…
In analogy with steerable wavelets, we present a general construction of adaptable tight wavelet frames, with an emphasis on scaling operations. In particular, the derived wavelets can be "dilated" by a procedure comparable to the operation…
In this series of eight papers we present the applications of methods from wavelet analysis to polynomial approximations for a number of accelerator physics problems. In this part, according to variational approach we obtain a…
Due to their adaptive nature, empirical wavelets had several successes in many fields from engineering, science, medical signal/image processing. Recently, a general theoretical framework has been developed in the one-dimensional case,…
In this paper we consider applications of methods from wavelet analysis to nonlinear dynamical problems related to accelerator physics. In our approach we take into account underlying algebraical, geometrical and topological structures of…
The representation of discrete, compact wavelet transformations (WTs) as circuits of local unitary gates is discussed. We employ a similar formalism as used in the multi-scale representation of quantum many-body wavefunctions using unitary…
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…
A general greedy approach to construct coverings of compact metric spaces by metric balls is given and analyzed. The analysis is a continuous version of Chvatal's analysis of the greedy algorithm for the weighted set cover problem. The…
There are different solution concepts for convex vector optimization problems (CVOPs) and a recent one, which is motivated from a set optimization point of view, consists of finitely many efficient solutions that generate polyhedral inner…
In recent years, a rapidly growing literature has focussed on the construction of wavelet systems to analyze functions defined on the sphere. Our purpose in this paper is to generalize these constructions to situations where sections of…
We study minimization of a structured objective function, being the sum of a smooth function and a composition of a weakly convex function with a linear operator. Applications include image reconstruction problems with regularizers that…
The notion of wavelets is defined. It is briefly described {\it what} are wavelets, {\it how} to use them, {\it when} we do need them, {\it why} they are preferred and {\it where} they have been applied. Then one proceeds to the…
In this work we consider an iterative method for solving the quasi-convex feasibility problem. We firstly introduce the so-called star subgradient projection operator and present some useful properties. We subsequently obtain a convergence…
Projection methods are popular algorithms for iteratively solving feasibility problems in Euclidean or even Hilbert spaces. They employ (selections of) nearest point mappings to generate sequences that are designed to approximate a point in…
We introduce Patchwork, a new general-purpose shape representation capable of modeling 2D and 3D geometry with a small number of parameters. Patchwork is grounded in a rigorous mathematical framework, providing provable complexity bounds…
This paper deals with a modifed iterative projection method for approximating a solution of hierarchical fixed point problems for nearly nonexpansive mappings. Some strong convergence theorems for the proposed method are presented under…
For a given symmetric refinable mask obeying the sum rule of order $n$, an explicit method is suggested for the construction of mutually symmetric almost frame-like wavelet system providing approximation order $n$. A transformation based on…
Scale-discretised wavelets yield a directional wavelet framework on the sphere where a signal can be probed not only in scale and position but also in orientation. Furthermore, a signal can be synthesised from its wavelet coefficients…
In this paper, we consider convex feasibility problems where the underlying sets are loosely coupled, and we propose several algorithms to solve such problems in a distributed manner. These algorithms are obtained by applying proximal…
We study the possible regularization of collision solutions for one centre problems with a weak singularity. In the case of logarithmic singularities, we consider the method of regularization via smoothing of the potential. With this…