English
Related papers

Related papers: An optimization problem and point-evaluation in Pa…

200 papers

\begin{abstract} Let $P\pm$ be the Riesz's projection operator and let $P_-= I - P_+$. We consider estimates of the expression $\|( |P_ + f | ^s + |P_- f |^s) ^{\frac{1}{s}}\|_{L^p (\mathbf{T})}$ in terms of Lebesgue $p$-norm of the…

Functional Analysis · Mathematics 2023-05-24 Marijan Marković , Petar Melentijević

We consider the equation $-\Delta_p u=f(u)$ in a smooth bounded domain of $\mathbb{R}^n $, where $\Delta_p$ is the $p$-Laplace operator. Explicit examples of unbounded stable energy solutions are known if $n\geq p+4p/(p-1)$. Instead, when…

Analysis of PDEs · Mathematics 2022-11-30 Xavier Cabre , Pietro Miraglio , Manel Sanchon

A classical result due to Frank and Seiringer asserts that for $1\leq p<\frac Ns$, there exists a sharp constant $\mathcal{C}_{N,s,p}>0$ such that $$…

Analysis of PDEs · Mathematics 2026-05-18 Avas Banerjee , Debdip Ganguly , Vivek Sahu

In this short note, we discuss how the optimality conditions for the problem of minimizing a multivariate function subject to equality constraints have been dealt with in undergraduate Calculus. We are particularly interested in the 2 or…

History and Overview · Mathematics 2019-04-11 Ademir Alves Ribeiro , Jose Renato Ramos Barbosa

We study the problem of finding approximate first-order stationary points in optimization problems of the form $\min_{x \in X} \max_{y \in Y} f(x,y)$, where the sets $X,Y$ are convex and $Y$ is compact. The objective function $f$ is smooth,…

Optimization and Control · Mathematics 2021-10-11 Dmitrii M. Ostrovskii , Babak Barazandeh , Meisam Razaviyayn

Let $p$ be a prime and let $C_p$ denote the $p$-ary code of the projective plane over ${\mathbb Z}/p\mathbb{Z}$. It is well known that the minimum weight of non-zero words in $C_p$ is $p+1$, and Chouinard proved that, for $p \geq 3$, the…

Combinatorics · Mathematics 2017-12-21 Bhaskar Bagchi

Let $G=(V,E)$ be a finite graph and $M_G$ be the centered Hardy-Littlewood maximal operator defined there. We find the optimal value $\bf{C}_{G,p}$ such that the inequality $$\text{Var}_{p}(M_{G}f)\leq {\textbf{C}}_{G,p}\text{Var}_{p}(f)$$…

Classical Analysis and ODEs · Mathematics 2020-10-27 Cristian González-Riquelme , José Madrid

We demonstrate the almost everywhere convergence of the planar Bochner-Riesz means for $L^p$ functions in the optimal range when $5/3\leq p\leq 2$. This is achieved by establishing a sharp $L^{5/3}$ estimate for a maximal operator closely…

Classical Analysis and ODEs · Mathematics 2026-04-02 Xiaochun Li , Shukun Wu

A now classical result in the theory of variable Lebesgue spaces due to Lerner [A. K. Lerner, On modular inequalities in variable $L^p$ spaces, Archiv der Math. 85 (2005), no. 6, 538-543] is that a modular inequality for the…

Classical Analysis and ODEs · Mathematics 2017-10-23 David Cruz-Uribe , Giovanni Di Fratta , Alberto Fiorenza

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

The problem of computing the smallest fixed point of an order-preserving map arises in the study of zero-sum positive stochastic games. It also arises in static analysis of programs by abstract interpretation. In this context, the discount…

Optimization and Control · Mathematics 2014-02-04 Assalé Adjé , Stéphane Gaubert , Eric Goubault

We consider stochastic optimization over $\ell_p$ spaces using access to a first-order oracle. We ask: {What is the minimum precision required for oracle outputs to retain the unrestricted convergence rates?} We characterize this precision…

Information Theory · Computer Science 2020-01-27 Prathamesh Mayekar , Himanshu Tyagi

We study functions of least gradient as well as related superminimizers and solutions of obstacle problems in metric spaces that are equipped with a doubling measure and support a Poincar\'e inequality. We show a standard weak Harnack…

Metric Geometry · Mathematics 2018-01-29 Panu Lahti

Denote by ${\mathfrak s}({\mathbb F}_p^d)$ the Erd{\H o}s--Ginzburg--Ziv constant of ${\mathbb F}_p^d$, that is, the minimum $s$ such that any sequence of $s$ vectors in ${\mathbb F}_p^d$ contains $p$ vectors whose sum is zero. Let…

Combinatorics · Mathematics 2023-03-23 Dmitrii Zakharov

Let $L^p(\mathbf{T})$ be the Lesbegue space of complex-valued functions defined in the unit circle $\mathbf{T}=\{z: |z|=1\}\subseteq \mathbb{C}$. In this paper, we address the problem of finding the best constant in the inequality of the…

Complex Variables · Mathematics 2025-11-04 Anton Gjokaj , David Kalaj , Djordjije Vujadinovic

It is proved in this paper that to every underdetermined linear system $Ax=b$ there corresponds a constant $p(A,b)>0$ such that every solution to the $l_p$-norm minimization problem also solves the $l_0$-norm minimization problem whenever…

Information Theory · Computer Science 2015-01-12 Jigen Peng , Shigang Yue , Haiyang Li

We investigate numerically the optimal constants in Lieb-Thirring inequalities by studying the associated maximization problem. We use a monotonic fixed-point algorithm and a finite element discretization to obtain trial potentials which…

Spectral Theory · Mathematics 2012-06-11 Antoine Levitt

In this paper we discuss the obstacle problem for the $p$-Laplace operator. We prove optimal growth results for the solution. Of particular interest is the point-wise regularity of the solution at free boundary points. The most surprising…

Analysis of PDEs · Mathematics 2015-03-19 John Andersson , Erik Lindgren , Henrik Shahgholian

We show that there is an absolute constant $c > 1/2$ such that the Mahler measure of the Fekete polynomials $f_p$ of the form $$f_p(z) := \sum_{k=1}^{p-1}{\left( \frac kp \right)z^k}\,,$$ (where the coefficients are the usual Legendre…

Complex Variables · Mathematics 2017-02-21 Tamás Erdélyi

We consider the problem of minimizing a difference of (smooth) convex functions over a compact convex feasible region $P$, i.e., $\min_{x \in P} f(x) - g(x)$, with smooth $f$ and Lipschitz continuous $g$. This computational study builds…

Optimization and Control · Mathematics 2025-08-05 Sebastian Pokutta