Related papers: Monotone extensions into compact target sets in du…
While globally optimal solutions to many convex programs can be computed efficiently in polynomial time, this is, in general, not possible for nonconvex optimization problems. Therefore, locally optimal approaches or other efficient…
We develop a "metrically selfdual" variational calculus for $c$-monotone vector fields between general manifolds $X$ and $Y$, where $c$ is a coupling on $X\times Y$. Remarkably, many of the key properties of classical monotone operators…
In this paper we are concerned with solving monotone inclusion problems expressed by the sum of a set-valued maximally monotone operator with a single-valued maximally monotone one and the normal cone to the nonempty set of zeros of another…
The difference variational bicomplex, which is the natural setting for systems of difference equations, is constructed and used to examine the geometric and algebraic properties of various systems. Exactness of the bicomplex gives a…
We propose a geometric framework to describe and analyze a wide array of operator splitting methods for solving monotone inclusion problems. The initial inclusion problem, which typically involves several operators combined through…
Current state-of-the-art methods for solving discrete optimization problems are usually restricted to convex settings. In this paper, we propose a general approach based on cutting planes for solving nonlinear, possibly nonconvex, binary…
The paper is dedicated to the study of strong duality for a problem of linear copositive programming. Based on the recently introduced concept of the set of normalized immobile indices, an extended dual problem is deduced. The dual problem…
Based on concepts like kth convex hull and finer characterization of nonconvexity of a function, we propose a refinement of the Shapley-Folkman lemma and derive a new estimate for the duality gap of nonconvex optimization problems with…
This article is devoted to investigate a nonsmooth/nonconvex uncertain multiobjective optimization problem with composition fields (CUP) for brevity) over arbitrary Asplund spaces. Employing some advanced techniques of variational analysis…
A monotone self-mapping of the nonnegative orthant induces a monotone discrete-time dynamical system which evolves on the same orthant. If with respect to this system the origin is attractive then there must exists points whose image under…
We study conjugate and Lagrange dualities for composite optimization problems within the framework of abstract convexity. We provide conditions for zero duality gap in conjugate duality. For Lagrange duality, intersection property is…
This article studies convex duality in stochastic optimization over finite discrete-time. The first part of the paper gives general conditions that yield explicit expressions for the dual objective in many applications in operations…
We propose a notion of operator monotonicity for functions of several variables, which extends the well known notion of operator monotonicity for functions of only one variable. The notion is chosen such that a fundamental relationship…
We consider the problem of constructing a weakly-continuous mapping extending continuous mapping defined on a dense set of a topological space to the entire space. Theorem on necessary and sufficient conditions for the existence of such an…
The purpose of this present paper is to investigate the geometric structure of regular overdetermined systems of second order with two independent and one dependent variables from the point of view of rank 2 prolongations. Utilizing this…
We give an example of an operator with different weak and strong absolutely continuous subspaces, and a counterexample to the duality problem for the spectral components. Both examples are optimal in the scale of compact operators.
We study monotone and convex stochastic orders for processes with independent increments. Our contributions are twofold: First, we relate stochastic orders of the Poisson component to orders of their (generalized) L\'evy measures. The…
We suggest a conjugate subgradient type method without any line-search for minimization of convex non differentiable functions. Unlike the custom methods of this class, it does not require monotone decrease of the goal function and reduces…
We study the momentum operator defined on the disjoint union of two intervals. Even in one dimension, the question of two non-empty open and non-overlapping intervals has not been worked out in a way that extends the cases of a single…
It is an open problem whether any pair of Bessel sequences with wavelet structure can be extended to a pair of dual frames by adding a pair of singly generated wavelet systems. We consider the particular case where the given wavelet systems…