Since I started working in the area of nonlinear programming and, later on, variational
inequality problems, I have frequently been surprised to find that many algorithms, however …

The efficient solution of large-scale linear and nonlinear optimization problems may require
exploiting any special structure in them in an efficient manner. We describe and analyze …

We present an advanced model for the formulation and solution of large scale fleet
assignment problems that arise in the scheduling of air transportation. Fleet assignment …

For all practical purposes three types of nonlinear assignment problems (NAPs) have
emerged in the literature, the Quadratic, the Cubic and the Biquadratic assignment …

A new approximate proximal point method for minimizing the sum of two convex functions is
introduced. It replaces the original problem by a sequence of regularized subproblems in …

We study the coarse-grained parallelization of an efficient bundle-based cost-decomposition
algorithm for the solution of multicommodity min-cost flow (MMCF) problems. We show that a …

Multilevel decision theory arises to resolve the contradiction between increasing
requirements towards the process of design, synthesis, control and management of complex …

We develop and compare three decomposition algorithms derived from the method of
alternating directions. They may be viewed as block Gauss-Seidel variants of augmented …

In this thesis we develop efficient algorithms for the solution of large-scale convex block-
angular minimization problems on a Multiple-Instruction-Multiple-Data parallel environment …

In this thesis we develop an efficient decomposition method for large-scale convex cost multi-
commodity network flow problems. The coupling constraints are moved to the objective …