Linear, Cone and Semidefinite Programming Submissions - 2002

January 2002

Semi-definite Programming
Polynomiality of an inexact infeasible interior point algorithm for semidefinite programming
Guanglu Zhou, Kim-Chuan Toh

Linear Programming
Computational Experience and the Explanatory Value of Condition Numbers for Linear Optimization
Ordonez Fernando, Robert M. Freund

February 2002

Semi-definite Programming
A new class of merit functions for the semidefinite complementarity problem
Rosely M. B. Goes, Paulo R. Oliveira

March 2002

Semi-definite Programming
Parallel Computing on Semidefinite Programs
Steven Benson

Semi-definite Programming
DSDP4 Software User Guide
Steven Benson, Yinyu Ye

April 2002

Second-Order Cone Programming
Exact Solutions of Some Nonconvex Quadratic Optimization Problems via SDP and SOCP Relaxations
Sunyoung Kim, Masakazu Kojima

May 2002

Semi-definite Programming
Semidefinite Programming in the Space of Partial Positive Semidefinite Matrices
Samuel Burer

Other
Relating Homogeneous Cones and Positive Definite Cones via $T$-algebras
Chek Beng Chua

Condition and complexity measures for infeasibility certificates of systems of linear inequalities and their sensitivity analysis
Hugo J. Lara, Levent Tuncel

June 2002

A General Framework for Convex Relaxation of Polynomial Optimization Problems over Cones
Masakazu Kojima, Sunyoung Kim, Hayato Waki

Semi-definite Programming
Characterization of the limit point of the central path in semidefinite programming
Göran Sporre, Anders Forgren

Geometry of homogeneous convex cones, duality mapping, and optimal self-concordant barriers
Van Anh Truong, Levent Tuncel

Semi-definite Programming
Limiting behavior of the central path in semidefinite optimization
M. Halicka, E. De Klerk, C. Roos

Semi-definite Programming
An Improved Semidefinite Programming Relaxation for the Satisfiability Problem
Miguel F. Anjos

July 2002

Linear Programming
The Inverse Optimal Value Problem
Shabbir Ahmed, Yongpei Guan

Linear Programming
Unifying Condition Numbers for Linear Programming
Dennis Cheung, Felipe Cucker, Javier Pena

Computation of Minimum Volume Covering Ellipsoids
Peng Sun, Robert M. Freund

August 2002

Solving second order cone programming via a reduced augmented system approach
Zhi Cai, Kim-Chuan Toh

Implementation of Interior Point Methods for Mixed Semidefinite and Second Order Cone Optimization Problems
Jos F. Sturm

Semi-definite Programming
A Simplified/Improved HKM Direction for Certain Classes of Semidefinite Programming
Franz Rendl, Renata Sotirov, Henry Wolkowicz

September 2002

Semi-definite Programming
Implementation and Evaluation of SDPA 6.0 (SemiDefinite Programming Algorithm 6.0
Makoto Yamashita, Katsuki Fujisawa, Masakazu Kojima

A D-Induced Duality and Its Applications
Jan Brinkhuis, Shuzhong Zhang

Semi-definite Programming
Semidefinite optimization, a spectral approach
M.A. van Bossum

October 2002

Semi-definite Programming
SDPARA : SemiDefinite Programming Algorithm PARAllel Version
M Yamashita, K Fujisawa, M Kojima

Semi-definite Programming
CSDP 5.0 User's Guide
Brian Borchers

A new iteration-complexity bound for the MTY predictor-corrector algorithm
Renato D. C. Monteiro, Takashi Tsuchiya

November 2002

Semi-definite Programming
A unifying framework for several cutting plane algorithms for semidefinite programming
Kartik Krishnan, John E. Mitchell

Semi-definite Programming
Quadratic Convergence of a Squared Smoothing Newton Method for Nonsmooth Matrix Equations and Its Applications in Semidefinite Optimization Problems
JIE SUN, DEFENG SUN, LIQUN QI