Publications of Dr. Earl Branes

Publications of Professor Earl Barnes

  • Barnes, E. R., "Semidefinite Programming via the Simplex Algorithm"

    Submitted to Mathematics of Operations Research, March 1997.

  • Barnes, E. R., "Bounds for the Largest Clique in a Graph"

    Submitted to Mathemtical Programming, February 1997. To see a postcript version of the paper click here.

  • Castillo, I. and Barnes, E. R., "Chaotic Behavior of the Affine Scaling Algorithm"

    Submitted to SIAM Journal on Optimization, November 1996. To see a postcript version of the paper click here.

  • Barnes, E. R., and Moretli, A., "A Method for Finding the Analytic Center of a Polytope"

    Accepted by Computationaly and Applied Mathematics, July, 1996.

  • Barnes, E. R., "Commentary on the Hoffman-Wieland Inequality"

    Special isuue of the Journa of Linear Algebra dedicated to Helmut Wielandt on his 65th Birthday, June 1996.

  • Barnes, E. R., "An Inequality for Probability Moments with Applications"

    SIAM Journal of Matrix Analysis and Applications, V. 8, N. 3, August 1995, pp. 1-13.

  • Barnes, E. R., and Hoffman, A. J., "Bounds for the Spectrum of Normal Matrices,"

    Journal of Linear Algebra and Applications, V. 201, 1994, pp. 79-90.

  • Barnes, E. R., Hoffman, A. J., and Rothblum, U. G., "Optimal Partitions Having Disjoint Convex and Conic Hulls"

    Mathematical Programming, V. 54, 1992, pp. 69-86.

  • Barnes, E. R., "Minimum Containing Ellipsoids and Regular Polyhedra"

    COAL Newsletter, NO. 19, 1991, pp. 2-6.

  • Barnes, E. R., "Some Results Concerning Convergence of the Affine Scaling Algorithm"

    Proceedings of Syposium on Mathematical Developments Arising from Linear Programming, V. 114, 1991, pp. 131-139.

  • Barnes, E. R., "Circular Discs Containing Eigenvalues of Normal Matrices"

    Linear Algebra and Applications, V. 114/115, 1989, pp. 501-521.

  • Barnes, E. R. and Oklobdzija, V., "On Implementing Addition in VSLI Technology"

    IEEE Journal of Parallel Processing and Distributed Computing, 1989.

  • Barnes, E. R., Vannelli, A., and Walker, J. Q., "A New Heuristic for Partitioning the Nodes of a Graph "

    SIAM Journal on Algorithms and Discrete Methods, 1988.

  • Barnes, E. R., "A Variation on Karmarker's Algorithm for Solving Linear Programming Problems"

    Mathematical Programming, V. 36, 1986, pp. 174-182.

  • Barnes, E. R., "Partitioning the Nodes of a Graph "

    Graph Theory and Its Applications to Algorithms and Computer Science, 1985, pp. 57-71.

  • Barnes, E. R., and Hoffman, A. J., "On Transportation Problems with Upper Bounds on Leading Rectangles"

    SIAM Journal on Algebraic and Discrete Methods, V. 6, No.3, 1985, pp. 487.496.