Related papers: Kuhn-Tucker conditions for a convex programming pr…
Characterization of simultaneously similarity for commuting $m$-tuples of operators is an open problem even in finite-dimensional spaces; known as ``A wild problem in linear algebra". In this paper we offer a criteria for simultaneously…
In this paper, we examine the problem of partial inference in the context of structured prediction. Using a generative model approach, we consider the task of maximizing a score function with unary and pairwise potentials in the space of…
Optimization theory in Banach spaces suffers from the lack of available constraint qualifications. Despite the fact that there exist only a very few constraint qualifications, they are, in addition, often violated even in simple…
A conic program is the problem of optimizing a linear function over a closed convex cone intersected with an affine preimage of another cone. We analyse three constraint qualifications, namely a Closedness CQ, Slater CQ, and Boundedness CQ…
Motivated by some applications in signal processing and machine learning, we consider two convex optimization problems where, given a cone $K$, a norm $\|\cdot\|$ and a smooth convex function $f$, we want either 1) to minimize the norm over…
Using a technique of adjoining an order unit to a normed linear space, we have characterized strictly convex spaces among normed linear spaces and Hilbert spaces among strictly convex Banach spaces respectively. This leads to a…
We prove well-posedness in weighted tent spaces of weak solutions to the Cauchy problem $\partial_t u - \mathrm{div} A \nabla u = f, u(0)=0$, where the source $f$ also lies in (different) weighted tent spaces, provided the complex…
Convex optimization with equality and inequality constraints is a ubiquitous problem in several optimization and control problems in large-scale systems. Recently there has been a lot of interest in establishing accelerated convergence of…
For a Hilbert space setting Chambolle and Pock introduced an attractive first-order algorithm which solves a convex optimization problem and its Fenchel dual simultaneously. We present a generalization of this algorithm to Banach spaces.…
We answer in the affirmative the following question raised by H. H. Corson in 1961: "Is it possible to cover every Banach space X by bounded convex sets with nonempty interior in such a way that no point of X belongs to infinitely many of…
In this article, we discuss an exact algorithm for solving mixed integer concave minimization problems. A piecewise inner-approximation of the concave function is achieved using an auxiliary linear program that leads to a bilevel program,…
We explore the geometry behind the modular bootstrap and its image in the space of Taylor coefficients of the torus partition function. In the first part, we identify the geometry as an intersection of planes with the convex hull of moment…
The concept of nonlinear split ordered variational inequality problems on partially ordered vector spaces is a natural extension of linear split vector variational inequality problems on Banach spaces. The results about nonlinear split…
A well-known result of R. Pol states that a Banach space $X$ has property ($\mathcal{C}$) of Corson if and only if every point in the weak*-closure of any convex set $C \subseteq B_{X^*}$ is actually in the weak*-closure of a countable…
This paper introduces a new method for solving quadratic programs using primal-dual interior-point methods. Instead of handling complementarity as an explicit equation in the Karush-Kuhn-Tucker (KKT) conditions, we ensure that…
A semi-local analysis of Newton's method for solving nonlinear inclusion problems in Banach space is presented in this paper. Under a affine majorant condition on the nonlinear function which is associated to the inclusion problem, the…
We prove that a separable Banach space $E$ does not contain a copy of the space $\co$ of null-sequences if and only if for every doubly power-bounded operator $T$ on $E$ and for every vector $x\in E$ the relative compactness of the sets…
We derive a hierarchy of continuous-variable multipartite entanglement conditions in terms of second-order moments of position and momentum operators that generalizes existing criteria. Each condition corresponds to a convex optimization…
A 1972 duality conjecture due to Pietsch asserts that the entropy numbers of a compact operator acting between two Banach spaces and those of its adjoint are (in an appropriate sense) equivalent. This is equivalent to a dimension free…
In the first part of this work [32], we introduce a convex parabolic relaxation for quadratically-constrained quadratic programs, along with a sequential penalized parabolic relaxation algorithm to recover near-optimal feasible solutions.…