اشترك بالحزمة الذهبية واحصل على وصول غير محدود شمرا أكاديميا
تسجيل مستخدم جديدCentering Projection Methods for Wavelet Feasibility Problems
119
0
0.0
(
0
)
اسأل ChatGPT حول البحث
ﻻ يوجد ملخص باللغة العربية
We revisit the feasibility approach to the construction of compactly supported smooth orthogonal wavelets on the line. We highlight its flexibility and illustrate how symmetry and cardinality properties are easily embedded in the design criteria. We solve the resulting wavelet feasibility problems using recently introduced centering methods, and we compare performance. Solutions admit real-valued compactly supported smooth orthogonal scaling functions and wavelets with near symmetry and near cardinality properties.
قيم البحث
اقرأ أيضاً
We propose finitely convergent methods for solving convex feasibility problems defined over a possibly infinite pool of constraints. Following other works in this area, we assume that the interior of the solution set is nonempty and that certain over
relaxation parameters form a divergent series. We combine our methods with a very general class of deterministic control sequences where, roughly speaking, we require that sooner or later we encounter a violated constraint if one exists. This requirement is satisfied, in particular, by the cyclic, repetitive and remotest set controls. Moreover, it is almost surely satisfied for random controls.
The decomposition of a matrix, as a product of factors with particular properties, is a much used tool in numerical analysis. Here we develop methods for decomposing a matrix $C$ into a product $X Y$, where the factors $X$ and $Y$ are required to min
imize their distance from an arbitrary pair $X_0$ and $Y_0$. This type of decomposition, a projection to a matrix product constraint, in combination with projections that impose structural properties on $X$ and $Y$, forms the basis of a general method of decomposing a matrix into factors with specified properties. Results are presented for the application of these methods to a number of hard problems in exact factorization.
Network systems consist of subsystems and their interconnections, and provide a powerful framework for analysis, modeling and control of complex systems. However, subsystems may have high-dimensional dynamics, and the amount and nature of interconnec
tions may also be of high complexity. Therefore, it is relevant to study reduction methods for network systems. An overview on reduction methods for both the topological (interconnection) structure of the network and the dynamics of the nodes, while preserving structural properties of the network, and taking a control systems perspective, is provided. First topological complexity reduction methods based on graph clustering and aggregation are reviewed, producing a reduced-order network model. Second, reduction of the nodal dynamics is considered by using extensions of classical methods, while preserving the stability and synchronization properties. Finally, a structure-preserving generalized balancing method for simplifying simultaneously the topological structure and the order of the nodal dynamics is treated.
Splitting methods like Douglas--Rachford (DR), ADMM, and FISTA solve problems whose objectives are sums of functions that may be evaluated separately, and all frequently show signs of spiraling. We show for prototypical feasibility problems that circ
umcentered-reflection method (CRM), subgradient projections, and Newton--Raphson are all describable as gradient-based methods for minimizing Lyapunov functions constructed for DR operators, with the former returning the minimizers of spherical surrogates for the Lyapunov function. We study the more general class of operators that minimize such surrogates. In particular, we introduce a new method that shares these properties but with the added advantages that it: 1) does not rely on subproblems (e.g. reflections) and so may be applied for any operator whose iterates spiral; 2) provably has the aforementioned Lyapunov properties with few structural assumptions and so is generically suitable for primal/dual implementation; and 3) maps spaces of reduced dimension into themselves whenever the original operator does. This makes possible the first primal/dual implementation of a method that seeks the center of spiraling iterates, which we describe, and provide a computed example (basis pursuit).
In this paper, we propose a catalog of iterative methods for solving the Split Feasibility Problem in the non-convex setting. We study four different optimization formulations of the problem, where each model has advantageous in different settings of
the problem. For each model, we study relevant iterative algorithms, some of which are well-known in this area and some are new. All the studied methods, including the well-known CQ Algorithm, are proven to have global convergence guarantees in the non-convex setting under mild conditions on the problems data.
سجل دخول لتتمكن من نشر تعليقات
التعليقات
جاري جلب التعليقات
سجل دخول لتتمكن من متابعة معايير البحث التي قمت باختيارها
