English
Related papers

Related papers: The Minimum Principle for Convex Subequations

200 papers

We introduce and study a new class of generalized convex functions termed star quasiconvex functions. This class includes convex, star-convex, quasiconvex, quasar-convex, and positively homogeneous functions of any degree $p>0$ as special…

Optimization and Control · Mathematics 2026-05-27 Phan Quoc Khanh , Felipe Lara

Suppose that $N$ is a smooth manifold with a smooth Riemannian metric $g_0$, and that $\Gamma$ is a smooth submanifold of $N$. This paper proves that for a generic (in the sense of Baire category) smooth metric $g$ conformal to $g_0$, if…

Differential Geometry · Mathematics 2019-12-04 Brian White

The popular BFGS quasi-Newton minimization algorithm under reasonable conditions converges globally on smooth convex functions. This result was proved by Powell in 1976: we consider its implications for functions that are not smooth. In…

Optimization and Control · Mathematics 2017-03-21 Jiayi Guo , Adrian Lewis

For a compact convex subset $K $ of a locally convex Hausdorff space, a measurement on $A(K)$ is a finite family of positive elements in $A(K)$ normalized to the unit constant $1_K$, where $A(K)$ denotes the set of continuous real affine…

Functional Analysis · Mathematics 2020-10-23 Yui Kuramochi

Let $\mathcal{G} = \{G_1 = (V, E_1), \dots, G_m = (V, E_m)\}$ be a collection of $m$ graphs defined on a common set of vertices $V$ but with different edge sets $E_1, \dots, E_m$. Informally, a function $f :V \rightarrow \mathbb{R}$ is…

Spectral Theory · Mathematics 2022-03-03 Ronald R. Coifman , Nicholas F. Marshall , Stefan Steinerberger

The main result (roughly) is that if (H_i) converges weakly to H and if also f(H_i) converges weakly to f(H), for a single strictly convex continuous function f, then (H_i) must converge strongly to H. One application is that if f(pr(H)) =…

Functional Analysis · Mathematics 2017-06-09 Lawrence G. Brown

We consider global efficiency of algorithms for minimizing a sum of a convex function and a composition of a Lipschitz convex function with a smooth map. The basic algorithm we rely on is the prox-linear method, which in each iteration…

Optimization and Control · Mathematics 2017-08-16 Dmitriy Drusvyatskiy , Courtney Paquette

Consider a domain D in R^3 which is convex (possibly all R^3) or which is smooth and bounded. Given any open surface M, we prove that there exists a complete, proper minimal immersion f : M --> D. Moreover, if D is smooth and bounded, then…

Differential Geometry · Mathematics 2009-03-26 Leonor Ferrer , Francisco Martin , William H. Meeks

The usual approach to developing and analyzing first-order methods for smooth convex optimization assumes that the gradient of the objective function is uniformly smooth with some Lipschitz constant $L$. However, in many settings the…

Optimization and Control · Mathematics 2017-10-11 Haihao Lu , Robert M. Freund , Yurii Nesterov

Let $\mathcal{A}$ be a $C^*$-algebra and $\phi:\cA\to L(H)$ be a positive unital map. Then, for a convex function $f:I\to \mathbb{R}$ defined on some open interval and a self-adjoint element $a\in \mathcal{A}$ whose spectrum lies in $I$, we…

Functional Analysis · Mathematics 2007-05-23 Jorge Antezana , Pedro Massey , Demetrio Stojanoff

Semi-inner-products in the sense of Lumer are extended to convex functionals. This yields a Hilbert-space like structure to convex functionals in Banach spaces. In particular, a general expression for semi-inner-products with respect to one…

Numerical Analysis · Mathematics 2015-11-17 Guy Gilboa

We present both necessary and sufficient conditions to the convex closed shape $X$ such that the inequality $$ \frac{1}{|X|} \int_X f(x)\:dx \le \frac{1}{|\partial X|} \int_{\partial X} f(x)\:dx$$ is valid for every convex function $f…

Classical Analysis and ODEs · Mathematics 2020-01-22 Paweł Pasteczka

Given a compact subset $F$ of $\mathbb{R}^2$, the visible part $V_\theta F$ of $F$ from direction $\theta$ is the set of $x$ in $F$ such that the half-line from $x$ in direction $\theta$ intersects $F$ only at $x$. It is suggested that if…

Metric Geometry · Mathematics 2013-07-26 Kenneth J. Falconer , Jonathan M. Fraser

In the biharmonic submanifolds theory there is a generalized Chen's conjecture which states that biharmonic submanifolds in a Riemannian manifold with non-positive sectional curvature must be minimal. This conjecture turned out false by a…

Differential Geometry · Mathematics 2014-05-30 Yong Luo

We investigate the notion of H-subdifferential and H-normal map of a function on the Heisenberg group, based on its sub-Riemannian structure. In particular, a characterization of the convexity of a function is given via the nonemptiness of…

Differential Geometry · Mathematics 2008-11-17 A. Calogero , R. Pini

Let $\mathbb C$ be the complex plane, $E$ be a measurable subset in a segment $[0, R]$ of the positive semiaxis $\mathbb R^+$, $u\not\equiv -\infty$ be a subharmonic function on $\mathbb C$. The main result of this article is an upper…

Complex Variables · Mathematics 2019-11-07 Liliia Gabdrakhmanova , Bulat Khabibullin

Let $D$ be a pseudoconvex domain in $\C^k_t\times\Cn_z$ and let $\phi$ be a plurisubharmonic function in $D$. For each $t$ we consider the $n$-dimensional slice of $D$, $D_t=\{z; (t,z)\in D\}$, let $\phi^t$ be the restriction of $\phi$ to…

Complex Variables · Mathematics 2007-05-23 Bo Berndtsson

Consider a sum of convex functions, where the only information known about each individual summand is the location of a minimizer. In this work, we give an exact characterization of the set of possible minimizers of the sum. Our results…

Optimization and Control · Mathematics 2024-03-11 Moslem Zamani , François Glineur , Julien M. Hendrickx

Here we develop some basic analytic tools to study compactness properties of $J$-curves (i.e. pseudo-holomorphic curves) when regarded as submanifolds. Incorporating techniques from the theory of minimal surfaces, we derive an inhomogeneous…

Symplectic Geometry · Mathematics 2010-05-06 Joel W. Fish

Functions that are piecewise defined are a common sight in mathematics while convexity is a property especially desired in optimization. Suppose now a piecewise-defined function is convex on each of its defining components - when can we…

Classical Analysis and ODEs · Mathematics 2014-08-19 Heinz H. Bauschke , Yves Lucet , Hung M. Phan
‹ Prev 1 8 9 10 Next ›