Linear, Cone and Semidefinite Programming Submissions - 2008

January 2008

Linear Programming
A Redundant Klee-Minty Construction with All the Redundant Constraints Touching the Feasible Region
Eissa Nematollahi, Tamas Terlaky

An Adaptive Linear Approximation Algorithm for Copositive Programs
Stefan Bundfuss, Mirjam Duer

Semi-definite Programming
Exploiting Sparsity in SDP Relaxation for Sensor Network Localization
Sunyoung Kim, Masakazu Kojima, Hayato Waki

Semi-definite Programming
Lower Bounds for Measurable Chromatic Numbers
Christine Bachoc, Gabriele Nebe, Fernando M\'ario de Oliveira Filho, Frank Vallentin

Semi-definite Programming
Computing Globally Optimal Solutions for Single-Row Layout Problems Using Semidefinite Programming and Cutting Planes
Miguel F. Anjos, Anthony Vannelli

March 2008

Other
Homogeneous algorithms for monotone complementarity problems over symmetric cones
Yoshise Akiko

Parallel implementation of a semidefinite programming solver based on CSDP on a distributed memory cluster
Ivan D. Ivanov, Etienne De Klerk

Semi-definite Programming
A Newton-CG Augmented Lagrangian Method for Semidefinite Programming
Xinyuan Zhao, Defeng Sun, Kim-Chuan Toh

May 2008

Linear Programming
An Analysis of Weighted Least Squares Method and Layered Least Squares Method with the Basis Block Lower Triangular Matrix Form
Tomonari Kitahara, Tsuchiya Takashi

June 2008

Semi-definite Programming
Lower bounds for approximate factorizations via semidefinite programming
Erich Kaltofen, Bin Li, Kartik Krishnan Sivaramakrishnan, Zhengfeng Yang, Lihong Zhi

Linear Programming
A Comparison of Software Packages for Verified Linear Programming
Christian Keil

Linear Programming
Basis partition of the space of linear programs through a differential equation
Gongyun Zhao

Other
T-algebras and linear optimization over symmetric cones
Chek Beng Chua

Calibrating Least Squares Covariance Matrix Problems with Equality and Inequality Constraints
Yan Gao, Defeng Sun

Linear Programming
An elementary proof of optimality conditions for linear programming
Anders Forsgren

July 2008

A New Full-Newton step $O(n)$ Infeasible Interior-Point Algorithm for Semidefinite Optimization
Hossein Mansouri, Cornelis Roos

Semi-definite Programming
A new class of large neighborhood path-following interior point algorithms for semidefinite optimization with $O(\sqrt{n}\log{\frac{{\rm Tr}(X^0S^0)}{\epsilon}})$ iteration complexity
Yang Li, Tamas Terlaky