We study capacitated network flow problems with supplies and demands defined on a countably infinite collection of nodes having finite degree. This class of network flow models includes, for example, all infinite horizon deterministic dynamic programs with finite action sets since these are equivalent to the problem of finding a shortest infinite path in an … Read more
We describe a complete solution of the linear-quaratic control problem with the linear term in the objective function on a semiinfinite interval. This problem has important applications to calculation of Nesterov-Todd and other primal-dual directions in infinite-dimensional setting. Citation Technical report, University of Notre Dame, December, 2003 Article Download View Linear-quadratic control problem with a … Read more
We explicitly calculate universal barrier functions for cones generated by (weakly) Chebyshev systems over finite sets. We show that universal barrier functions corresponding to Chebyshev systems on intervals are obtained as limits of universal barrier functions of their discretizations. The results are heavily rely upon classical work of M. Krein, A. Nudelman and I.J. Schoenberg … Read more
The aim of this paper is to discuss an asymptotic approximation model and its convergence for the minimax semi-infinite programming problem. An asymptotic surrogate constraints method for the minimax semi-infinite programming problem is presented making use of two general iscreteapproximation methods. Simultaneously, we discuss the consistenceand the epi-convergence of the asymptotic approximation problem. Citation School … Read more
Cutting plane methods provide the means to solve large scale semidefinite programs (SDP) cheaply and quickly. They can also conceivably be employed for the purposes of re-optimization after branching, or the addition of cutting planes. We give a survey of various cutting plane approaches for SDP in this paper. These cutting plane approaches arise from … Read more
It is with the aim of solving scheduling problems with irregular cost functions that this paper focuses on the continuous assignment problem. It consists in partitioning a d dimensional region into subregions of prescribed volumes so that the total cost is minimized. The dual problem of the continuous assignment problem is an unconstrained maximisation of … Read more
We present a multigrid approach to the optimization of systems governed by differential equations. Such optimization problems have many applications, and are a broader class of problems than systems of equations. Using several model problems we give evidence (both theoretical and numerical) that a multigrid approach can often be successful in the setting of optimization. … Read more
Interior point methods, the traditional methods for the $SDP$, are fairly limited in the sizes of problems they can handle. This paper deals with an $LP$ approach to overcome some of these shortcomings. We begin with a semi-infinite linear programming formulation of the $SDP$ and discuss the issue of its discretization in some detail. We … Read more
In this paper we discuss duality theory of optimization problems with a linear objective function and subject to linear constraints with cone inclusions, referred to as conic linear problems. We formulate the Lagrangian dual of a conic linear problem and survey some results based on the conjugate duality approach where the questions of “no duality … Read more