Related papers: Some problems on optimal approximants
We initiate the study of fine-grained completeness theorems for exact and approximate optimization in the polynomial-time regime. Inspired by the first completeness results for decision problems in P (Gao, Impagliazzo, Kolokolova, Williams,…
In this paper, we study the Dirichlet problem for Monge-Amp\`ere type equations for $p$-plurisubharmonic functions on Riemannian manifolds. The $a$ $priori$ estimates up to the second order derivatives of solutions are established. The…
In this short note, we consider the Dirichlet problem associated to an even order elliptic system with antisymmetric first order potential. Given any continuous boundary data, we show that weak solutions are continuous up to boundary.
We give a new proof for an equality of certain max-min and min-max approximation problems involving normal matrices. The previously published proofs of this equality apply tools from matrix theory, (analytic) optimization theory and…
It has been observed in many places that constant-factor approximable problems often admit polynomial or even linear problem kernels for their decision versions, e.g., Vertex Cover, Feedback Vertex Set, and Triangle Packing. While there…
We consider the class of polynomial optimization problems $\inf \{f(x):x\in K\}$ for which the quadratic module generated by the polynomials that define $K$ and the polynomial $c-f$ (for some scalar $c$) is Archimedean. For such problems,…
In this paper we obtain some statements concerning ideals of polynomials and apply these results in a number of different situations. Among other results, we present new characterizations of $\mathcal{L}_{\infty}$-spaces, Coincidence…
In this paper, we study the Dirichlet problem for Laplace's equation in an open disk. The uniqueness of solutions is ensured by the well-known weak maximum principle. We introduce a novel approach to demonstrate the existence of a solution…
We study three well-known minimization problems in Hilbert spaces: the weighted least squares problem and the related problems of abstract splines and smoothing. In each case we analyze the solvability of the problem for every point of the…
We examine the maximal number of zeros a polynomial of degree at most n with constrained coefficients may have at 1. Our results are essentially sharp and extend earlier results of this variety. An interesting connection to certain…
Optimal approximation and optimal interpolation problems on the classes of periodic functions that are determined by restrictions on several higher derivatives of the functions are solved.
For shape optimization problems, governed by elliptic equations with Dirichlet boundary condition and random coefficients, we utilize a penalization technique to get the approximate problem. We consider that uncertainties exists in the…
The purpose of this work is the study of solution techniques for problems involving fractional powers of symmetric coercive elliptic operators in a bounded domain with Dirichlet boundary conditions. These operators can be realized as the…
This is a survey on best polynomial approximation on the unit sphere and the unit ball. The central problem is to describe the approximation behavior of a function by polynomials via smoothness of the function. A major effort is to identify…
We prove the #P-hardness of the counting problems associated with various satisfiability, graph and combinatorial problems, when restricted to planar instances. These problems include \begin{romannum} \item[{}] {\sc 3Sat, 1-3Sat, 1-Ex3Sat,…
We consider a minimization problem that combines the Dirichlet energy with the nonlocal perimeter of a level set, namely $$ \int_\Om |\nabla u(x)|^2\,dx+\Per\Big(\{u > 0\},\Om \Big),$$ with $\sigma\in(0,1)$. We obtain regularity results for…
We discuss the problem of finding optimal exponents in Diophantine estimates involving one real number and, in some cases where such an exponent is known, present some properties of the corresponding extremal numbers.
We investigate the relationship between several enumeration complexity classes and focus in particular on problems having enumeration algorithms with incremental and polynomial delay (IncP and DelayP respectively). We show that, for some…
A common problem in applied mathematics is to find a function in a Hilbert space with prescribed best approximations from a finite number of closed vector subspaces. In the present paper we study the question of the existence of solutions…
The $\ell_p$ regularization problem with $0< p< 1$ has been widely studied for finding sparse solutions of linear inverse problems and gained successful applications in various mathematics and applied science fields. The proximal gradient…