Related papers: Sparse optimization problems in fractional order S…
Sparse recovery is widely applied in many fields, since many signals or vectors can be sparsely represented under some frames or dictionaries. Most of fast algorithms at present are based on solving $l^0$ or $l^1$ minimization problems and…
This paper considers stochastic convex optimization problems with two sets of constraints: (a) deterministic constraints on the domain of the optimization variable, which are difficult to project onto; and (b) deterministic or stochastic…
Given any uniform domain $\Omega$, the Triebel-Lizorkin space $F^s_{p,q}(\Omega)$ with $0<s<1$ and $1<p,q<\infty$ can be equipped with a norm in terms of first order differences restricted to pairs of points whose distance is comparable to…
We consider the numerical solution of the fractional Laplacian of index $s\in(1/2,1)$ in a bounded domain $\Omega$ with homogeneous boundary conditions. Its solution a priori belongs to the fractional order Sobolev space ${\widetilde…
Stochastic zeroth-order (SZO), or gradient-free, optimization allows to optimize arbitrary functions by relying only on function evaluations under parameter perturbations, however, the iteration complexity of SZO methods suffers a factor…
Information processing techniques based on sparseness have been actively studied in several disciplines. Among them, a mathematical framework to approximately express a given dataset by a combination of a small number of basis vectors of an…
Motivated by applications of large embedding models, we study differentially private (DP) optimization problems under sparsity of individual gradients. We start with new near-optimal bounds for the classic mean estimation problem but with…
We consider Poisson's equation with a finite number of weighted Dirac masses as a source term, together with its discretization by means of conforming finite elements. For the error in fractional Sobolev spaces, we propose residual-type a…
Opacity is a notion that describes an eavesdropper's inability to estimate a system's 'secret' states by observing the system's outputs. In this paper, we propose algorithms to compute the minimum sparse perturbation to be added to a system…
A class of infinite horizon optimal control problems involving mixed quasi-norms of $L^p$-type cost functionals for the controls is discussed. These functionals enhance sparsity and switching properties of the optimal controls. The…
We collect and extend results on the limit of $\sigma^{1-k}(1-\sigma)^k |v|_{l+\sigma,p,\Omega}^p$ as $\sigma$ tends to $0^+$ or $1^-$, where $\Omega$ is $\mathbb{R}^n$ or a smooth bounded domain, $k$ is 0 or 1, $l$ is a nonnegative…
We introduce a definition of the fractional Laplacian $(-\Delta)^{s(\cdot)}$ with spatially variable order $s:\Omega\to [0,1]$ and study the solvability of the associated Poisson problem on a bounded domain $\Omega$. The initial motivation…
In this paper, we consider an unconstrained stochastic optimization problem where the objective function exhibits high-order smoothness. Specifically, we propose a new stochastic first-order method (SFOM) with multi-extrapolated momentum,…
We show that sparsity constrained optimization problems over low dimensional spaces tend to have a small duality gap. We use the Shapley-Folkman theorem to derive both data-driven bounds on the duality gap, and an efficient primalization…
We consider a class of l0-minimization problems, which is to search for the partial sparsest solution to an underdetermined linear system with additional constraints. We introduce several concepts, including lp-induced norm (0 < p < 1),…
Sparse coding algorithms are about finding a linear basis in which signals can be represented by a small number of active (non-zero) coefficients. Such coding has many applications in science and engineering and is believed to play an…
The main purpose of the paper is to study sharp estimates of approximation of periodic functions in the H\"older spaces $H_p^{r,\alpha}$ for all $0<p\le\infty$ and $0<\alpha\le r$. By using modifications of the classical moduli of…
Constrained second-order convex optimization algorithms are the method of choice when a high accuracy solution to a problem is needed, due to their local quadratic convergence. These algorithms require the solution of a constrained…
This paper investigates the numerical approximation of integrals for functions in fractional Gaussian Sobolev spaces $W^s_{p}(\mathbb{R}^d,\gamma)$ with dominating mixed smoothness defined via kernel related to the fractional…
The sparse nonlinear programming (SNP) problem has wide applications in signal and image processing, machine learning, pattern recognition, finance and management, etc. However, the computational challenge posed by SNP has not yet been well…