Recent Talks (Revised January2011)

-->|Front Page | Recent Papers | Publications |

10-9 M. Kojima, "Enclosing Ellipsoids and Elliptic Cylinders of Semialgebraic Sets and Their Application to Error Bound in Polynomial Optimization " National Cheng-Kung University, Tainan, Taiwan, November 26, 2010, slides.pdf.

10-8 M. Kojima, " Exploiting Structured Sparsity in Large Scale Semidefinite Programming Problems, " National Cheng-Kung University, Tainan, Taiwan, November 26, 2010, slides.pdf.

10-7 M. Kojima, "SOS and SDP Relaxation of Polynomial Optomization Problems, " National Cheng-Kung University, Tainan, Taiwan, November 22, 2010, slides.pdf.

10-6 M. Kojima, "Introduction to Semidefinite Programming, " National Cheng-Kung University, Tainan, Taiwan, November 24, 2010, slides.pdf.

10-5 M. Kojima, " Exploiting Structured Sparsity in Linear and Nonlinear Semidefinite Programs, " University of California, San Diego, October 21, 2010, slides.pdf.

10-4 M. Kojima, "Enclosing Ellipsoids and Elliptic Cylinders of Semialgebraic Sets and Their Application to Error Bound in Polynomial Optimization " Modern Trends in Optimization and Its Application, Workshop II: Numerical Methods for Continuous Optimization, IPAM, UCLA, Los Angeles, October 2010, slides.pdf.

10-3 M. Kojima, "Exploiting Structured Sparsity in Large Scale Semidefinite Programming Problems, " International Congress of Mathematical Software 2010, Kobe, September 13 - 17, 2010, slides.pdf.

10-2 M. Kojima, "Enclosing Ellipsoids and Elliptic Cylinders of Semialgebraic Sets and Their Application to Error Bounds in Polynomial Optimization," The University of Tsukuba, Tsukuba, July 31 - August 1, slides.pdf.

09-3 M. Kojima, "Global Optimization Using Semidefinite Programming Relaxation ", Nonlinear Analysis and Convex Analysis, Tokyo Institute of Technology, Tokyo, March 27-31, 2009, slides.pdf.

08-7 M. Kojima, "Exploiting Sparsity in Matrix Inequality and Its Application to Polynomial SDP, " Workshop of Computational Polynomial Optimization and Multilinear Algebra, The Hong Kong Polytechnic University, December 22-23, 2008, slides.pdf.

08-6 M. Kojima, "Conversion Methods for Large Scale SDPs and Their Applications to Polynomial Optimization Problems , " Workshop: Advances in Mathematical Modeling and Computational Algorithms in Information Processing , The Institute of Statistical Mathematics, Tokyo November 1, 2008, slides.pdf.

08-4 M. Kojima, "Conversion Methods for Large Scale SDPs to Exploit Their Structured Sparsity," The 4th Sino-Japanese Optimization Meeting, Tainan, Taiwan, August 27, 2008, slides.pdf.

08-3 M. Kojima, "A Numerical Algorithm for Block-Diagonal Decomposition of Matrix *-Algebra, " HPOPT 2008, Tilburg Unversity, The Netherlands, June 11-13, 2008, slides.pdf.

08-2 M. Kojima, "Conversion Methods for Large Scale SDPs to Exploit Their Structured Sparsity, " The MIT Computation for Design and Optimization Program Distinguished Speaker Series, Massachusetts Institute of Technology, May 14, 2008, slides.pdf.

08-1 M. Kojima, S. Kim and H. Waki, " Elimination of Free Variables for Solving Linear Optimization Problems Efficiently, " SIAM Conference on Optimization, Boston, May 10 - 13, 2008, slides.pdf.

07-6 M. Kojima," Exploiting Sparsity in Polynomial Optimization Problems, " Nonconvex Programming: Local and Global Approaches, Theory, Algorithms and Applications, National Institute for Applied Sciences, Rouen, France, 17-21 December 2007, slides.pdf.

07-4 M. Kojima,"Polyhedral Homotopy Methods vs Semidefinite Programming Relaxations for Problems Involving Polynomials," Workshop on Advances in Optimization, Tokyo Institute of Technology, Tokyo, 19-21 April 2007, slides.pdf.

07-2 M. Kojima,"Polyhedral Homotopy Methods vs Semidefinite Programming Relaxations for Problems Involving Polynomials," Spring 2007 Workshop: Geometry of Mechanism Science, University of Notre Dame, March 1-4, 2007. Invited talk, slides.pdf.

07-1 M. Kojima,"Sparsity in Polynomial Optimization," Workshop: Optimization and Control, Institute for Mathematics and Its Applications, Minneapolis, January 16-20, 2007. Invited talk, slides.ppt, slides.pdf.

06-5 M. Kojima,"Parallel Implementation of the Polyhedral Homotopy Method for Polynomial Systems," Workshop: Software for Algebraic Geometry, Institute for Mathematics and Its Applications, Minneapolis, October 23-27, 2006. Invited talk, slides.ppt, slides.pdf.

06-4 M. Kojima,"Sparsity in Sum of Squares and SemiDefinite Programming Relaxation of Polynomial Optimization Problems," Workshop on Polyhedral Computation, Montreal, October 17-21, 2006. Invited talk, slides.ppt, slides.pdf.

06-3 M. Kojima,"Sum of Squares and SemiDefinite Programming Relaxation of Polynomial Optimization Problems," The 2006 IEICE Society Conference, Kanazawa, September 21, 2006. Invited talk, slides.ppt, slides.pdf.

06-2 M. Kojima and M. Muramatsu,"An Extension of Sum of Squares Relaxation to Polynomial Optimization Problems over Symmetric Cones," Semidefinite Programming and Its Applications, Singapore, January 9-13, 2006. Invited talk, slides.pdf.

06-1 M. Kojima,"Introduction to semidefinite programs," Semidefinite Programming and Its Applications, Singapore, January 9-13, 2006. Tutorial lectures, slides.pdf.

05-6 M. Kojima,"Exploiting Sparsity of SDPs (Semidefinite Programs) and Their Applications to POPs (Polynomial Optimization Problems)," The 3rd Sino-Japanese Optimiztion Meeing, Singapore, October 31 - November 2, 2005. Invited talk, OHP.pdf.

05-5 M. Kojima,"Sums of Squrares Relaxations of Polynomial Optimiztion Problems," Asiam Mathematical Conference, Singapore, July 20 - 24, 2005. Invited talk, OHP.pdf.

05-4 M. Kojima, S. Kim, M. Muramatsu and H. Waki, "Exploiting Sparsity in SOS and SDP Relaxations of Polynomial Optimiztion Problems," FoCM2005 Optimiztion Workshop, Santander, Spain, July 4 - 6, 2005. Invited talk, OHP.pdf.

05-3 Masakazu Kojima, "Parallel Computing for Semidefinite Programming," 2005 SIAM Conference on Optimization, Stockholm, Sweden, May 14-19, 2005. Invited talk, OHP.pdf.

05-2 Masakazu Kojima, "Sums of Squares Relaxation of Polynomial Optimization Problems, " Dynamical System and Numerical Analysis in Honor of Tien-Yien Li's 60th Birthday, Hsinchu Taiwan, May 10-12, 2005. Invited talk, OHP.pdf.

05-1 Hayato Waki, Sunyoung Kim, Masakazu Kojima and Masakazu Muramatsu, "Sums of Squares and Semidefinite Programming Relaxations for Polynomial Optimization Problems with Structured Sparsity, " International Symposium on The Art of Statistical Metaware, March 14 - 16, 2005, The Institute of Statistical Mathematics, Tokyo, Japan. Invited talk, OHP.pdf.

03-5 Masakazu Kojima, "Semidefifnite programming relaxation and Lagranginan relaxation for polynomial optimization problems, " The Third International Conference on Nonlinear Analysis and Convex Analysis, August 25 - 29, 2003, Tokyo Institute of Technology, Tokyo, Japan. Invited talk, OHP.pdf.

03-4 Masakazu Kojima, Sunyoung Kim and Hayato Waki, "Exploiting Sparsity in Sums of Squares of Polynomials, " 18th International Symposium on Mathematical Programming, August 18 - 22, 2003, Copenhagen, Denmark, OHP.pdf.

03-3 Masakazu Kojima, Kazuhide Nakata, Katsuki Fujisawa and Makoto Yamashita, "Parallel implementation of primal-dual interior-point methods for semidefinite programs, " 3rd McMaster Optimization Conference: Theory and Applications (MOPTA 03), July 30 - August 1, 2003, McMaster University, Hamilton, Ontario, Canada. Invited Talk, OHP.pdf.

03-1 Masakazu Kojima, Sunyoung Kim and Hayato Waki, " A general framework for convex relaxation of polynomial optimization problems over cones, " IMA Workshop: Semidefinite Programming and Robust Optimization, Mar. 12-19, 2003, Minneapolis. Invited Talk, OHP.pdf.

02-6 Masakazu Kojima, Sunyoung Kim and Hayato Waki, " A general framework for convex relaxation of polynomial optimization problems over cones, " The Second Japanese-Sino Optimization Meeting (JSOM 2002), Sep. 25-27, 2002, Kyoto, Japan. Invited Plenary Talk.

02-5 Masakazu Kojima, " A general framework for convex relaxation of polynomial optimization problems over cones, " The Second International Conference on Optimization and Control with Applications, August 18-22, 2002, Yellow Mountain International Hotel, Tunxi City AnHui Province, China. Invited Talk.

02-4 Masakazu Kojima, , Y. Dai, K. Fujisawa, S. Kim and A. Takeda ``Parallel implementation of polyhedral continuation methods for systems of polynomial equations,'' International Congress of Mathematical Software, August 17-19, 2002, Beijing, China. Invited talk, OHP.pdf

02-2 Masakazu Kojima and Sunyoung Kim, ``SDP and SOCP relaxations of a Class of Quadratic Optimization Problems,'' McMaster Optimization Workshop, Canada, May 23-24, 2002, McMaster University in Hamilton, Ontario. Invited talk. OHP.ps , OHP.pdf

02-1 Masakazu Kojima, Mituhiro Fukuda and Masayuki Shida, ``Dual and Lagrangian Dual Predictor-Corrector Interior-Point Methods for Semidefinite Programs,'' SIAM Conference on Optimization, May 20-22, 2002, Westin Harbour Castle Hotel, Toronto, Canada. Invited talk. OHP.ps , OHP.pdf

01-3 Masakazu Kojima, Mituhiro Fukuda and Masayuki Shida, ``Lagrangian dual interior-point methods for semidefinite programs, '' New Trends in Optimization and Computational Algorithms, December 9-13, 2001, Kyoto, Japan. Invited talk. OHP.ps , OHP.pdf

01-2 Masakazu Kojima, Yang Dai, Sunyoung Kim and Akiko Takeda, ``A polyhedral homotopy continuation method for computing all solutions of a polynomial system of equations in complex vatiables,'' Interaternational Conference on Recent Advances in Computational Mathematics, October 10-13, 2001, Matsuyama, Ehime, Japan. Invited talk. OHP.ps , OHP.pdf

00-5 Masakazu Kojima, Akiko Takeda and Katsuki Fujisawa, ``A combinatorial Problem arising from polyhedral homotopies for polynomial systems, '' First Sino-Japan Optimization Meeting, October 26-28, 2000, Hong Kong. Invited talk.

00-3 Masakazu Kojima, Mituhiro Fukuda, Kazuo Murota and Kazuhide Nakata, ``Interior-point methods for semidefinite programs using matrix completion,'' European Conference on Operations Research, July 16-19, 2000, Budapest, Hungary.

00-2 Masakazu Kojima, ``Successive convex relaxation methods for nonconvex optimization problems,'' 2nd Workshop on Interior Point Method, July 14-15, 2000, Budapest, Hungary. Invited talk.

99-7 Masakazu Kojima, ``Global oprimization of general nonlinear programs via successive convex relaxation,'' INFORMS FALL'99, November 7-10, 1999, Philadelphia.

99-6 Masakazu Kojima, ``Global oprimization via successive convex relaxation,'' Work Shop on Polyhedral and Semidefinite Programming Methods, November 1-6, 1999, The Fields Institute of Mathematical Sciences, Toronto, Canada. Invited Talk.

99-5 Masakazu Kojima, Akiko Takeda and Levent Tuncel, ``Global optimization, successive convex relaxation methods and their computational complexity,'' Foundations of Computational Mathematics 1999, July 18-28, 1999, The University of Oxford, England. Invited talk.

99-4 Masakazu Kojima and Akiko Takeda, ``Successive convex relaxation approach to bilevel quadratic optimization problems,'' The Intrnational Conference on Complementarity 99, June 9-12, 1999, Madison, Wisconsin. Invited talk.

99-3 Masakazu Kojima and Levent Tuncel, ``Discretization and localization in successive convex relaxation methods for nonconvex quadratic optimization problems, '' Sixth SIAM Conference on Optimization, May 12-15, 1999, Atlanta, Georgia.

99-2 Masakazu Kojima and Levent Tuncel, ``Discretization and localization in successive convex relaxation methods for nonconvex quadratic optimization problems,'' DIMACS Workshop on Semidefinite Programming and its Applications to Large Scale Discrete Optimization, January 7 - 9, 1999, Princeton University, Princeton. Invited talk.

98-4 Masakazu Kojima and Levent Tuncel, ``Cones of matrices and successive convex relaxations of nonconvex sets,'' International Conference on Nonlinear Programming and Variational Inequalities, December 15-18, 1998, Hong Kong. Invited talk.

98-3 Masakazu Kojima and Levent Tuncel, ``Cones of matrices and successive convex relaxations of nonconvex sets,'' Workshop Semidefinite Programming: Applications and Algorithms, November 15-17, 1998, ZIB-Berlin, Berlin. Invited talk.

98-1 Masakazu Kojima, Masayuki Shida and Susumu Shindoh, ``Search directions in semidefinite programming and monotone semidefinite linear complementarity problem: generalization and inexct computation,'' CORS/INFORMS Montral, April 26-29, 1998, Motreal, Canad.

97-4 Masakazu Kojima, ``Numerical experiments of the SDPA,'' Fifth International Conference on Parametric Optimization and Related Topics, October 6-10, 1997, OVTA, Makuhari, Chiba.

97-3 Masakazu Kojima, Katsuki Fujisawa and Kazuhide Nakata, ``Exploiting sparcity in primal-dual interior-point methods for semidefinite programming,'' International Symposium on Mathematical Programming 1997, August 1997, Lausanne EPFL. Invited prenary talk.

97-2 Masakzu Kojima, Masayuki Shida and Susumu Shindoh, ``Search directions in semidefinite programming and monotone semidefinite linear complementarity problem: generalization and inexct computation,'' The International Workshop on Hight Perfomance Optimiztion Tehniques, August 1997, Rotterdam. Invited talk.

96-2 Masakazu Kojima, Masayuki Shida and Susumu Shindoh, ``Two families of primal-dual interior-point methods for semidefinite programming,'' Hayama Workshop on Optimization, August 1996. Invited talk.

96-1 Masakazu Kojima, Masayuki Shida and Susumu Shindoh, ``Global and local convergence of prodeictor-corrector infeasible-interior-point algorithms for semidefinite programs,'' Fifth SIAM Conference on Optimization, May 20-22, 1996, Victoria, British Columbia, Canada. Invited talk.

 

 

-->|Front Page | Recent Papers | Publications |