Kartik's publications, preprints, and talks

These reports and talks can be downloaded in pdf form by clicking on the appropriate highlighted link.

If interested, feel free to take a look at my

  • Resume pdf format
  • Ph.D. thesis ps format pdf format
  • My Erdos number is 4. Here is the path

    Kartik Krishnan -- Tamas Terlaky -- Komei Fukuda -- David Avis -- Paul Erdos

    That's MUCH better than Six degrees of Separation, isn't it? Which in turn proves I am WELL above average :-)

    Check out my preprints at

  • Optimization Online
  • Bibliography on Semidefinite Programming (search for K. Krishnan or K. Sivaramakrishnan): Maintained by Henry Wolkowicz
  • Bibliography on Interior Point Optimization (search for K. Krishnan): Maintained by John Mitchell
  • My MathSciNet references
  • The papers and talks appear roughly in reverse chronological order below.


    parallel-dual-polyopt.pdf
    Kartik Sivaramakrishnan, "A parallel dual decomposition algorithm for polynomial optimization problems with structured sparsity", Technical Report, Department of Mathematics, North Carolina State University, Raleigh, NC 27695 (will be up shortly; send me email for a copy).

    Preliminary details can be found in my recent talk at the INFORMS 2008 Optimization Conference, Atlanta, 15th March 2008.


    properties_revised.pdf (revised September 2007)
    Kartik Sivaramakrishnan and John Mitchell, "Properties of a cutting plane method for semidefinite programming", Technical Report, Department of Mathematics, North Carolina State University, Raleigh, NC 27695, September 2007 (substantially revised version of the earlier report from May 2003), submitted for publication.


    parallel-conic-blockangular.pdf (revised April 2008)
    Journal Link
    Kartik Sivaramakrishnan, "A PARALLEL interior point decomposition algorithm for BLOCK-ANGULAR semidefinite programs", Technical Report, Department of Mathematics, North Carolina State University, Raleigh, NC, 27695, April 2008 (revised version of the earlier report from August 2007); accepted for publication and to appear in Computational Optimization and Applications.

    My recent talk in the IE seminar, Department of Industrial Engineering and Management Sciences, Northwestern University, Evanston, 6th May 2008.

    My recent talk at the INFORMS 2008 Optimization Conference, Atlanta, 15th March 2008.

    One can exploit the underlying sparsity and symmetry in a semidefinite program to preprocess it into an equivalent block-angular semidefinite program. I survey some of these techniques in my talk in the Symbolic Computation seminar at NC State, 29th November 2006.


    snc_sdp.pdf
    Proceedings Link
    Erich Kaltofen, Bin Li, Kartik Sivaramakrishnan, Zhengfeng Yang, and Lihong Zhi, "Lower bounds for approximate factorizations via semidefinite programming (extended abstract)", Proceedings of Symbolic-Numeric Computation 07, University of Western Ontario, 25-27 July 2007, pp. 203-204.


    kartik-algebra.pdf
    Kartik Sivaramakrishnan, "Solving polynomial optimization problems using real-algebraic geometry, moments, and semidefinite programming", Talk in the Algebra seminar, Department of Mathematics, North Carolina State University, 23rd March 2007.

    An earlier talk that I gave in the Symbolic Computation seminar, Department of Mathematics, North Carolina State University, 18th January 2006.


    conic-ipm-decomposition.pdf
    Kartik Sivaramakrishnan, Gema Plaza Martinez, and Tamas Terlaky, "A conic interior point decomposition approach for large scale semidefinite programming", Technical report, Department of Mathematics, North Carolina State University, Raleigh, NC, 27695, December 2005; submitted for publication.

    My talk at ISMP 2006, Rio de Janeiro, Brazil, July 2006.
    My slides from a recent talk in the Operations Research colloquia, University of North Carolina at Chapel Hill, April 2006.


    informs-denver.pdf
    Kartik Krishnan, Gabor Pataki, Neha Gupta, and Tamas Terlaky, "Towards a practical simplex method for second order cone programming",
    My slides from a talk in the INFORMS Annual Meeting, Denver, October, 2004.
    An earlier talk was given by me in the 1st International Conference on Continuous Optimization (ICCOPT I), Rensselaer Polytechnic Institute, August 2004.
    The simplex algorithm presented in my INFORMS talk is slightly different from the one presented here.
    Please send me email for the preprint. The complete paper will be posted here very soon.


    krishnan-terlaky-final.pdf
    Book Chapter Link
    Kartik Krishnan and Tamas Terlaky, "Interior Point and semidefinite approaches in Combinatorial Optimization", GERAD 25th anniversary volume on Graph Theory and Combinatorial Optimization, edited by D. Avis, A. Hertz, and O. Marcotte, Springer, 2005, pages 101-157.


    rpi-colloquium.pdf
    Kartik Krishnan, Gabor Pataki, and Yin Zhang, "Towards a practical simplex method for semidefinite programming", Talk in the Math Colloquium, Dept. of Mathematical Sciences, Rensselaer Polytechnic Institute, April 2004.


    coap-final.pdf
    Journal Link
    Kartik Krishnan and John Mitchell, "A semidefinite programming based polyhedral cut and price approach for the maxcut problem", Computational Optimization and Applications, 33(1), January 2006, pages 51-71.


    oms-final.pdf
    Journal Link
    Kartik Krishnan and John Mitchell, "A unifying framework for several cutting plane methods for semidefinite programming", Optimization Methods and Software, 21(1), February 2006, pages 57-74.


    rpithes.pdf
    Kartik Krishnan Sivaramakrishnan, "Linear Programming approaches to semidefinite programming problems", Ph.D. thesis, Dept. of Mathematical Sciences, Rensselaer Polytechnic Institute, June 2002.

    Advisor : John Mitchell

    The thesis supersedes most of the material in the papers, preprints and talks mentioned below. Comments and suggestions welcome.


    sdpvialp.pdf
    Book Chapter Link
    Kartik Krishnan and John Mitchell,"Semi-infinite linear programming approaches to semidefinite programming (SDP) problems", Novel Approaches to Hard Discrete Optimization, edited by P.M. Pardalos and H. Wolkowicz, Fields Institute Communications Series, American Math. Society, 2003, pages 123-142.


    cutsdpbundle.pdf
    Kartik Krishnan and John Mitchell, "A linear programming approach to semidefinite programming problems", working paper, Dept. of Mathematical Sciences, RPI, Troy, USA, April 2001 (minor corrections October 2001).


    kartik_iisc.pdf
    Kartik Krishnan, "Graph Algorithms for Loss Minimisation through Feeder Reconfiguration", Masters Thesis, Department of Electrical Engineering, Indian Institute of Science, Bangalore, India, June 1998.
    Abstract of the thesis


    I beg to introduce myself to you as a clerk in the Accounts Department of the Port Trust Office at Madras on a salary of only \pounds 20 per annum. I am now about 25 years of age. I have no University education but I have undergone the ordinary school course. After leaving school I have been employing the spare time at my disposal to work at Mathematics ... I am striking out a new path for myself. I have made a special investigation of divergent series in general and the results I get termed by the local mathematicians as "startling"...

    --- Srinivasa Ramanujan (The man who knew infinity)


    Last Updated: 11th-June-2008

        Webmaster : Kartik Krishnan
    © Copyright 2008