Related papers: The necessary and sufficient conditions for repres…
New sufficient conditions for representation of a function of several variables as an absolutely convergent Fourier integral are obtained in the paper.
Estimation of convex functions finds broad applications in engineering and science, while convex shape constraint gives rise to numerous challenges in asymptotic performance analysis. This paper is devoted to minimax optimal estimation of…
Given a function f in the exterior of a convex curve in the real plane, we prove that if the restrictions of f to the tangent lines to the curve extend as entire functions, then the function f is an entire function of two variables.
By applying some techniques of set-valued and variational analysis, we study solution stability of nonhomogeneous split equality problems and nonhomogeneous split feasibility problems, where the constraint sets need not be convex. Necessary…
The paper investigates two inertial extragradient algorithms for seeking a common solution to a variational inequality problem involving a monotone and Lipschitz continuous mapping and a fixed point problem with a demicontractive mapping in…
This paper is devoted to the study of a newly introduced tool, projectional coderivatives and the corresponding calculus rules in finite dimensions. We show that when the restricted set has some nice properties, more specifically, is a…
We present in this paper two different classes of general $K$-splitting algorithms for solving finite-dimensional convex optimization problems. Under the assumption that the function being minimized has a Lipschitz continuous gradient, we…
Here Lipschitz conditions are used as a primary tool, for studying curves in metric spaces in particular.
This paper is concerned with the Frank--Wolfe algorithm for a special class of {\it non-compact} constrained optimization problems. The notion of asymptotic cone is used to introduce this class of problems as well as to establish that the…
We give necessary and sufficient conditions for a pair of (generalized) functions $\rho_1(\mathbf{r}_1)$ and $\rho_2(\mathbf{r}_1,\mathbf{r}_2)$, $\mathbf{r}_i\in X$, to be the density and pair correlations of some point process in a…
We consider a Cauchy problem for a (first-order) path-dependent Hamilton--Jacobi equation with coinvariant derivatives and a right-end boundary condition. Such problems arise naturally in the study of properties of the value functional in…
We present a convex solution for the design of generalized accelerated gradient algorithms for strongly convex objective functions with Lipschitz continuous gradients. We utilize integral quadratic constraints and the Youla parameterization…
This paper studies NET map slope functions. It establishes Lipschitz-type conditions for them. It relates Lipschitz-type conditions to the half-space theorem. It gives bounds on the number of slope function fixed points. It provides…
Given a pair of real functions $(k,f)$, we study the conditions they must satisfy for $k+\lambda f$ to be the curvature in the arc-length of a closed planar curve for all real $\lambda$. Several equivalent conditions are pointed out,…
When dealing with certain mathematical problems, it is sometimes necessary to show that some function induces a metric on a certain space. When this function is not a well renowned example of a distance, one has to develop very particular…
Polyhedral convex set optimization problems are the simplest optimization problems with set-valued objective function. Their role in set optimization is comparable to the role of linear programs in scalar optimization. Vector linear…
We prove that entire conformal curves $\mathbb{R}^n \rightarrow \mathbb{R}^m$ fall into two classes: either the curve is affine or the average energy in a ball is strictly increasing for large radii and diverges to infinity. This rigidity…
For solving a broad class of nonconvex programming problems on an unbounded constraint set, we provide a self-adaptive step-size strategy that does not include line-search techniques and establishes the convergence of a generic approach…
We study the problem of synthesizing polyhedral Lyapunov functions for hybrid linear systems. Such functions are defined as convex piecewise linear functions, with a finite number of pieces. We first prove that deciding whether there exists…
It is proved that a parameterized curve in a metric space $X$ is absolutely continuous if and only if its composition with any Lipschitz function on $X$ is absolutely continuous.