相关论文: When is P such that l_0-minimization Equals to l_p…

The sparse linear reconstruction problem is a core problem in signal processing which aims to recover sparse solutions to linear systems. The original problem regularized by the total number of nonzero components (also known as $L_0$…

For fixed positive integer $n$, $p\in[0,1]$, $a\in(0,1)$, we prove that if a function $g:\mathbb{S}^{n-1}\to \mathbb{R}$ is sufficiently close to 1, in the $C^a$ sense, then there exists a unique convex body $K$ whose $L_p$ curvature…

This article derives lower bounds on the supremal (strict) p-negative type of finite metric spaces using purely elementary techniques. The bounds depend only on the cardinality and the (scaled) diameter of the underlying finite metric…

For $d = 2, 3, \ldots$ and $p \in [1, \infty),$ we define a class of representations $\rho$ of the Leavitt algebra $L_d$ on spaces of the form $L^p (X, \mu),$ which we call the spatial representations. We prove that for fixed $d$ and $p,$…

The goal of this paper is to solve backward doubly stochastic differential equation (BDSDE, in short) under weak assumptions on the data. The first part is devoted to the development of some new technical aspects of stochastic calculus…

We consider weak non-negative solutions to the critical $p$-Laplace equation in $\mathbb{R}^N$, $-\Delta_p u =u^{p^*-1}$ in the singular case $1<p<2$. We prove that if the nonlinearity is locally Lipschitz continuous, namely $p^*\geqslant2$…

We present an iterative support shrinking algorithm for $\ell_{p}$-$\ell_{q}$ minimization~($0 <p < 1 \leq q < \infty $). This algorithm guarantees the nonexpensiveness of the signal support set and can be easily implemented after being…

Techniques based on minimal graph cuts have become a standard tool for solving combinatorial optimization problems arising in image processing and computer vision applications. These techniques can be used to minimize objective functions…

We introduce multiple symmetric LP relaxations for minimum cut problems. The relaxations give optimal and approximate solutions when the input is a Hamiltonian cycle. We show that this leads to one of two interesting results. In one case,…

We show how to reduce a general, strictly-feasible LP problem, into a min-max problem, which can be solved by the algorithm from the third section of my thesis.

Let $1\leq p < \infty$ and $1\leq r \leq p^\ast$, where $p^\ast$ is the conjugate index of $p$. We prove an omnibus theorem, which provides numerous equivalences for a sequence $(x_n)$ in a Banach space $X$ to be a $(p,r)$-null sequence.…

We obtain uniqueness and existence of a solution $u$ to the following second-order stochastic partial differential equation (SPDE) : \begin{align} \label{abs eqn} du= \left( \bar a^{ij}(\omega,t)u_{x^ix^j}+ f \right)dt + g^k dw^k_t, \quad t…

This paper is devoted to the $L^p$ ($p>1$) solutions of one-dimensional backward stochastic differential equations (BSDEs for short) with general time intervals and generators satisfying some non-uniform conditions in $t$ and $\omega$. An…

In this article we study singular subelliptic $p$-Laplace equations and best constants in Sobolev inequalities on nilpotent Lie groups. We prove solvability of these subelliptic $p$-Laplace equations and existence of the minimizer of the…

We show that necessary and sufficient conditions of optimality in periodic optimization problems can be stated in terms of a solution of the corresponding HJB inequality, the latter being equivalent to a max-min type variational problem…

For a class of equations generalizing the model case \[ \Delta _p u-a(r)u^{p-1}+b(r)u^q=0 \; \; \mbox{in $B$}, \; \; u=0 \; \; \mbox{on $\partial B$}, \] where $B$ is the unit ball in $R^n$, $n \geq 1$, $r=|x|$, $p,q>1$, and $\Delta _p$…

Suppose we observe a Poisson process in real time for which the intensity may take on two possible values $\lambda_0$ and $\lambda_1$. Suppose further that the priori probability of the true intensity is not given. We solve a minimax…

There exist NIP and non-NTP$_2$ theories satisfying all the following conditions: It is not o-minimal; All models are strongly locally o-minimal; It has a model which is an expansion of the linearly ordered abelian group over the reals…

The following theorem is the main result of this note. Theorem 1. Let $(E, \|\cdot\|_E) $ be a rearrangement invariant Banach function space on the interval $[0, 1]$. If $E$ is isometric to $\L_p [0, 1]$ for some $1\le p<\infty$, then $E$…

Given real numbers whose sum is an integer, we study the problem of finding integers which match these real numbers as closely as possible, in the sense of L^p norm, while preserving the sum. We describe the structure of solutions for this…