Related papers: Some problems on optimal approximants

We develop a computational method for extremal Steklov eigenvalue problems and apply it to study the problem of maximizing the $p$-th Steklov eigenvalue as a function of the domain with a volume constraint. In contrast to the optimal…

We show in all dimensions that minimizers of variational problems with a convexity constraint, which arise from the Rochet-Chon\'e model with a quadratic cost in the monopolist's problem in economics, can be approximated in the uniform norm…

In this paper we produce new, optimal, regularity results for the solutions to $p$-Poisson equations. We argue through a delicate approximation method, under a smallness regime for the exponent $p$, that imports information from a limiting…

In this paper we continue to study the connection among the area minimizing problem, certain area functional and the Dirichlet problem of minimal surface equations in a class of conformal cones with a similar motivation from \cite{GZ20}.…

In Descriptive Complexity, there is a vast amount of literature on decision problems, and their classes such as \textbf{P, NP, L and NL}. ~ However, research on the descriptive complexity of optimisation problems has been limited.…

We consider the Dirichlet problem for the nonlinear $p(x)$-Laplacian equation. For axially symmetric domains we prove that, under suitable assumptions, there exist Mountain-pass solutions which exhibit partial symmetry. Furthermore, we show…

We consider finite element approximations of ill-posed elliptic problems with conditional stability. The notion of {\emph{optimal error estimates}} is defined including both convergence with respect to mesh parameter and perturbations in…

When implementing regular enough functions (e.g., elementary or special functions) on a computing system, we frequently use polynomial approximations. In most cases, the polynomial that best approximates (for a given distance and in a given…

For a measure on a subset of the complex plane we consider $L^p$-optimal weighted polynomials, namely, monic polynomials of degree $n$ with a varying weight of the form $w^n = {\rm e}^{-n V}$ which minimize the $L^p$-norms, $1 \leq p \leq…

We study the minimization of fixed-degree polynomials over the simplex. This problem is well-known to be NP-hard, as it contains the maximum stable set problem in graph theory as a special case. In this paper, we consider a rational…

We analyze Bergman spaces A p f (D) of generalized analytic functions of solutions to the Vekua equation $\partial$w = ($\partial$f /f)w in the unit disc of the complex plane, for Lipschitz-smooth non-vanishing real valued functions f and 1…

We consider the unconstrained $L_2$-$L_p$ minimization: find a minimizer of $\|Ax-b\|^2_2+\lambda \|x\|^p_p$ for given $A \in R^{m\times n}$, $b\in R^m$ and parameters $\lambda>0$, $p\in [0,1)$. This problem has been studied extensively in…

This review paper presents the results, which cover the study of current problems of approximation theory in abstract linear spaces. Such research has been actively developed since the 2000s, based on the ideas and approaches initiated in…

We consider the nonlinear eigenvalue problem, with Dirichlet boundary condition, for a class of very degenerate elliptic operators, with the aim to show that, at least for square type domains having fixed volume, the symmetry of the domain…

Higher order Bernstein- and Markov-type inequalities are established for trigonometric polynomials on compact subsets of the real line and algebraic polynomials on compact subsets of the unit circle. In the case of Markov-type inequalities…

We derive some identities and relations and extremal problems and minimization and Fourier development involving of integral Legendre polynomials.

We show that several problems of compacting orthogonal graph drawings to use the minimum number of rows, area, length of longest edge or total edge length cannot be approximated better than within a polynomial factor of optimal in…

We demonstrate the equivalence of two classes of $D$-invariant polynomial subspaces introduced in [8] and [9], i.e., these two classes of subspaces are different representations of the breadth-one $D$-invariant subspace. Moreover, we solve…

This paper focuses on the study of a mathematical program with equilibrium constraints, where the objective and the constraint functions are all polynomials. We present a method for finding its global minimizers and global minimum using a…

In this paper error analysis for finite element discretizations of Dirichlet boundary control problems is developed. For the first time, optimal discretization error estimates are established in the case of three dimensional polyhedral and…