Home
Books
Sol. Manuals
Books: ed
Papers
Reports
Reviews
Books: trans
Papers: trans
Stephen Nash: Papers

1977-1980

  • John C. Nash and Stephen G. Nash, “Conjugate-gradient Methods for Solving Algebraic Eigenproblems,” In Minicomputers and Large Scale Computations, P. Lykos (editor), ACS Symposium Series, Washington (1977), pp. 24-32.
  • Germund Dahlquist, Gene H. Golub, and Stephen G. Nash, “Bounds for the Error in Linear Systems,'” In Proceedings of the Workshop on Semi-infinite Programming, Bad Honnef, West Germany (1978).
  • Gene H. Golub, Stephen G. Nash, and C. Van Loan, “A Hessenberg-Schur Method for the Problem AX + XB = C,” IEEE Transactions on Automatic Control, AC-24 (1979), pp. 909-912.

1981-1985

  • Gene H. Golub and Stephen G. Nash, “Nonorthogonal Analysis of Variance using a Generalized Conjugate-gradient Algorithm,” Journal of the American Statistical Association, 77 (1982), pp. 109-116.
  • V.K. Klonias and Stephen G. Nash, “On the Computation of a Class of Maximum Penalized Likelihood Estimators of the Probability Density Function,” in Computer Science and Statistics: Proceedings of the 15th Symposium on the Interface, J.E. Gentle (editor), North Holland, New York (1983), pp. 310-314.
  • Stephen G. Nash, “Newton-type Minimization via the Lanczos Algorithm,” SIAM J. Numerical Analysis, 21 (1984), pp. 770-788.
  • Stephen G. Nash, “Truncated-Newton Methods for Large-scale Function Minimization,” in Applications of Nonlinear Programming to Optimization and Control, H.E. Rauch (editor), Pergamon Press, Oxford (1984), pp. 91-100.
  • Stephen G. Nash, “Preconditioning of Truncated-Newton Methods,” SIAM J. Scientific and Statistical Computing, 6 (1985), pp. 599-616.

1986-1990

  • Stephen G. Nash, “Quasi-random Sampling,” in the Encyclopedia of Statistical Sciences, Vol. 7, John Wiley and Sons, New York (1986), p. 468.
  • Stephen G. Nash, “Quasi-random Sequences,” in the Encyclopedia of Statistical Sciences, Vol. 7, John Wiley and Sons, New York (1986), pp. 468-469.
  • Stephen G. Nash, “Solving Nonlinear Programming Problems using Truncated-Newton Techniques,” in Numerical Optimization 1984, P. Boggs, et al. (editors), SIAM, Philadelphia (1985), pp. 119-136.
  • Ralph Byers and Stephen G. Nash, “On the Singular `Vectors' of the Lyapunov Operator,” SIAM J. Algebraic and Discrete Methods, 8 (1987), pp. 59-66.
  • V.K. Klonias and Stephen G. Nash, “Numerical Techniques in Nonparametric Estimation,” J. Statist. Comput. Simul., 28 (1987), pp. 97-126.
  • Stephen G. Nash, “Avoiding Modified Matrix Factorizations in Newton-like Methods,” J. Inf. Opt. Sci., 9 (1988), pp. 159-182.
  • John C. Nash and Stephen G. Nash, “Compact Algorithms for Function Minimization,” Asia-Pacific J. of Operations Research, 5 (1988), pp. 173-192.
  • Ralph Byers and Stephen G. Nash, “Approaches to Robust Pole Assignment,” International Journal of Control, 49 (1989), pp. 97-117.
  • Stephen G. Nash and Ariela Sofer, “Parallel Optimization via the Block Lanczos Method,” in Computer Science and Statistics, E.J. Wegman, D.T. Gantz, and J.J. Miller (editors), ASA (Alexandria, VA), pp. 209-213 (1988).
  • Bert W. Rust, Stephen G. Nash, and Barry J. Geldzahler, “The Proper Motion vs. Redshift Relation for Superluminal Radio Sources,” Astrophysics and Space Science, 152 (1989), pp. 141-170.
  • Stephen G. Nash and Ariela Sofer, “Block Truncated-Newton Methods for Parallel Optimization,” Mathematical Programming, 45 (1989), pp. 529-546.
  • Stephen G. Nash and Ariela Sofer, “Assessing a search direction within a truncated-Newton method,” Operations Research Letters, 9 (1990), pp. 219-221.
  • Stephen G. Nash and Ariela Sofer, “A parallel line search for a Newton-type method,” in Computer Science and Statistics: Proceedings of the 21st Symposium on the Interface, K. Berk and L. Malone (editors), ASA (Alexandria, VA),  pp. 134-137 (1990).

1991-1995

  • Richard H.F. Jackson, Paul T. Boggs, Stephen G. Nash and Susan Powell, “Guidelines for the Reporting of Computational Experiments,” Mathematical Programming, 49 (1991), pp. 413-426.
  • Stephen G. Nash and Jorge Nocedal, “A Numerical Study of the Limited Memory BFGS Method and the Truncated-Newton Method for Large Scale Optimization,” SIAM J. Optimization, 1 (1991), pp. 358-372.
  • Stephen G. Nash and Ariela Sofer, “A General-purpose Parallel Algorithm for Unconstrained Optimization,” SIAM Journal on Optimization, 1 (1991), pp. 530-547.
  • Stephen G. Nash and Ariela Sofer, “Algorithm 711: BTN: Software for Parallel Unconstrained Optimization,” ACM Transactions on Mathematical Software, 18 (1992), pp. 414-448.
  • Stephen G. Nash and Ariela Sofer, “A Barrier Method for Large-scale Constrained Optimization,” ORSA Journal on Computing, 5 (1993), pp. 40-53.
  • Stephen G. Nash, R. Polyak, and Ariela Sofer, “A Numerical Comparison of  Barrier and Modified-Barrier Methods for Large-Scale Bound-Constrained Optimization,” in Large Scale Optimization: State of the Art, W.W. Hager, D.W. Hearn, and P.M. Pardalos (editors), Kluwer Academic Publishers, Norwell MA (1994), pp. 319-338.

1996-present


Back to curriculum vitae

Links

(snash@gmu.edu)

[Home] [Books] [Sol. Manuals] [Books: ed] [Papers] [Reports] [Reviews] [Books: trans] [Papers: trans]