Related papers: On the lower semicontinuity and subdifferentiabili…
The object of investigation in this paper are vector nonlinear programming problems with cone constraints. We introduce the notion of a Fritz John pseudoinvex cone-constrained vector problem. We prove that a problem with cone constraints is…
In semidefinite programming the dual may fail to attain its optimal value and there could be a duality gap, i.e., the primal and dual optimal values may differ. In a striking paper, Ramana proposed a polynomial size extended dual that does…
We revisit the linear programming approach to deterministic, continuous time, infinite horizon discounted optimal control problems. In the first part, we relax the original problem to an infinite-dimensional linear program over a measure…
The paper concerns the investigation of nonconvex and nondifferentiable integral functionals on general Banach spaces, which may not be reflexive and/or separable. Considering two major subdifferentials of variational analysis, we derive…
Many machine learning problems, especially multi-modal learning problems, have two sets of distinct features (e.g., image and text features in news story classification, or neuroimaging data and neurocognitive data in cognitive science…
We discuss linear algebra of infinite-dimensional vector spaces in terms of algebraic (Hamel) bases. As an application we prove the surjectivity of a large class of linear partial differential operators with smooth ($\mathcal…
We consider Bergman spaces and variations of them in one or several complex variables. For some domains we show that in these spaces the generic function is totally unbounded and hence non - extendable. We also show that the generic…
Let $X$ and $Y$ be Banach or normed linear spaces and $F\subset X$ a closed set. We apply our recent extension theorem for vector-valued Baire one functions arXiv:1512.03717 to obtain an extension theorem for vector-valued functions…
A natural connection between rational functions of several real or complex variables, and subspace collections is explored. A new class of function, superfunctions, are introduced which are the counterpart to functions at the level of…
One of my recent papers transforms an NP-Complete problem into the question of whether or not a feasible real solution exists to some Linear Program. The unique feature of this Linear Program is that though there is no explicit bound on the…
In a real Hilbert space $\mathcal{H}$. Given any function $f$ convex differentiable whose solution set $\argmin_{\mathcal{H}}\,f$ is nonempty, by considering the Proximal Algorithm $x_{k+1}=\text{prox}_{\b_k f}(d x_k)$, where $0<d<1$ and…
We study optimal control problems in infinite horizon when the dynamics belong to a specific class of piecewise deterministic Markov processes constrained to star-shaped networks (inspired by traffic models). We adapt the results in [H. M.…
The primary goal of the paper is to establish characteristic properties of (extended) real-valued functions defined on normed vector spaces that admit the representation as the lower envelope of their minimal (with respect to pointwise…
Since the seminal papers by Giannessi, an interesting topic in vector optimization has been the characterization of (weak) efficiency thorough Minty and Stampacchia type variational inequalities. Several results have been proved to extend…
Real continuous submodular functions, as a generalization of the corresponding discrete notion to the continuous domain, gained considerable attention recently. The analog notion for entropy functions requires additional properties: a real…
We find an equivalent condition for a continuous vector-valued path to be Lebesgue equivalent to a twice differentiable function. For that purpose, we introduce the notion of a $VBG_{{1/2}}$ function, which plays an analogous role for the…
We consider gradient flow/gradient descent and heavy ball/accelerated gradient descent optimization for convex objective functions. In the gradient flow case, we prove the following: 1. If $f$ does not have a minimizer, the convergence…
We consider box-constrained integer programs with objective $g(Wx) + c^T x$, where $g$ is a "complicated" function with an $m$ dimensional domain. Here we assume we have $n \gg m$ variables and that $W \in \mathbb Z^{m \times n}$ is an…
The recent literature has intensively studied two classes of nonlocal variational problems, namely the ones related to the minimisation of energy functionals that act on functions in suitable Sobolev-Gagliardo spaces, and the ones related…
In his Ph.D. disseration, Feldman and his collaborators define the linear programming decoder for binary linear codes, which is a linear programming relaxation of the maximum-likelihood decoding problem. This decoder does not, in general,…