In this paper we consider the parameter space of all the linear inequality systems, in the n-
dimensional Euclidean space, with a fixed and arbitrary (possibly infinite) index set. This …

In recent years, a body of research into" condition numbers" for convex optimization has
been developed, aimed at capturing the intuitive notion of problem behavior. This research …

In this paper we measure how much a linear optimization problem, in R^n, has to be
perturbed in order to lose either its solvability (ie, the existence of optimal solutions) or its …

We characterize those linear optimization problems that are ill-posed in the sense that
arbitrarily small perturbations of the problem's data may yield both, solvable and unsolvable …

In this article, we consider the space of all the linear semi-infinite programming (LSIP)
problems with a given infinite compact Hausdorff index set, a given number of variables and …

We present a novel analysis of semidefinite programs (SDPs) with positive duality gaps, ie
different optimal values in the primal and dual problems. These SDPs are extremely …

This paper deals with the so-called total ill-posedness of linear optimization problems with
an arbitrary (possibly infinite) number of constraints. We say that the nominal problem is …

In this article we consider the parameter space of all the linear constraint systems, in the n-
dimensional Euclidean space, whose inequality constraints are indexed by an arbitrary, but …

We associate with each natural number n and each compact Hausdorff topological space T
the space of linear optimization problems with n primal variables and index set T (for the …

This online technical report presents abstracts (short outlines) of papers related to
semidefinite programming. The papers are grouped by subject. This is not an exhaustive list …