By J. Douglas, Jr., R. B. Kellogg, and R. S. Varga We consider the iterative solution of the system of linear equations (1 ) (Xi + X-, + • ■ ■ + Xn)z = /, n 2; 2, where each Xj, 1 | j | n, is a Hermitian and positive definite N X N matrix. If n = 2, the iterative methods of Peaceman-Rachford [1, Chapter 7], or D'yakonov [2] and Kellogg [3], may be used to solve (1). In this paper these methods ...

We analyze the multiple cut generation scheme in the analytic center cutting plane method. We propose an optimal primal and dual updating direction when the cuts are central. The direction is optimal in the sense that it maximizes the product of the new dual slacks and of the new primal variables within the trust regions defined by Dikin’s primal and dual ellipsoids. The new primal and dual dir...

This paper approaches optimal control problems for discrete-time controlled Markov processes by representing the value of the problem in a dual Lagrangian form; the value is expressed as an infimum over a family of Lagrangian martingales of an expectation of a pathwise supremum of the objective adjusted by the Lagrangian martingale term. This representation opens up the possibility of numerical...

background: the co-existence of under and overnutrition might be influenced by a marked shift in dietary and lifestyle practices of people in developing countries. objective: this study aims to identify the factors associated with the occurrence of a dual form of malnutrition in the same households in a rural district in peninsular malaysia. methods: this study was conducted in two phases. the ...

Purpose Dual-energy computed tomography (DECT) is highly promising for material characterization and identification, whereas reconstructed material-specific images are affected by magnified noise beam-hardening artifacts. Although various DECT decomposition methods have been proposed to solve this problem, the quality of decomposed still unsatisfactory, particularly in image edges. In study, a ...

The dual simplex method is frequently the most efficient technique for solving linear programming (LP) problems. This thesis describes an efficient implementation of the sequential dual simplex method and the design and development of two parallel dual simplex solvers. In serial, many advanced techniques for the (dual) simplex method are implemented, including sparse LU factorization, hyper-spa...

The purpose of this paper is to present a new approach for solving linear programming, which has some interesting theoretical properties. In each step of the iteration, we trace a direction completely different from primal simplex method, dual simplex method, primal-dual method and interior point method. The new method is impervious to primal degeneracy and can reach a pair of exact primal and ...