SDPT3 -- A Matlab Software Package for Semidefinite Programming

This invention relates to stabilizing compositions; to the process for preparing a novel halogen-containing polymer; and to polymers stabilized against the deteriorative effect of heat which comprises a vinyl chloride or vinylidene chloride homopolymer or copolymer and a stabilizing amount of: as a first stabilizer an organotin halide exhibiting the formula RSnX3 wherein R is a hydrocarbon and X is halogen and as a second stabilizer a sulfur-containing organotin compound exhibiting two direct carbon to tin bonds and two direct sulfur to tin bonds.

[1]  J. O. Aasen.  On the reduction of a symmetric matrix to tridiagonal form , 1971 .

[2]  Sanjay Mehrotra,et al.  On the Implementation of a Primal-Dual Interior Point Method , 1992, SIAM J. Optim..

[3]  R. Vanderbei,et al.  An Interior-point Method for Semideenite Programming an Interior-point Method for Semideenite Programming , 1994 .

[4]  Shinji Mizuno,et al.  An O(√nL)-Iteration Homogeneous and Self-Dual Linear Programming Algorithm , 1994, Math. Oper. Res..

[5]  Shinji Hara,et al.  Interior Point Methods for the Monotone Linear Complementarity Problem in Symmetric Matrices , 1995 .

[6]  Farid Alizadeh,et al.  Interior Point Methods in Semidefinite Programming with Applications to Combinatorial Optimization , 1995, SIAM J. Optim..

[7]  Yinyu Ye,et al.  A simplified homogeneous and self-dual linear programming algorithm and its implementation , 1996, Ann. Oper. Res..

[8]  Robert J. Vanderbei,et al.  An Interior-Point Method for Semidefinite Programming , 1996, SIAM J. Optim..

[9]  Nathan W. Brixius,et al.  Solving Semidefinite Programs in Mathematica , 1996 .

[10]  Stephen P. Boyd,et al.  Semidefinite Programming , 1996, SIAM Rev..

[11]  Shuzhong Zhang,et al.  Duality and Self-Duality for Conic Convex Programming , 1996 .

[12]  C. Roos,et al.  Infeasible Start Semidefinite Programming Algorithms Via Self-Dual Embeddings , 1997 .

[13]  Jean Pierre Haeberly,et al.  Sdppack User's Guide , 1997 .

[14]  Renato D. C. Monteiro,et al.  Primal-Dual Path-Following Algorithms for Semidefinite Programming , 1997, SIAM J. Optim..

[15]  Masakazu Kojima,et al.  Exploiting sparsity in primal-dual interior-point methods for semidefinite programming , 1997, Math. Program..

[16]  Shinji Hara,et al.  Interior-Point Methods for the Monotone Semidefinite Linear Complementarity Problem in Symmetric Matrices , 1997, SIAM J. Optim..

[17]  Michael L. Overton,et al.  Primal-Dual Interior-Point Methods for Semidefinite Programming: Convergence Rates, Stability and Numerical Results , 1998, SIAM J. Optim..

[18]  M. Overton,et al.  Primal - dual interior - point methods for semidefinite programming : Stability, convergence, and nu , 1998 .

[19]  Kim-Chuan Toh,et al.  The Chebyshev Polynomials of a Matrix , 1999, SIAM J. Matrix Anal. Appl..

[20]  F. Potra,et al.  On homogeneous interrior-point algorithms for semidefinite programming , 1998 .

[21]  Kim-Chuan Toh,et al.  On the Nesterov-Todd Direction in Semidefinite Programming , 1998, SIAM J. Optim..