Related papers: Kuhn-Tucker conditions for a convex programming pr…
Optimization problems with discrete decisions are nonconvex and thus lack strong duality, which limits the usefulness of tools such as shadow prices and the KKT conditions. It was shown in Burer(2009) that mixed-binary quadratic programs…
We prove several abstract results giving general conditions under which subspaces of linear or multilinear operators on Banach spaces or Banach lattices are closed. Each of these abstract results is followed by concrete applications,…
We derive explicit formulae for a set of constraints for the Einstein equations on a null hypersurface, in arbitrary dimensions. We solve these constraints and show that they provide necessary and sufficient conditions so that a spacetime…
There are several concepts and definitions that characterize and give optimality conditions for solutions of a vector optimization problem. One of the most important is the first-order necessary optimality condition that generalizes the…
We propose a new class of primal-dual Fejer monotone algorithms for solving systems of com- posite monotone inclusions. Our construction is inspired by a framework used by Eckstein and Svaiter for the basic problem of finding a zero of the…
The objective of this work is to study weak infeasibility in second order cone programming. For this purpose, we consider a relaxation sequence of feasibility problems that mostly preserve the feasibility status of the original problem.…
The well-posedness of the abstract \textsc{Cauchy} problem for the doubly nonlinear evolution inclusion equation of second order \begin{align*} \begin{cases} u''(t)+\partial \Psi(u'(t))+B(t,u(t))\ni f(t), &\quad t\in (0,T),\, T>0,\\…
Second-order necessary optimality conditions for nonlinear conic programming problems that depend on a single Lagrange multiplier are usually built under nondegeneracy and strict complementarity. In this paper we establish a condition of…
Constrained optimization problems where both the objective and constraints may be nonsmooth and nonconvex arise across many learning and data science settings. In this paper, we show for any Lipschitz, weakly convex objectives and…
For smooth bounded pseudoconvex domains in $mathbb{C}^{2}$, we provide geometric conditions on (the points of infinite type in) the boundary which imply compactness of the $\bar{\partial}$-Neumann operator. It is noteworthy that the proof…
The aim of this paper is to establish strong convergence theorems for a strongly relatively nonexpansive sequence in a smooth and uniformly convex Banach space. Then we employ our results to approximate solutions of the zero point problem…
Minimax optimization problems are an important class of optimization problems arising from both modern machine learning and from traditional research areas. We focus on the stability of constrained minimax optimization problems based on the…
In this paper, we study the Fenchel-Rockafellar duality and the Lagrange duality in the general frame work of vector spaces without topological structures. We utilize the geometric approach, inspired from its successful application by B. S.…
In this work we study constant-coefficient first order systems of partial differential equations and give necessary and sufficient conditions for those systems to have a well posed Cauchy Problem. In many physical applications, due to the…
We consider optimization problems in Lebesgue spaces with pointwise box constraints and finitely many additional linear constraints. We prove that the existence of a Slater point which lies strictly between the pointwise bounds and which…
Let $\mathcal{M}\subset B(\mathcal{H})$ be a semifinite von Neumann algebra, where $B(\mathcal{H})$ denotes the algebra of all bounded linear operators on a Hilbert space $\mathcal{H}$, and let $\tau$ be a fixed faithful normal semifinite…
In this article we study an optimal control problem subject to the Fokker-Planck equation \[ \partial_t \rho - \nu \Delta \rho - {\rm div } \big(\rho B[u]\big) = 0. \] The control variable $u$ is time-dependent and possibly…
For a large class of Banach spaces, a general construction of subspaces without local unconditional structure is presented. As an application it is shown that every Banach space of finite cotype contains either $l_2$ or a subspace without…
In this paper, we provide conditions under which one can take derivatives of the solution to convex optimization problems with respect to problem data. These conditions are (roughly) that Slater's condition holds, the functions involved are…
A non-local abstract Cauchy problem with a singular integral is studied, which is a closed system of two evolution equations for a real-valued function and a function-valued function. By proposing an appropriate Banach space, the…