Related papers: Convexity of level sets and a two-point function

Bilevel programming has recently received a great deal of attention due to its abundant applications in many areas. The optimal value function approach provides a useful reformulation of the bilevel problem, but its utility is often limited…

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…

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…

Let X be a compact convex set and let ext X stand for the set of extreme points of X. We show that an affine function with the point of continuity property on X satisfies the minimum principle. As a corollary we obtain a generalization of a…

The stochastic gradient descent has been widely used for solving composite optimization problems in big data analyses. Many algorithms and convergence properties have been developed. The composite functions were convex primarily and…

We consider the problem of maximizing a convex function over a closed convex set in a real Hilbert space. For linear functions, we show that a single orthogonal projection suffices to obtain an approximate solution. For continuous convex…

Critical points of an invariant function may or may not be symmetric. We prove, however, that if a symmetric critical point exists, those adjacent to it are generically symmetry breaking. This mathematical mechanism is shown to carry…

In this paper we introduce and study the concept of set extremality for systems of convex sets in vector spaces without topological structures. Characterizations of the extremal systems of sets are obtained in the form of the convex…

In this paper we prove a strong maximum principle for certain parabolic systems of equations. In particular, our methods place no restriction on the regularity of the boundary of the convex set in which the system takes its values, and…

This paper gives two different proofs to a structural theorem of decreasing minimization (lexicographic optimization) on integrally convex sets. The theorem states that the set of decreasingly minimal elements of an integrally convex set…

We present a minimax optimal solution to the problem of estimating a compact, convex set from finitely many noisy measurements of its support function. The solution is based on appropriate regularizations of the least squares estimator.…

It is established that general s-convex functions are a new class of generalized convex functions. In a similar vein, a new class of general s-convex sets is introduced, which are generalizations of s-convex sets. Additionally, certain…

This note presents a new, self-contained proof of Shahgholian's geometric theorem on quadrature surfaces using the thickness function and level set methods. By relying on a radial parametrisation and fundamental maximum principles, the…

For many applications, we need to use techniques to represent convex shapes and objects. In this work, we use level set method to represent shapes and find a necessary and sufficient condition on the level set function to guarantee the…

It has been a widely belief that for a planar convex domain with two coordinate axes of symmetry, the location of maximal norm of gradient of torsion function is either linked to contact points of largest inscribed circle or connected to…

An algorithm which computes a solution of a set optimization problem is provided. The graph of the objective map is assumed to be given by finitely many linear inequalities. A solution is understood to be a set of points in the domain…

A recent article Li and Lv considered contraction of convex hypersurfaces by certain nonhomogeneous functions of curvature, showing convergence to points in finite time in certain cases where the speed is a function of a degree-one…

Seeking the convex hull of an object is a very fundamental problem arising from various tasks. In this work, we propose two variational convex hull models using level set representation for 2-dimensional data. The first one is an exact…

This paper is designed to be a practical tool for constructing and investigating two-point correlation functions in defect conformal field theory, directly in physical space, between any two bulk primaries or between a bulk primary and a…

We establish existence of steepest descent curves emanating from almost every point of a regular locally Lipschitz quasiconvex functions, where regularity means that the sweeping process flow induced by the sublevel sets is reversible. We…