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

We present a new method for minimizing the sum of a differentiable convex function and an $\ell_1$-norm regularizer. The main features of the new method include: $(i)$ an evolving set of indices corresponding to variables that are predicted…

Let X be a Tychonoff space and MC(X) be the space of convex minimal usco maps with values in R, the space of real numbers. Such set-valued maps are important in the study of subdifferentials of convex functions. Using the strong Choquet…

The optimization problem concerning the determination of the minimizer for the sum of convex functions holds significant importance in the realm of distributed and decentralized optimization. In scenarios where full knowledge of the…

This paper studies simple bilevel problems, where a convex upper-level function is minimized over the optimal solutions of a convex lower-level problem. We first show the fundamental difficulty of simple bilevel problems, that the…

In this paper we give an elementary proof of the fact that every uniquely remotal set is singleton in a finite dimensional strictly convex normed linear space. We show that if A is a uniquely remotal M-compact subset with the derived set of…

Given a random sequence of holomorphic maps $f_1,f_2,f_3,...$ of the unit disk $\Delta$ to a subdomain $X$, we consider the compositions $$F_n=f_1 \circ f_{2} \circ ... f_{n-1} \circ f_n.$$ The sequence $\{F_n\}$ is called the {\em iterated…

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…

We prove that if $f:\mathbb{R}^n\to\mathbb{R}$ is convex and $A\subset\mathbb{R}^n$ has finite measure, then for any $\varepsilon>0$ there is a convex function $g:\mathbb{R}^n\to\mathbb{R}$ of class $C^{1,1}$ such that $\mathcal{L}^n(\{x\in…

One revisits the standard saddle-point method based on conjugate duality for solving convex minimization problems. Our aim is to reduce or remove unnecessary topological restrictions on the constraint set. Dual equalities and…

This note deals with certain properties of convex functions. We provide results on the convexity of the set of minima of these functions, the behaviour of their subgradient set under restriction, and optimization of these functions over an…

Given a proper convex lower semicontinuous function defined on a Hilbert space and whose solution set is supposed nonempty. For attaining a global minimizer when this convex function is continuously differentiable, we approach it by a…

The paper is devoted to determine necessary and sufficient conditions for existence of solutions to the problem ${\rm inf}{{\rm ess sup}_{x \in \Omega} f(\nabla u(x)): u \in u_0 + W^{1,\infty}_0(\Omega)}$ when the supremand $f$ is not…

In this paper provide sufficient and necessary conditions for the minimax equality for extended-valued $\Phi$-convex functions. As an application we establish sufficient and necessary conditions for the minimax equality for convex-concave…

Given an approximately continuous function $f$ in an Orlicz space $L^\Phi([a,b]),$ for a suitable class of convex functions $\Phi,$ we employ a characterization of the best monotone approximation set to establish its continuity, which in…

In this paper, we consider a finite-dimensional optimization problem minimizing a continuous objective on a compact domain subject to a multi-dimensional constraint function. For the latter, we assume the availability of a global Lipschitz…

Let $f\colon X\to Y$ be a perfect surjective map of metrizable spaces. It is shown that if $Y$ is a $C$-space (resp., $\dim Y\leq n$ and $\dim f\leq m$), then the function space $C(X,\uin^{\infty})$ (resp., $C(X,\uin^{2n+1+m})$) equipped…

The divergence minimization problem plays an important role in various fields. In this note, we focus on differentiable and strictly convex divergences. For some minimization problems, we show the minimizer conditions and the uniqueness of…

Let $(X,d,m)$ be a proper, non-branching, metric measure space. We show existence and uniqueness of optimal transport maps for cost written as non-decreasing and strictly convex functions of the distance, provided $(X,d,m)$ satisfies a new…

We study a Newton-like method for the minimization of an objective function that is the sum of a smooth convex function and an l-1 regularization term. This method, which is sometimes referred to in the literature as a proximal Newton…

Given the action of a group $G$ on a set $ X $ , the set of $ G $ -equivariant functions, those that commute with the action, i.e., $ f(g \cdot x) = g \cdot f(x) $ for all $ x \in X $ , $ g \in G $ , forms a monoid under function…