Related papers: Sparse optimization problems in fractional order S…
Sparse and convolutional constraints form a natural prior for many optimization problems that arise from physical processes. Detecting motifs in speech and musical passages, super-resolving images, compressing videos, and reconstructing…
We show that the fractional Sobolev inequality for the embedding $\H \hookrightarrow L^{\frac{2N}{N-s}}(\R^N)$, $s \in (0,N)$ can be sharpened by adding a remainder term proportional to the distance to the set of optimizers. As a corollary,…
We investigate the existence of extremals for Hardy-Sobolev inequalities involving the Dirichlet fractional Laplacian of order s, 0<s<1, on half-spaces.
We study the performance of first- and second-order optimization methods for l1-regularized sparse least-squares problems as the conditioning of the problem changes and the dimensions of the problem increase up to one trillion. A rigorously…
We study bilevel optimization problems where the lower-level problems are strongly convex and have coupled linear constraints. To overcome the potential non-smoothness of the hyper-objective and the computational challenges associated with…
We introduce a new concept of sparsity for the stochastic elliptic operator $-{\rm div}\left(a(x,\omega)\nabla(\cdot)\right)$, which reflects the compactness of its inverse operator in the stochastic direction and allows for spatially…
We address second-order optimality conditions for optimal control problems involving sparsity functionals which induce spatio-temporal sparsity patterns. We employ the notion of (weak) second subderivatives. With this approach, we are able…
In this work, we use the integral definition of the fractional Laplace operator and study a sparse optimal control problem involving a fractional, semilinear, and elliptic partial differential equation as state equation; control constraints…
This paper introduces the notion of state constraints for optimal control problems governed by fractional elliptic PDEs of order $s \in (0,1)$. There are several mathematical tools that are developed during the process to study this…
In this paper, we study a class of fractional $1$-Laplacian diffusion equations with variable orders, proposed as a model for multiplicative noise removal. The existence and uniqueness of the weak solution are proven. To overcome the…
This paper is devoted to the error analysis of a time-spectral algorithm for fractional diffusion problems of order $\alpha$ ($0 < \alpha < 1$). The solution regularity in the Sobolev space is revisited, and new regularity results in the…
We establish fine bounds for best constants of the fractional subcritical Sobolev embeddings \begin{align*} W_{0}^{s,p}\left(\Omega\right)\hookrightarrow L^{q}\left(\Omega\right), \end{align*} where $N\geq1$, $0<s<1$, $p=1,2$, $1\leq…
We develop a sparse spectral method for a class of fractional differential equations, posed on $\mathbb{R}$, in one dimension. These equations can include sqrt-Laplacian, Hilbert, derivative and identity terms. The numerical method utilizes…
For numerical approximation the reformulation of a PDE as a residual minimisation problem has the advantages that the resulting linear system is symmetric positive definite, and that the norm of the residual provides an a posteriori error…
In sparse optimization, enforcing hard constraints using the $\ell_0$ pseudo-norm offers advantages like controlled sparsity compared to convex relaxations. However, many real-world applications demand not only sparsity constraints but also…
Motivated by $\ell_p$-optimization arising from sparse optimization, high dimensional data analytics and statistics, this paper studies sparse properties of a wide range of $p$-norm based optimization problems with $p > 1$, including…
In this paper we first study a smooth optimization approach for solving a class of nonsmooth strictly concave maximization problems whose objective functions admit smooth convex minimization reformulations. In particular, we apply…
Necessary and sufficient conditions are presented for a fractional Orlicz-Sobolev space on $\rn$ to be continuously embedded into a space of uniformly continuous functions. The optimal modulus of continuity is exhibited whenever these…
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,…
Convex relaxations of non-convex optimal power flow (OPF) problems have recently attracted significant interest. While existing relaxations globally solve many OPF problems, there are practical problems for which existing relaxations fail…