On Conjugate Gradient Algorithms as Objects of Scientific Study (with an appendix), Optimization Methods and Software, 18, pp. 555-565 (2003); 19, pp. 437-438 (2004).

Gilding the Lily: a Variant of the Nelder-Mead Algorithm based on Golden-Section Search (with P. Tseng), Computational Optimization and Applications, 22, pp. 123-144 (2002).

Unconstrained Nonlinear Optimization: Newton-Cauchy Framework. In C.A. Floudas and P.M. Pardalos (Eds.), Encyclopedia of Optimization, Kluwer Academic Publishers, Dordrecht and Boston, Vol. V (R-Z), pp. 481-486 (2001).

Conjugate Gradient Methods. In C.A. Floudas and P.M. Pardalos (Eds.), Encyclopedia of Optimization, Kluwer Academic Publishers, Dordrecht and Boston, Vol. I (A-D), pp. 319-323 (2001).

Multialgorithms for Parallel Computing: A New Paradigm for Optimization. In S. Uryasev and P.M. Pardalos (Eds.), Stochastic Optimization: Algorithms and Applications, Kluwer Academic Publishers, Dordrecht and Boston, pp. 183-222 (2001).

The ${D}_{L}P$ Decision Support System and its Extension to Stochastic Programming, Optimization Methods and Software, 13, pp. 117-154 (2000).

The Quasi-Cauchy Relation and Diagonal Updating (with M. Zhu and H. Wolkowicz), SIAM Journal on Optimization, 9, pp. 1192-1204 (1999).

BFGS with Update Skipping and Varying Memory (with T.G. Kolda and D.P. O'Leary), SIAM Journal on Optimization, 8, pp. 1060-1083 (1998).

Computer Solution of Linear Programs: Non-Simplex Algorithms. In Y. Yuan (Ed.), Advances in Nonlinear Programming, Kluwer Academic Publishers, Dordrecht and Boston, pp. 119-151 (1998).

Deriving Potential Functions via a Symmetry Principle for Nonlinear Equations, Operations Research Letters, 21, pp. 147-152 (1997).

Metric-based Symmetric Rank-One Updates (with B. Smith), Computational Optimization and Applications, 8, pp. 219-244 (1997).

A Pavement Network Optimization System Using Dantzig-Wolfe Decomposition (with E. Alviti, E.G. Johnson, R.B. Kulkarni and J.C. Stone). In P.M. Pardalos, D. Hearn and W. Hager (Eds.), Network Optimization, Lecture Notes in Economics and Mathematical Sciences, Springer-Verlag, pp. 1-16 (1997).

The Implementation of Linear Programming Algorithms Based on Homotopies, Algorithmica, 15, pp. 332-350 (1996).

Lagrangian Globalization: Solving Nonlinear Equations via Constrained Optimization. In J. Renegar, M. Shub and S. Smale (Eds.), Mathematics of Numerical Analysis, The American Mathematical Society, Providence, RI, pp. 533-542 (1996).

Globalization of Newton's Method for Solving Nonlinear Equations (with Liqun Qi), Numerical Linear Algebra with Applications, 3, pp. 239-249 (1996).

A View of Conjugate Gradient-Related Algorithms for Nonlinear Optimization. In L. Adams and J.L. Nazareth (Eds.), Linear and Nonlinear Conjugate Gradient-Related Methods, SIAM, Philadelphia, pp. 149-164 (1996).

Trust Regions Based on Conic Functions for Linear and Nonlinear Programming, J. Numerical Linear Algebra and Applications, 2, 235-241 (1995).

A Framework for Interior Methods of Linear Programming, Optimization Methods and Software, 5, 227-234 (1995).

Enhancements of the Network Optimization System (with E. Alviti, R.B. Kulkarni, E.G. Johnson, N. Clark, V. Walrafen). In Proceedings of the Third International Conference on Managing Pavements, Volume 2, pp. 190-194 (1994).

Quadratic and Conic Approximating Models in Linear Programming, MPS-COAL Bulletin, No. 23 (1994).

The Newton and Cauchy Perspectives on Computational Nonlinear Optimization, SIAM Review, 36, pp. 215-225 (1994).

A Primal Null-Space Affine Scaling Method (with K. Kim), ACM Transactions on Mathematical Software, 20, pp. 373-392 (1994).

The Least Prior Deviation Quasi-Newton Update (with R.B. Mifflin), Mathematical Programming, 65, pp. 247-261 (1994).

From Dikin to Karmarkar via Scalings, Models and Trust Regions, SIAG/OPT Views-and-News, 2, pp. 6-9 (1993).

The Homotopy Principle and Algorithms for Linear Programming, SIAM Journal on Optimization, 1, pp. 316-332 (1991).

The Decomposition Principle and Algorithms for Linear Programming (with K. Kim), Journal of Linear Algebra and its Applications, 152, pp. 119-133 (1991).

Some Comments on Notation for Quasi-Newton Methods (with W.C. Davidon and R.B. Mifflin), Optima (Mathematical Programming Society Newletter), No. 32, pp. 3-4 (1991).

Some Parallels in the Historical Development of the Simplex and Interior Point Algorithms for Linear Programming, WSU Mathematics Notes, Vol. 33, No. (1990).

Pricing Criteria in Linear Programming. In N. Megiddo (Ed.) Progress in Mathematical Programming: Interior Point and Related Methods (Asilomar, CA.), Springer-Verlag, pp. 105-129 (1989).

Combining Generalized Programming and Sampling Techniques for Stochastic Programs with Recourse (with A. Gaivoronski). In G.B. Dantzig and P. Glynn (Eds.) Proceedings of Workshop on Resource Planning Under Uncertainty for Electric Power Systems, Stanford University, CA (1989).

Updating the Triangular Factorization of a Matrix, SIAM Journal on Matrix Analysis and Applications, 10, pp. 424-428 (1989).

On Accelerating Newton's Method based on a Conic Model (with K. Ariyawansa), Information Processing Letters, 30, pp. 277-281 (1989).

Nonlinear Programming Techniques in Stochastic Programming (with R.J-B. Wets). In Y. Ermoliev and R.J-B. Wets (Eds.) Numerical Techniques for Stochastic Optimization Problems, Springer-Verlag: Berlin, Heidelberg, pp. 95-122 (1988).

Design and Implementation of a Stochastic Programming Optimizer with Recourse and Tenders. In Y. Ermoliev and R.J-B. Wets (Eds.) Numerical Techniques for Stochastic Optimization Problems, Springer-Verlag: Berlin, Heidelberg, pp. 273-294 (1988).

Algorithms Based Upon Generalized Linear Programming for Stochastic Programs with Recourse. In F. Archetti, G. DiPillo and M. Lucertini (Eds.) Stochastic Programming, Lecture Notes on Control and Information Science, 76, Springer-Verlag, Berlin, pp. 210-234 (1986).

An Algorithm Based Upon Successive Affine Reduction and Newton's Method. In R.Glowinski and J-L. Lions (Eds.) Proceedings of the Seventh INRIA International Conference on Computing Methods in Applied Science and Engineering,( Versailles, France), North-Holland, pp. 641-646 (1986).

Analogues of Dixon's and Powell's Theorems for Unconstrained Minimization with Inexact Line Searches, SIAM Journal on Numerical Analysis, 23, pp. 170-177 (1986).

Algorithms for Stochastic Programs: The Case of Non-Stochastic Tenders (with R.J-B. Wets), Mathematical Programming Study, 28, pp. 1-28 (1986).

Linear Programming Formulations of Markov Decision Processes (with R.B. Kulkarni), Operations Research Letters, 5, pp. 13-16 (1986).

The Method of Successive Affine Reduction for Nonlinear Minimization, Mathematical Programming, 35, pp. 97-109 (1986).

Conjugate Gradient Methods Less Dependent on Conjugacy, SIAM Review, 28, pp. 501-511 (1986).

Homotopy Techniques in Linear Programming, Algorithmica, 1, pp. 529-535 (1986).

Implementation Aids for Optimization Algorithms that Solve Sequences of Linear Programs, ACM Transactions on Mathematical Software, 12, pp. 307-323 (1986).

An Efficient Algorithm for Minimizing a Multivariate Polyhedral Function along a Line, Mathematical Programming Study, 24, pp. 116-125 (1985).

Hierarchical Implementation of Optimization Methods. In P. Boggs, R.Byrd and R. Schnabel (Eds.) Numerical Optimization, 1984, SIAM, Philadelphia, pp. 199-210 (1985).

Numerical Behaviour of Decomposition Algorithms for Linear Programs, Journal of Linear Algebra and its Applications, 57, pp. 181-189 (1984).

An Alternative Variational Principle for Variable Metric Updating, Mathematical Programming, 30, pp. 99-104 (1984).

Some Algorithmic Approaches for Solving Two-Stage Stochastic Programs. In A.B. Kurzhanskii (Ed.) Summary Proceedings for the Workshop on Adaptation and Optimization, Moscow, USSR, November, 1982, IIASA Collaborative Paper CP-83-65, pp. 43-45 (1983).

Development of a Pavement Management System for the Arizona Department of Transportation (with R.B. Kulkarni, E. Alviti, F. Finn, K. Golabi). In Proceedings of the Fifth International Conference on the Structural Design of Pavements, Delft University of Technology, Netherlands, 1, pp. 575-585 (1982).

Conjugate Direction Methods with Variable Storage (with J. Nocedal), Mathematical Programming, 23, pp. 326-340 (1982).

Some Recent Approaches to Solving Large Residual Non-Linear Least Squares Problems, SIAM Review, 22, pp. 1-11 (1980).

A Land Management Model using Dantzig-Wolfe Decomposition, Journal of the Institute of Management Sciences, 26, pp. 510-523 (1980).

A Conjugate Direction Algorithm for Unconstrained Minimization without Line Searches, Journal of Optimization Theory and its Applications. 23, pp. 373-387 (1979).

A Relationship between the BFGS and Conjugate Gradient Algorithms and its Implications for New Algorithms, SIAM Journal on Numerical Analysis, 16, pp. 794-800 (1979).

The Evaluation of Unconstrained Optimization Routines (with F. Schlick). In W.B. White (Ed.) Computers and Mathematical Programming, NBS Special Publication 502, National Bureau of Standards, Washington, D.C. pp. 117-133 (1978).

Unified Approach to Unconstrained Minimization via Basic Matrix Factorizations, Journal of Linear Algebra and its Applications, 17, pp. 197-232 (1977).

A Family of Variable Metric Updates, Mathematical Programming, 12, pp. 157-172 (1977).

Generation of Conjugate Directions for Unconstrained Minimization without Derivatives, Mathematics of Computation, 30, pp. 115-131 (1976).

Progress in the Development of a Modularized Package of Algorithms for Optimization Problems (with K. Brown, M. Minkoff, K. Hillstrom, J. Pool and B.T. Smith). In L.C.W. Dixon (Ed.) Optimization In Action, Academic Press, New York, pp. 185-211 (1976).

On the Convergence of the Cyclic Jacobi Method, Journal of Linear Algebra and its Applications, 12, pp. 151-164 (1975).

Classified Treatment for the Application of the Quantimet to Stereological Problems (with C. Fischer), The Microscope, 16, pp. 95-104 (1968).

Self-Complementary Variable Metric Algorithms (with M. Zhu). Technical Report 95-2, Department of Mathematics, WSU, Pullman (1995). (Revised: 1997).

Successive Affine Reduction and a Modified Newton's Method (with L. Stephenson), Technical Report 95-1, Department of Mathematics, WSU, Pullman (1995).

A Reformulation of the Central Path Equations and its Algorithmic Implications, Technical Report 94-1, Department of Mathematics, WSU, Pullman (1994).

Enhancement of the Network Optimization System (with E. Alviti and R.B. Kulkarni), Final Report, Woodward-Clyde Consultants, Oakland, California, USA (1992).

Development and Implementation of a Cast-Iron Maintenance Optimization System (with R.B. Kulkarni, F. Reid, R. Waespi, E. Alviti, G Rao), Final Report, Vol. 1, Woodward-Clyde Consultants, Oakland, California, USA (1990).

A Standard Input Format for Computer Codes which Solve Stochastic Programs with Recourse and a Library of Utilities to Simplify its Use (with J. Edwards, J. Birge, A. King), Working Paper WP-85-03, International Institute for Applied Systems Analysis, Laxenburg, Austria (1985).

Development of a Network Optimization System (with R.B. Kulkarni, E. Alviti, F. Finn, K. Golabi), Final Report, Vols. 1 and 2, Woodward-Clyde Consultants, San Francisco, California, USA (1980).

A Study of Conjugate Gradient Methods (with J. Nocedal), Systems Optimization Laboratory, Department of Operations Research, Stanford University, Technical Report SOL 78-29, California, USA (1978).

Software for Optimization, Systems Optimization Laboratory, Department of Operations Research, Stanford University, Technical Report SOL 78-32, California, USA (1978).

Dually Equivalent Decomposition Algorithms with Applications to Solving Staircase Systems, Systems Optimization Laboratory, Department of Operations Research, Stanford University, Technical Report SOL 78-30, California, USA (1978).

Error Propagation and Solution Reconstruction in Nested Decomposition, Systems Optimization Laboratory, Department of Operations Research, Stanford University, Technical Report SOL 78-27, California, USA (1978).

Minkit - An Optimization System, Argonne National Laboratory (ANL-AMD) Technical Memo. No. 308, Illinois, USA (1977).

DRVOCR - A Fortran Implementation of Davidon's Optimally Conditioned Method (with W.C. Davidon), Argonne National Laboratory (ANL-AMD) Technical Memo. No. 306, Illinois, USA (1977).

OCOPTR - A Derivative-Free Fortran Implementation of Davidon's Optimally Conditioned Method (with W.C. Davidon), Argonne National Laboratory (ANL-AMD) Technical Memo. No. 303, Illinois, USA (1977).

On Davidon's Optimally Conditioned Algorithm for Unconstrained Optimization, Argonne National Laboratory (ANL-AMD) Technical Memo. No. 283, Illinois, USA (1976).

A Hybrid Least-Squares Method, Argonne National Laboratory (ANL-AMD) Technical Memo. No. 254, Illinois, USA (1973) (revised version: IIASA Working Paper WP-83-99, 1983).

Timber RAM User's Manual: Mathematical Programmer's Guide, Multiple Use Economics Project. Pacific Southwest Forest and Range Experiment Station, Berkeley, California, USA (1971).

Re-Ranking National Universities: A Simple Exercise in Descriptive Analytics, August, 2015. Review of

Review of

Review of

File translated from T

On 30 Jan 2004, 16:11.