相关论文: Convex-compactness and its applications

Composite minimization involves a collection of smooth functions which are aggregated in a nonsmooth manner. In the convex setting, we design an algorithm by linearizing each smooth component in accordance with its main curvature. The…

With a simple generic approach, we develop a classification that encodes and measures the strength of completeness (or compactness) properties in various types of spaces and ordered structures. The approach also allows us to encode notions…

In this paper, we establish compactness for various geometric curvature energies including integral Menger curvature, and tangent-point repulsive potentials, defined a priori on the class of compact, embedded $m$-dimensional Lipschitz…

The Weber problem consists of finding a point in $\mathbbm{R}^n$ that minimizes the weighted sum of distances from $m$ points in $\mathbbm{R}^n$ that are not collinear. An application that motivated this problem is the optimal location of…

This paper is devoted to a systematic study and characterizations of the fundamental notions of variational and strong variational convexity for lower semicontinuous functions. While these notions have been quite recently introduced by…

We give a systematic and thorough study of geometric notions and results connected to Minkowski's measure of symmetry and the extension of the well-known Minkowski functional to arbitrary, not necessarily symmetric convex bodies K on any…

We extend Polyak's theorem on the convexity of joint numerical range from three to any number of quadratic forms on condition that they can be generated by three quadratic forms with a positive definite linear combination. Our new result…

We consider the convex optimization problem $\min \{f(x) : g_j(x)\leq 0, j=1,...,m\}$ where $f$ is convex, the feasible set K is convex and Slater's condition holds, but the functions $g_j$ are not necessarily convex. We show that for any…

This monograph presents the main complexity theorems in convex optimization and their corresponding algorithms. Starting from the fundamental theory of black-box optimization, the material progresses towards recent advances in structural…

In the first part of this doctoral thesis we develop a regularity theory for a polyconvex functional in compressible elasticity. In the second part, we will concentrate on uniqueness questions in various situations of finite elasticity.…

Convex clustering is a recent stable alternative to hierarchical clustering. It formulates the recovery of progressively coalescing clusters as a regularized convex problem. While convex clustering was originally designed for handling…

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…

Higher-order tensor methods were recently proposed for minimizing smooth convex and nonconvex functions. Higher-order algorithms accelerate the convergence of the classical first-order methods thanks to the higher-order derivatives used in…

We propose finitely convergent methods for solving convex feasibility problems defined over a possibly infinite pool of constraints. Following other works in this area, we assume that the interior of the solution set is nonempty and that…

In this paper, we introduce the concepts of m-quasiconvex, originally m-quasiconvex,and generalized m-quasiconvex functionals on topological vector spaces. Then we extend the concept of point separable topological vector spaces (by the…

Motivated by results of J. R. Kline and R. L. Moore (1919) that a compact subset of the plane, homeomorphic to a subset of the reals, lies on the arc, we give a purely topological characterisation of compact sets of the reals. This allows…

We expand the basic geometric elements of the simplex method to linear programs in locally convex topological vector spaces and provide conditions under which the method converges in value to optimality. This setting generalizes many…

A sufficient condition is established for the existence of a solution to the equation $\mathcal{T}(u,\mathcal{C}(u))=u$, by considering a class of Kannan type equicontraction mappings $\mathcal{T}:\mathcal{A}\times…

In this paper we introduce and study a new sequence of positive linear operators acting on function spaces defined on a convex compact subset. Their construction depends on a given Markov operator, a positive real number and a sequence of…

We study a combinatorial notion where given a set of lattice points one takes the set of all sums of subsets of a fixed size, and we ask if the given set comes from a convex lattice polytope whether the resulting set also comes from a…