Related papers: The Weak Chebyshev Greedy Algorithm (WCGA) in $L^p…

We incorporate an iteratively reweighted strategy in the manifold proximal point algorithm (ManPPA) in [12] to solve an enhanced sparsity inducing model for identifying sparse yet nonzero vectors in a given subspace. We establish the global…

We prove various Hardy-type and uncertainty inequalities on a stratified Lie group $G$. In particular, we show that the operators $T_\alpha: f \mapsto |.|^{-\alpha} L^{-\alpha/2} f$, where $|.|$ is a homogeneous norm, $0 < \alpha < Q/p$,…

Concerned with the Stokes systems with rapidly oscillating periodic coefficients, we mainly extend the recent works in \cite{SGZWS,G} to those in term of Lipschitz domains. The arguments employed here are quite different from theirs, and…

In this paper we proof that there exists a function f(x) belongs to L^1[0,1] such that a greedy algorithm with regard to generalized Walsh system does not converge to f(x) in L^1[0,1] norm, i.e. the generalized Walsh system is not a…

Let $G$ be a locally compact, compactly generated group of polynomial growth and let $\omega$ be a weight on $G$. Under proper assumptions on the weight $\omega$, the Banach space $L^p(G,\omega)$ is a Banach \ast-algebra. In this paper we…

Let $0<\alpha<2$, $\beta>0$ and $\alpha/2<|s|\leq 1$. In a previous work, we obtained all possible values of the Lebesgue exponent $p=p(\gamma)$ for which the Fourier transform of $ E_{\alpha,\beta}(e^{\dot{\imath}\pi s} |\cdot|^{\gamma} )$…

We study the complexity of finding the global solution to stochastic nonconvex optimization when the objective function satisfies global Kurdyka-Lojasiewicz (KL) inequality and the queries from stochastic gradient oracles satisfy mild…

We construct two counterexamples that resolve long-standing open problems on greedy approximation theory with respect to bases, posed in [F. Albiac et al., Dissertationes Math. 560 (2021)] and restated in [F. Albiac, J. L. Ansorena, V.…

The goal of this paper is to study the performance of the Thresholding Greedy Algorithm (TGA) when we increase the size of greedy sums by a constant factor $\lambda\geqslant 1$. We introduce the so-called $\lambda$-almost greedy and…

We establish up to the boundary regularity estimates in weighted $L^{p}$ spaces with Muckenhoupt weights $A_{p}$ for weak solutions to the Hodge systems \begin{align*} d^{\ast}\left(Ad\omega\right) +…

This article develops a new theoretical basis for decomposing signals that are formed by the linear superposition of a finite number of modes. Each mode depends nonlinearly upon several parameters; we seek both these parameters and the…

In this paper a reduction and equivalence theorems for the boundedness of the composition of a quasilinear operator $T$ with the Hardy and Copson operators in weighted Lebesgue spaces are proved. New equivalence theorems are obtained for…

Our first result is a noncommutative form of Jessen/Marcinkiewicz/Zygmund theorem for the maximal limit of multiparametric martingales or ergodic means. It implies bilateral almost uniform convergence with initial data in the expected…

In this paper we consider the $L_q$-approximation of multivariate periodic functions $f$ with $L_p$-bounded mixed derivative (difference). The (possibly non-linear) reconstruction algorithm is supposed to recover the function from function…

In this paper we consider the generalized Walsh system and a problem $L^1- convergence$ of greedy algorithm of functions after changing the values on small set.

The weak boundedness property associated with a standard alpha-fractional Calderon-Zygmund operator and a weight pair is good-lambda controlled by the testing conditions and the Muckenhoupt and energy side conditions. As a consequence,…

This paper presents a generalization of the "weighted least-squares" (WLS), named "weighted pairing least-squares" (WPLS), which uses a rectangular weight matrix and is suitable for data alignment problems. Two fast solving methods,…

We investigate the continuous analogue of the Cholesky factorization, namely the pivoted Cholesky algorithm. Our analysis establishes quantitative convergence guarantees for kernels of minimal smoothness. We prove that for a symmetric…

We establish weak-type $(1,1)$ bounds for the maximal function associated with ergodic averaging operators modeled on a wide class of thin deterministic sets $B$. As a corollary we obtain the corresponding pointwise convergence result on…

This paper concerns quasi-stochastic approximation (QSA) to solve root finding problems commonly found in applications to optimization and reinforcement learning. The general constant gain algorithm may be expressed as the…