Learn More
The paper presents concrete realizations of quasi-Newton methods for solving several standard problems including complementarity problems, special variational inequality problems, and the Karush–Kuhn–Tucker (KKT) system of nonlinear programming. A new approximation idea is introduced in this paper. The Q-superlinear convergence of the Newton method and the(More)
Recently, important contributions on convergence studies of conjugate gradient methods have been made by Gilbert and Nocedal [6]. They introduce a “sufficient descent condition” to establish global convergence results, whereas this condition is not needed in the convergence analyses of Newton and quasi-Newton methods, [6] hints that the sufficient descent(More)
Resource allocation problem for local reserve depots in disaster management is considered in this paper. In order to prepare for natural and manmade disasters of various scales, local government need to decide what kinds of and how much amount of commodities should be maintained in local reserve depots in order to cope with slight disasters, while(More)
In efforts to obtain anticancer prodrugs for antibody-directed or gene-directed enzyme prodrug therapy using E. coli nitroreductase, a series of nitrobenzylphosphoramide mustards were designed and synthesized incorporating a strategically placed nitro group in a position para to the benzylic carbon for reductive activation. All analogues were good(More)
In efforts to obtain potential anticancer prodrugs for gene-directed enzyme prodrug therapy using Eschericia coli nitroreductase, a series of four benzocyclophosphamide analogues were designed and synthesized incorporating a strategically placed nitro group in a position para to the benzylic carbon for reductive activation. All four analogues were found to(More)
We investigate the problem of on-line scheduling open shops of two and three machines with an objective of minimizing the schedule makespan. We 1rst propose a 1.848-competitive permutation algorithm for the non-preemptive scheduling problem of two machines and show that no permutation algorithm can be better than 1.754-competitive. Secondly, we develop a(More)