English
Related papers

Related papers: Optimal Polynomial Approximants in $L^p$

200 papers

In this paper, we consider the best multivalued polynomial approximation operator for functions in an Orlicz Space $L^{\varphi}(\Omega)$. We obtain its characterization involving $\psi^-$ and $\psi^+$, which are the left and right…

Classical Analysis and ODEs · Mathematics 2025-05-28 Sonia Acinas , Sergio Favier , Rosa Lorenzo

Let $E = L_p, \; 1<p\leq 2,$ and $A : E \to E^*$ be a bounded monotone map such that $0 \in R(A)$. In this paper, we introduce and study an algorithm for approximating zeros of $A$. Furthermore, we study the application of this algorithm to…

Functional Analysis · Mathematics 2022-08-18 Abdulmalik U. Bello , Markjoe O. Uba , Michael T. Omojola , Maria A. Onyido , Cyril I. Udeani

In this work, the problem of shape optimization, subject to PDE constraints, is reformulated as an $L^p$ best approximation problem under divergence constraints to the shape tensor introduced in Laurain and Sturm: ESAIM Math. Model. Numer.…

Numerical Analysis · Mathematics 2024-04-02 Gerhard Starke

Among other things, we prove that, for a doubling weight $w$, $0< p\leq\infty$, $r\in{\mathbb N}_0$, and $0<\alpha <r+1 - 1/\lambda_p$, we have \[ E_n(f)_{p, w_n} = O(n^{-\alpha}) \iff \omega_\varphi^{r+1}(f, n^{-1})_{p, w_n} =…

Classical Analysis and ODEs · Mathematics 2015-07-20 Kirill A. Kopotun

A polynomial optimization problem (POP) asks for minimizing a polynomial function given a finite set of polynomial constraints (equations and inequalities). This problem is well-known to be hard in general, as it encodes many hard…

Optimization and Control · Mathematics 2024-01-24 Luis Felipe Vargas

In the case when the weight and its inverse belong to BMO(T), we prove the asymptotics of the monic orthogonal polynomials in L^p, 2<p<p_0. Immediate applications include the estimates on the uniform norm and asymptotics for the polynomial…

Classical Analysis and ODEs · Mathematics 2016-11-03 S. Denisov , K. Rush

This paper presents a pseudo-spectral method for Dynamic Optimization Problems (DOPs) that allows for tight polynomial bounds to be achieved via flexible sub-intervals. The proposed method not only rigorously enforces inequality…

Optimization and Control · Mathematics 2026-04-08 Eduardo M. G. Vila , Eric C. Kerrigan , Paul Bruce

We propose a new property of the zeros of exceptional orthogonal polynomials. It has been known that exceptional orthogonal polynomials (XOP) have both real and complex zeros. By fixing m variables at the imaginary parts of the complex…

Classical Analysis and ODEs · Mathematics 2017-07-18 Yu Luo

We obtain sharp $L^p$ bounds for oscillatory integral operators with generic homogeneous polynomial phases in several variables. The phases considered in this paper satisfy the rank one condition which is an important notion introduced by…

Classical Analysis and ODEs · Mathematics 2019-05-21 Danqing He , Zuoshunhua Shi

We define a p-norm in the context of quantum random variables, measurable operator-valued functions with respect to a positive operator-valued measure. This norm leads to a operator-valued L^p space that is shown to be complete. Various…

Functional Analysis · Mathematics 2021-08-31 Christopher Ramsey , Adam Reeves

We consider nonlinear optimal control problems (OCPs) for which all problem data are polynomial. In the first part of the paper, we review how occupation measures can be used to approximate pointwise the optimal value function of a given…

Optimization and Control · Mathematics 2008-12-18 Didier Henrion , Jean B. Lasserre , Carlo Savorgnan

Finding a zero of a maximal monotone operator is fundamental in convex optimization and monotone operator theory, and \emph{proximal point algorithm} (PPA) is a primary method for solving this problem. PPA converges not only globally under…

Optimization and Control · Mathematics 2019-05-14 Guoyong Gu , Junfeng Yang

By using representation theory, we reduce the size of the set of possible values for the dimension of the convex hull of all feasible points polytope of an orthogonal array (OA) defining integer linear program (ILP). Our results address the…

Representation Theory · Mathematics 2023-01-06 Dursun Bulutoglu

We consider structured optimisation problems defined in terms of the sum of a smooth and convex function, and a proper, l.s.c., convex (typically non-smooth) one in reflexive variable exponent Lebesgue spaces $L_{p(\cdot)}(\Omega)$. Due to…

Optimization and Control · Mathematics 2022-11-10 Marta Lazzaretti , Luca Calatroni , Claudio Estatico

We consider the problem of the maximum concentration in a fixed measurable subset $\Omega\subset\mathbb{R}^{2d}$ of the time-frequency space for functions $f\in L^2(\mathbb{R}^{d})$. The notion of concentration can be made mathematically…

Classical Analysis and ODEs · Mathematics 2022-10-07 Fabio Nicola , José Luis Romero , S. Ivan Trapasso

A class of infinite horizon optimal control problems involving $L^p$-type cost functionals with $0<p\leq 1$ is discussed. The existence of optimal controls is studied for both the convex case with $p=1$ and the nonconvex case with $0<p<1$,…

Optimization and Control · Mathematics 2018-08-13 Dante Kalise , Karl Kunisch , Zhiping Rao

Polynomial approximation is studied in the Sobolev space $W_p^r(w_{\alpha,\beta})$ that consists of functions whose $r$-th derivatives are in weighted $L^p$ space with the Jacobi weight function $w_{\alpha,\beta}$. This requires…

Classical Analysis and ODEs · Mathematics 2017-11-01 Yuan Xu

We show that independent and uniformly distributed sampling points are as good as optimal sampling points for the approximation of functions from the Sobolev space $W_p^s(\Omega)$ on bounded convex domains $\Omega\subset \mathbb{R}^d$ in…

Numerical Analysis · Mathematics 2023-02-02 David Krieg , Mathias Sonnleitner

We obtain order estimates for the best uniform orthogonal trigonometric approximations of $2\pi$-periodic functions, whose $(\psi,\beta)$-derivatives belong to unit balls of spaces $L_{p}, \ 1\leq p<\infty$, in case at consequences…

Classical Analysis and ODEs · Mathematics 2016-03-08 A. S. Serdyuk , T. A. Stepaniuk

This paper studies the hierarchy of local minimums of a polynomial in the space. For this purpose, we first compute H-minimums, for which the first and second order optimality conditions are satisfied. To compute each H-minimum, we…

Optimization and Control · Mathematics 2014-11-26 Jiawang Nie