Related papers: Two-point functions and their applications in geom…
We establish Maximum Principles which apply to vectorial approximate minimizers of the general integral functional of Calculus of Variations. Our main result is a version of the Convex Hull Property. The primary advance compared to results…
We develop a method for multidimensional optimisation using flow equations. This method is based on homotopy continuation in combination with a maximum entropy approach. Extrema of the optimising functional correspond to fixed points of the…
A proof of convergence is given for a novel evolving surface finite element semi-discretization of Willmore flow of closed two-dimensional surfaces, and also of surface diffusion flow. The numerical method proposed and studied here…
A large deviation principle is established for a general class of stochastic flows in the small noise limit. This result is then applied to a Bayesian formulation of an image matching problem, and an approximate maximum likelihood property…
Huisken and Sinestrari have recently defined a surgery process for mean curvature flow when the initial data is a two-convex hypersurface. The process depends on a parameter H. Its role is to initiate a surgery when the maximum of the mean…
This paper revisits the well-studied fixed point problem from a unified viewpoint of mathematical modeling and canonical duality theory, i.e. the original problem is first reformulated as a nonconvex optimization problem, its well-posedness…
A fully discrete finite element method, based on a new weak formulation and a new time-stepping scheme, is proposed for the surface diffusion flow of closed curves in the two-dimensional plane. It is proved that the proposed method can…
We prove several geometric theorems using tools from the theory of convex optimization. In the Riemannian setting, we prove the max flow-min cut theorem for boundary regions, applied recently to develop a "bit-thread" interpretation of…
This paper derives some discrete maximum principles for $P1$-conforming finite element approximations for quasi-linear second order elliptic equations. The results are extensions of the classical maximum principles in the theory of partial…
We present a generic solution to the fundamental problem of how to connect two points in a plane by a smooth curve that goes through these points with a given slope. The smoothness of any curve depends both on its curvature and its length.…
The proximal point algorithm, which is a well-known tool for finding minima of convex functions, is generalized from the classical Hilbert space framework into a nonlinear setting, namely, geodesic metric spaces of nonpositive curvature. We…
An effective method for generating linear equations of maximal symmetry in their much general normal form is obtained. In the said normal form, the coefficients of the equation are differential functions of the coefficient of the term of…
Using double-smoothing technique and stochastic mirror descent with inexact oracle we built an optimal algorithm (up to a multiplicative factor) for two-points gradient-free non-smooth stochastic convex programming. We investigate how much…
In this article we develop a duality principle and concerning computational method for a structural optimization problem in elasticity. We consider the problem of finding the optimal topology for an elastic solid which minimizes its…
We consider the $L^p$ mapping properties of maximal averages associated to families of curves, and thickened curves, in the plane. These include the (planar) Kakeya maximal function, the circular maximal functions of Wolff and Bourgain, and…
This paper is about the influence of Geometry on the qualitative behaviour of solutions of quasilinear PDEs on Riemannian manifolds. Motivated by examples arising, among others, from the theory of submanifolds, in particular by the study of…
A novel method has been introduced to solve a point inclusion in a polygon problem. The method is applicable to convex as well as non-convex polygons which are not self-intersecting. The introduced method is independent of rounding off…
We describe a new algorithm to compute the geometric intersection number between two curves, given as edge vectors on an ideal triangulation. Most importantly, this algorithm runs in polynomial time in the bit-size of the two edge vectors.…
In $\mathcal{N}=1$ superconformal theories in four dimensions the two-point function of superconformal multiplets is known up to an overall constant. A superconformal multiplet contains several conformal primary operators, whose two-point…
Constrained quasiconvex optimization problems appear in many fields, such as economics, engineering, and management science. In particular, fractional programming, which models ratio indicators such as the profit/cost ratio as fractional…