English
Related papers

Related papers: An invitation to the study of a uniqueness problem

200 papers

We consider the problem of minimizing the Lagrangian $\int [F(\nabla u)+f\,u]$ among functions on $\Omega\subset\mathbb{R}^N$ with given boundary datum $\varphi$. We prove Lipschitz regularity up to the boundary for solutions of this…

Analysis of PDEs · Mathematics 2015-04-24 Pierre Bousquet , Lorenzo Brasco

The study of convex functions - in particular, of their optimization (really minimization) is one of the most important fields of applied mathematics. Convexity seems to be one of those incredibly well-chosen hypotheses which is just…

Optimization and Control · Mathematics 2026-03-11 Eigil Fjeldgren Rischel

It is shown that given a metric space $X$ and a $\sigma$-finite positive regular Borel measure $\mu$ on $X$, there exists a bounded continuous real-valued function on $X$ that is one-to-one on the complement of a set of $\mu$ measure zero.

General Topology · Mathematics 2017-07-05 Alexander J. Izzo

We investigate necessary and sufficient conditions for a nonexpansive map $f$ on a Banach space $X$ to have surjective displacement, that is, for $f - \mathrm{id}$ to map onto $X$. In particular, we give a computable necessary and…

Functional Analysis · Mathematics 2021-12-06 Brian Lins

In this paper we prove that if $X $ is a Banach space, then for every lower semi-continuous bounded below function $f, $ there exists a $\left(\varphi_1, \varphi_2\right)-$convex function $g, $ with arbitrarily small norm, such that $f + g…

Functional Analysis · Mathematics 2016-10-20 Abdelhakim Maaden , Abdelkader Stouti

Given a positive lower semi-continuous density $f$ on $\mathbb{R}^2$ the weighted volume $V_f:=f\mathscr{L}^2$ is defined on the $\mathscr{L}^2$-measurable sets in $\mathbb{R}^2$. The $f$-weighted perimeter of a set of finite perimeter $E$…

Differential Geometry · Mathematics 2017-09-21 I. McGillivray

We are interested in the existence of Pareto solutions to the vector optimization problem $$\text{Min}_{\,\mathbb{R}^m_+} \{f(x) \,|\, x\in \mathbb{R}^n\},$$ where $f\colon\mathbb{R}^n\to \mathbb{R}^m$ is a polynomial map. By using the {\em…

Optimization and Control · Mathematics 2018-04-16 Do Sang Kim , Tien-Son Pham , Nguyen Van Tuyen

We examine conditions on a (compact metrizable) space $X$ such that for any space $Y$ and closed subspace $Z$, the set of continuous functions from $Z$ to $X$ which extend to $Y$ is either open or closed in the set of continuous functions…

General Topology · Mathematics 2012-07-31 Bruce Blackadar

In this paper we prove that if $f$ is a self-mapping of a nonempty subset $K$ of a normed space $X$ that satisfies some mild conditions, then the minimal displacement of large iterations $f^n$ always dominates that of $f$ along certain…

Functional Analysis · Mathematics 2021-11-05 Cleon S. Barroso

Let $E$ be an arbitrary subset of a Banach space $X$, $f: E \rightarrow \mathbb{R}$ be a function, and $G:E \rightrightarrows X^*$ be a set-valued mapping. We give necessary and sufficient conditions on $f, G$ for the existence of a…

Functional Analysis · Mathematics 2019-04-18 Daniel Azagra , Juan Ferrera , Javier Gómez-Gil , Carlos Mudarra

One of the most ubiquitous problems in optimization is that of finding all the elements of a finite set at which a function $f$ attains its minimum (or maximum). When the codomain of $f$ is equipped with a total order, it is easy to…

Optimization and Control · Mathematics 2026-03-17 Patrik Jansson , Nicola Botta , Tim Richter

Any continuous piecewise-linear function $F\colon \mathbb{R}^{n}\to \mathbb{R}$ can be represented as a linear combination of $\max$ functions of at most $n+1$ affine-linear functions. In our previous paper [``Representing piecewise linear…

Discrete Mathematics · Computer Science 2024-06-05 Christoph Koutschan , Anton Ponomarchuk , Josef Schicho

We study the problem of minimizing a convex function on a nonempty, finite subset of the integer lattice when the function cannot be evaluated at noninteger points. We propose a new underestimator that does not require access to…

Optimization and Control · Mathematics 2021-08-19 Jeffrey Larson , Sven Leyffer , Prashant Palkar , Stefan M. Wild

We prove the following two results 1. For a proper holomorphic function $ f : X \to D$ of a complex manifold $X$ on a disc such that $\{df = 0 \} \subset f^{-1}(0)$, we construct, in a functorial way, for each integer $p$, a geometric…

Algebraic Geometry · Mathematics 2008-01-29 Daniel Barlet

An optimal control problem subject to an elliptic obstacle problem is studied. We obtain a numerical approximation of this problem by discretising the PDE obtained via a Moreau--Yosida type penalisation. For the resulting discrete control…

Optimization and Control · Mathematics 2018-10-22 Ahmad Ahmad Ali , Klaus Deckelnick , Michael Hinze

For a topological space $X$ we study continuous maps $f : X\to \mathbb R^m$ such that images of every pairwise distinct $k$ points are affinely (linearly) independent. Such maps are called affinely (linearly) $k$-regular embeddings. We…

Algebraic Topology · Mathematics 2011-06-29 R. N. Karasev

Motivated by an influential result of Bourgain and Tzafriri, we consider continuous matrix functions $A:\mathbb{R}\to M_{n\times n}$ and lower $\ell_2$-norm bounds associated with their restriction to certain subspaces. We prove that for…

Functional Analysis · Mathematics 2022-01-14 Adrian Fan , Jack Montemurro , Pavlos Motakis , Naina Praveen , Alyssa Rusonik , Paul Skoufranis , Noam Tobin

It is well known that the entropy $H(X)$ of a finite random variable is always greater or equal to the entropy $H(f(X))$ of a function $f$ of $X$, with equality if and only if $f$ is one-to-one. In this paper, we give tights bounds on…

Information Theory · Computer Science 2017-04-25 Ferdinando Cicalese , Luisa Gargano , Ugo Vaccaro

A novel approach is introduced to a very widely occurring problem, providing a complete, explicit resolution of it: minimisation of a convex quadratic under a general quadratic, equality or inequality, constraint. Completeness comes via…

Optimization and Control · Mathematics 2017-07-21 Casper Albers , Frank Critchley , John Gower

We prove that the smallest minimizer s(f) of a real convex function f is less than or equal to a real point x if and only if the right derivative of f at x is non-negative. Similarly, the largest minimizer t(f) is greater or equal to x if…

Probability · Mathematics 2023-11-07 Dietmar Ferger
‹ Prev 1 4 5 6 7 8 10 Next ›