K. A. Ariyawansa

Optimization Algorithms $\bullet$ High Performance Computing
Operations Research $\bullet$ Statistical Inference

  1. On the complexity of the translational-cuts algorithm of Burke, Goldstein, Tseng and Ye for convex minimax problems, (with P.L. Jiang), J. Optimization Theory and Its Applications, 107 (2000), 223-243.

  2. Special Issue of Mathematical Programming, Series B, titled Studies in Algorithmic Optimization: Festschrift in Honor of William C. Davidon (with R.B. Mifflin and J.L. Nazareth) Editor, 87(2) (2000), 156 pp.

  3. A collection of multistage stochastic linear programming test problems (Version 1) (with A.J. Felt), Technical Report 00-3, Department of Pure and Applied Mathematics, Washington State University, Pullman, WA, 102 pp. (An abridged version of this is Item 10 which appeared in INFORMS Journal on Computing.)

  4. A characterization of convexity-preserving maps from a subset of a vector space into another vector space (with W.C. Davidon and K.D. McKennon), Journal of the London Mathematical Society, 64 (2001), 179-190.

  5. On a characterization of convexity-preserving maps, Davidon's collinear scalings and Karmarkar's projective transformations (with W.C. Davidon and K.D. McKennon), Mathematical Programming, Ser. A, 90 (2001), 153-168.

  6. Test set for stochastic linear programming (with A.J. Felt),
    http://www.uwsp.edu/math/afelt/slptestset.html, April 2001. (This is a software package.)

  7. SLPlib: Input routines and data structures for stochastic linear programming (with A.J. Felt), http://www/uwsp.edu/math/afelt/slpinput.html, June 2001. (This is a software package.)

  8. CPA: Cutting plane algorithms for two-stage stochastic programming (with A. J. Felt and J. J. Sarich), http://www-neos.mcs.anl.gov/neos/solvers/SLP:CPA/, November 2002. (This is a software package.)

  9. A note on line search termination criteria for collinear scaling algorithms (with W. L. Tabor), Computing, 70 (2003), 25-39.

  10. On a new collection of stochastic linear programming test problems (with A. J. Felt) INFORMS Journal on Computing, 16(3) (2004), 291-299. (This is an abridged version of Item 3.)

  11. A safeguarded linesearch algorithm based on conic interpolation (with N. Begashaw), Proceedings of the Tenth International Conference on Information System Analysis and Synthesis, Vol. III, (2004), 263-268.

  12. A family of stochastic programming test problems based on a model for tactical manpower planning (with C. Cacho and A. J. Felt), Journal of Mathematical Modeling and Algorithms, 4(4) (2005), 369-390.

  13. Stochastic semidefinite programming: a new paradigm for stochastic optimization (with Y. Zhu), 4OR--Quarterly Journal of Belgian, French and Italian Operations Research Societies, 4 (2006), 239-253.

  14. A class of collinear scaling algorithms for bound-constrained optimization: convergence theorems (with W. L. Tabor), Journal of Mathematical Analysis and Applications, 334 (2007), 716-737.

  15. A class of volumetric center decomposition algorithms for stochastic quadratic programming (with Y. Zhu), Applied Mathematics and Computation, 186 (2007) 1683-1693.

  16. A model for granular statics with impenetrability constraints (with L. Beryland and A. Panchenko), Networks and Heterogeneous Media, (accepted).



2007-06-05