中文
相关论文

相关论文: Solving the Gleason problem on linearly convex dom…

200 篇论文

Let $\Omega$ be a bounded, smooth domain of $\mathbb{R}^{N},$ $N\geq1.$ For each $p>N$ we study the optimal function $s=s_{p}$ in the pointwise inequality \[ \left\vert v(x)\right\vert \leq s(x)\left\Vert \nabla v\right\Vert…

偏微分方程分析 · 数学 2020-04-21 Grey Ercole , Gilberto de Assis Pereira

We consider scalar equilibrium problems governed by a bifunction in a finite-dimensional framework. By using classical arguments in Convex Analysis, we show that under suitable generalized convexity assumptions imposed on the bifunction,…

最优化与控制 · 数学 2024-01-02 Valerian-Alin Fodor , Nicolae Popovici

The convex hull property is the natural generalization of maximum principles from scalar to vector valued functions. Maximum principles for finite element approximations are often crucial for the preservation of qualitative properties of…

数值分析 · 数学 2019-05-22 Lars Diening , Christian Kreuzer , Sebastian Schwarzacher

A general problem in optimal control consists of finding a terminal reward that makes the value function independent of the horizon. Such a terminal reward can be interpreted as a max-plus eigenvector of the associated Lax-Oleinik…

最优化与控制 · 数学 2007-12-05 Marianne Akian , Stephane Gaubert , Cormac Walsh

Optimal maps, solutions to the optimal transportation problems, are completely determined by the corresponding c-convex potential functions. In this paper, we give simple sufficient conditions for a smooth function to be c-convex when the…

微分几何 · 数学 2010-06-22 Paul W. Y. Lee

A set-system $S\subseteq \{0,1\}^n$ is cube-ideal if its convex hull can be described by capacity and generalized set covering inequalities. In this paper, we use combinatorics, convex geometry, and polyhedral theory to give exponential…

组合数学 · 数学 2026-04-21 Ahmad Abdi , Gérard Cornuéjols , Daniel Dadush , Mahsa Dalirrooyfard

We characterize approximate global optimal solutions (${\varepsilon}$-optima) to reverse optimization problems, namely, problems whose non-convex constraint is of the form $h(x) \geq 0$. This issue has not been addressed previously in the…

最优化与控制 · 数学 2025-06-03 M. El Maghri , H. Sellak

We consider convex optimization problems with the objective function having Lipshitz-continuous $p$-th order derivative, where $p\geq 1$. We propose a new tensor method, which closes the gap between the lower…

Let G be a compact group acting in a real vector space V. We obtain a number of inequalities relating the L^infinity norm of a matrix element of the representation of G with its L^p norm for p<infinity. We apply our results to obtain…

最优化与控制 · 数学 2007-05-23 Alexander Barvinok

Finding point configurations, that yield the maximum polarization (Chebyshev constant) is gaining interest in the field of geometric optimization. In the present article, we study the problem of unconstrained maximum polarization on compact…

最优化与控制 · 数学 2023-03-20 Jan Rolfes , Robert Schüler , Marc Christian Zimmermann

We prove that if $f:\mathbb{R}^n\to\mathbb{R}$ is convex and $A\subset\mathbb{R}^n$ has finite measure, then for any $\varepsilon>0$ there is a convex function $g:\mathbb{R}^n\to\mathbb{R}$ of class $C^{1,1}$ such that $\mathcal{L}^n(\{x\in…

经典分析与常微分方程 · 数学 2020-11-23 Daniel Azagra , Piotr Hajłasz

Given a convex set $\Omega$ of $\mathbb{R}^n$, we consider the shape optimization problem of finding a convex subset $\omega\subset \Omega$, of a given measure, minimizing the $p$-distance functional $$\mathcal{J}_p(\omega) :=…

最优化与控制 · 数学 2025-01-03 Zakaria Fattah , Ilias Ftouhi , Enrique Zuazua

For any $n\ge 2$, $\Omega\subset\rn$, and any given convex and coercive Hamiltonian function $H\in C^{0}(\rn)$, we find an optimal sufficient condition on $H$, that is, for any $c\in\mathbb R$, the level set $H^{-1}(c)$ does not contains…

偏微分方程分析 · 数学 2019-01-09 Peng Fa , Changyou Wang , Yuan Zhou

We prove that for any compact set B in R^d and for any epsilon >0 there is a finite subset X of B of |X|=d^{O(1/epsilon^2)} points such that the maximum absolute value of any linear function ell: R^d --> R on X approximates the maximum…

度量几何 · 数学 2012-04-13 Alexander Barvinok

We show that every linear functional on the Dirichlet space that is non-zero on nowhere-vanishing functions is necessarily a multiple of a point evaluation. Continuity of the functional is not assumed. As an application, we obtain a…

泛函分析 · 数学 2019-02-13 Javad Mashreghi , Julian Ransford , Thomas Ransford

Let $L$ be a homogeneous divergence form higher order elliptic operator with complex bounded measurable coefficients and $(p_-(L),\, p_+(L))$ be the maximal interval of exponents $q\in[1,\,\infty]$ such that the semigroup…

经典分析与常微分方程 · 数学 2015-04-23 Jun Cao , Svitlana Mayboroda , Dachun Yang

We consider the problem of geometric optimisation of the lowest eigenvalue of the Laplacian in the exterior of a compact set in any dimension, subject to attractive Robin boundary conditions. As an improvement upon our previous work…

谱理论 · 数学 2020-06-26 David Krejcirik , Vladimir Lotoreichik

For a (not necessarily locally convex) topological vector space $\mathcal{X}$ of holomorphic functions in one complex variable, we show that the shift invariant subspace generated by a set of polynomials is $\mathcal{X}$ if and only if…

复变函数 · 数学 2025-12-02 Mikhail Mironov , Jeet Sampat

We investigate the defining ideal of a set of points X in multi-projective space with a special emphasis on the case that X is in generic position, that is, X has the maximal Hilbert function. When X is in generic position, we determine the…

交换代数 · 数学 2007-05-23 Adam Van Tuyl

Estimation of convex functions finds broad applications in engineering and science, while convex shape constraint gives rise to numerous challenges in asymptotic performance analysis. This paper is devoted to minimax optimal estimation of…

统计理论 · 数学 2013-06-11 Teresa M. Lebair , Jinglai Shen , Xiao Wang