Related papers: Symmetric Strong Duality for a Class of Continuous…

This is a review paper, summarizing without proofs recent results by the authors on the property of strong metric subregularity (SMSR) in optimization. It presents sufficient conditions for SMSR of the optimality mapping associated with a…

Pivoting methods are of vital importance for linear programming, the simplex method being the by far most well-known. In this paper, a primal-dual pair of linear programs in canonical form is considered. We show that there exists a sequence…

We consider the conic linear program given by a closed convex cone in an Euclidean space and a matrix, where vector on the right-hand-side of the constraint system and the vector defining the objective function are subject to change. Using…

This paper is concerned with long-time strong approximations of SDEs with non-globally Lipschitz coefficients.Under certain non-globally Lipschitz conditions, a long-time version of fundamental strong convergence theorem is established for…

The goal of this paper is to investigate new and simple convergence analysis of dynamic programming for linear quadratic regulator problem of discrete-time linear time-invariant systems. In particular, bounds on errors are given in terms of…

We design controllers from formal specifications for positive discrete-time monotone systems that are subject to bounded disturbances. Such systems are widely used to model the dynamics of transportation and biological networks. The…

This paper proposes a set of closed-form conditions to ensure the strong duality of second-order cone program (SOCP) formulation for AC power flow in radial power networks. In addition, numerical evaluations on IEEE 33-bus test networks and…

We extend the notions of conditioned and controlled invariant spaces to linear dynamical systems over the max-plus or tropical semiring. We establish a duality theorem relating both notions, which we use to construct dynamic observers.…

We propose a timed and soft extension of Concurrent Constraint Programming. The time extension is based on the hypothesis of bounded asynchrony: the computation takes a bounded period of time and is measured by a discrete global clock.…

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…

We present a new kind of Lagrangian duality theory for set-valued convex optimization problems whose objective and constraint maps are defined between preordered normed spaces. The theory is accomplished by introducing a new set-valued…

We propose the use of two point Pade approximants to find expressions valid uniformly in coupling constant for theories with both weak and strong coupling expansions. In particular, one can use these approximants in models with a…

Open sets and compact saturated sets enjoy a perfect formal symmetry, at least for classes of spaces such as Stone spaces or spectral spaces. For larger classes of spaces, a perfect symmetry may not be available, although strong signs of it…

This paper presents sufficient conditions for optimal control of systems with dynamics given by a linear operator, in order to obtain an explicit solution to the Bellman equation that can be calculated in a distributed fashion. Further, the…

This paper presents a robust, distributed algorithm to solve general linear programs. The algorithm design builds on the characterization of the solutions of the linear program as saddle points of a modified Lagrangian function. We show…

Let $X$ be a Bernoulli random variable with the success probability $p$. We are interested in tight bounds on $\mathbb{E}[f(X_1,X_2)]$, where $X_i=\mathbb{E}[X| \mathcal{F}_i]$ and $\mathcal{F}_i$ are some sigma-algebras. This problem is…

Data-driven control offers a powerful alternative to traditional model-based methods, particularly when accurate system models are unavailable or prohibitively complex. While existing data-driven control methods primarily aim to construct…

In this paper, we prove the existence of weak, veryweak and duality solutions to a class of elliptic problems involving singularity and measure data which is given by: $-\Delta u+(-\Delta)^s u = \frac{f(x)}{u^\gamma} +\mu$ in $\Omega$ with…

We will define the Alexander duality for strongly stable ideals. More precisely, for a strongly stable ideal $I \subset \Bbbk[x_1, \ldots, x_n]$ with ${\rm deg}(\mathsf{m}) \le d$ for all $\mathsf{m} \in G(I)$, its dual $I^* \subset…

In this article we study a class of generalised linear systems of difference equations with given non-consistent initial conditions and infinite many solutions. We take into consideration the case that the coefficients are square constant…