In this paper, we develop various calculus rules for general smooth matrix-valued functions and for the class of matrix convex (or concave) functions first introduced by Loewner and Kraus in 1930s. Then we use these calculus rules and the matrix convex function -log X to study a new notion of...

In this paper we introduce robust versions of the classical static and dynamic single leg seat allocation models as analyzed by Wollmer, and Lautenbacher and Stidham, respectively. These robust models take into account the inaccurate estimates of the underlying probability distributions. As...

In this note we give a short and easy proof of the equivalence of Hakimi's one-median problem and the k-server-facility-loss median problem as discussed by Chiu and Larson in Computer and Operation Research. The proof makes only use of a stochastic monotonicity result for birth and death...

In this paper we present two algorithms for a machine allocation problem occurring in manufacturing systems. For the two algorithms presented we prove worst-case performance ratios of 2 and 312, respectively. The machlne allocat~on problem we consider is a general convex resource allocation...

In this paper we consider optimization problems defined by a quadratic objective function and a finite number of quadratic inequality constraints. Given that the objective function is bounded over the feasible set, we present a comprehensive study of the conditions under which the optimal...

How to initialize an algorithm to solve an optimization problem is of great theoretical and practical importance. In the simplex method for linear programming this issue is resolved by either the two-phase approach or using the so-called big M technique. In the interior point method, there is a...

This paper establishes the superlinear convergence of a symmetric primal-dual path following algorithm for semidefinite programming under the assumptions that the semidefinite program has a strictly complementary primal-dual optimal solution and that the size of the central path neighborhood...

This paper considers the problem of minimizing a linear function over the intersection of an affine space with a closed convex cone. In the first half of the paper, we give a detailed study of duality properties of this problem and present examples to illustrate these properties. In particular,...

This paper presents a unified study of duality properties for the problem of minimizing a linear function over the intersection of an affine space with a convex cone in finite dimension. Existing duality results are carefully surveyed and some new duality properties are established. Examples are...

In this paper Lipschitzian type error bounds are derived for general convex conic problems under various regularity conditions. Specifically, it is shown that if the recession directions satisfy Slater's condition then a global Lipschitzian type error bound holds. Alternatively, if the feasible...