中文
相关论文

相关论文: The Weak Chebyshev Greedy Algorithm (WCGA) in $L^p…

200 篇论文

Assume that $p\in(1,\infty]$ and $u=P_{h}[\phi]$, where $\phi\in L^{p}(\mathbb{S}^{n-1},\mathbb{R}^{n})$. Then for any $x\in \mathbb{B}^{n}$, we obtain the sharp inequalities $$ |u(x)|\leq…

经典分析与常微分方程 · 数学 2020-05-29 Jiaolong Chen , David Kalaj

For the Hardy-Littlewood maximal and Calder\'on-Zygmund operators, the weighted boundedness on the Lebesgue spaces are well known. We extend these to the Orlicz-Morrey spaces. Moreover, we prove the weighted boundedness on the weak…

泛函分析 · 数学 2021-09-21 Ryota Kawasumi , Eiichi Nakai

We develop and analyze stochastic optimization algorithms for problems in which the expected loss is strongly convex, and the optimum is (approximately) sparse. Previous approaches are able to exploit only one of these two structures,…

机器学习 · 统计学 2012-07-19 Alekh Agarwal , Sahand Negahban , Martin J. Wainwright

We consider a sparse high dimensional regression model where the goal is to recover a $k$-sparse unknown vector $\beta^*$ from $n$ noisy linear observations of the form $Y=X\beta^*+W \in \mathbb{R}^n$ where $X \in \mathbb{R}^{n \times p}$…

统计理论 · 数学 2019-09-24 David Gamarnik , Ilias Zadik

We present a variant of accelerated gradient descent algorithms, adapted from Nesterov's optimal first-order methods, for weakly-quasi-convex and weakly-quasi-strongly-convex functions. We show that by tweaking the so-called estimate…

最优化与控制 · 数学 2020-06-16 Jingjing Bu , Mehran Mesbahi

The purpose of this paper is to study the existence of weak solutions for some classes of one-parameter subelliptic gradient-type systems involving a Sobolev-Hardy potential defined on an unbounded domain $\Omega_\psi$ of the Heisenberg…

偏微分方程分析 · 数学 2020-04-27 Giovanni Molica Bisci , Dušan D. Repovš

In \cite{g5}, we defined and investigated the grand Wiener amalgam space $W(L^{p),\theta_1}(\Omega), L^{q),\theta_2}(\Omega))$ , where $1<p,q<\infty, \theta_1>0, \theta_2>0$, $\Omega\subset\mathbb R^{n} $ and the Lebesgue measure of…

泛函分析 · 数学 2024-10-22 A. Turan Gürkanlı

Graph sparsification is to approximate an arbitrary graph by a sparse graph and is useful in many applications, such as simplification of social networks, least squares problems, numerical solution of symmetric positive definite linear…

数据结构与算法 · 计算机科学 2021-02-23 Ming-Jun Lai , Jiaxin Xie , Zhiqiang Xu

In this paper, our main purpose is to establish a weak factorization of the classical Hardy spaces in terms of a multilinear Calder\'on-Zygmund operator on the ball Banach function spaces. Furthermore, a new characterization of the BMO…

泛函分析 · 数学 2024-11-12 Yichun Zhao , Xiangxing Tao , Jiang Zhou

We prove maximal Schauder regularity for solutions to elliptic systems and Cauchy problems, in the space $C_b(\mathbb{R}^d;\mathbb{R}^m)$ of bounded and continuous functions, associated to a class of nonautonomous weakly coupled…

偏微分方程分析 · 数学 2022-01-03 Davide Addona , Luca Lorenzi

The best polynomial approximation and Chebyshev approximation are both important in numerical analysis. In tradition, the best approximation is regarded as more better than the Chebyshev approximation, because it is usually considered in…

数值分析 · 数学 2021-11-17 Xiaolong Zhang

Motivated by variational models in continuum mechanics, we introduce a novel algorithm to perform nonsmooth and nonconvex minimizations with linear constraints in Euclidean spaces. We show how this algorithm is actually a natural…

偏微分方程分析 · 数学 2015-03-20 Marco Artina , Massimo Fornasier , Francesco Solombrino

We prove that in variable exponent spaces $L^{p(\cdot)}(\Omega)$, where $p(\cdot)$ satisfies the log-condition and $\Omega$ is a bounded domain in $\mathbf R^n$ with the property that $\mathbf R^n \backslash \bar{\Omega}$ has the cone…

泛函分析 · 数学 2009-02-26 Humberto Rafeiro , Stefan Samko

We prove Poincar\'e and Sobolev inequalities in matrix A${}_p$ weighted spaces. We then use these Poincar\'e inequalities to prove existence and regularity results for degenerate systems of elliptic equations whose degeneracy is governed by…

偏微分方程分析 · 数学 2019-09-17 Joshua Isralowitz , Kabe Moen

We describe an efficient algorithm for calculating the statistics of weak lensing by large-scale structure based on a tiled set of independent particle-mesh N-body simulations which telescope in resolution along the line of sight. This…

天体物理学 · 物理学 2008-11-26 Martin White , Wayne Hu

We consider the problem of sparse atomic optimization, where the notion of "sparsity" is generalized to meaning some linear combination of few atoms. The definition of atomic set is very broad; popular examples include the standard basis,…

最优化与控制 · 数学 2019-12-30 Thomas Zhang

Kernel based methods provide a way to reconstruct potentially high-dimensional functions from meshfree samples, i.e., sampling points and corresponding target values. A crucial ingredient for this to be successful is the distribution of the…

数值分析 · 数学 2021-05-19 Tizian Wenzel , Gabriele Santin , Bernard Haasdonk

In this work, we investigate the presence of the weak Lefschetz property (WLP) and Hilbert functions for various types of random standard graded Artinian algebras. If an algebra has the WLP then its Hilbert function is unimodal. Using…

交换代数 · 数学 2024-02-28 Uwe Nagel , Sonja Petrović

We prove scaling invariant Gagliardo-Nirenberg type inequalities of the form $$\|\varphi\|_{L^p(\mathbb{R}^d)}\le C\|\varphi\|_{\dot H^{s}(\mathbb{R}^d)}^{\beta} \left(\iint_{\mathbb{R}^d \times \mathbb{R}^d} \frac{|\varphi (x)|^q\,|\varphi…

Using techniques developed recently in the field of compressed sensing we prove new upper bounds for general (nonlinear) sampling numbers of (quasi-)Banach smoothness spaces in $L^2$. In particular, we show that in relevant cases such as…

数值分析 · 数学 2023-08-02 Thomas Jahn , Tino Ullrich , Felix Voigtlaender
‹ 上一页 1 8 9 10 下一页 ›