Linear, Cone and Semidefinite Programming Submissions  2006
January 2006
Generating and Measuring Instances of Hard Semidefinite Programs, SDP
Hua Wei, Henry Wolkowicz
The Rate of Convergence of the Augmented Lagrangian Method for Nonlinear Semidefinite Programming
Defeng Sun, Jie Sun, Liwei Zhang
February 2006
Central Paths in Semidefinite Programming, Generalized Proximal Point Method and Cauchy Trajectories in Riemannian Manifolds
J. X. da Cruz Neto, O. P. Ferreira, P. R. Oliveira, R. C. M. Silva
An extension of the standard polynomialtime primaldual pathfollowing algorithm to the weighted determinant maximization problem with semidefinite constraints
Takashi Tsuchiya, Yu Xia
Other
Algebraic Tail Decay of Condition Numbers for Random Conic Systems under a General Family of Input Distributions
Raphael Hauser, Tobias Muller
March 2006
Representing the space of linear programs as a Grassmannian
Gongyun Zhao
Other
Towards nonsymmetric conic optimization
Yurii Nesterov
April 2006
Other
Constructing selfconcordant barriers for convex cones
Yurii Nesterov
Other
Nonsymmetric potentialreduction methods for general cones
Yurii Nesterov
May 2006
Linear Programming
Implementation of WarmStart Strategies in InteriorPoint Methods for Linear Programming in Fixed Dimension
Elizabeth John, E. Alper Yildirim
Semidefinite Programming
Target following algorithms for semidefinite programming
Chek Beng Chua
Robust Semidefinite Programming Approaches for Sensor Network Localization with Anchors
Nathan Krislock, Veronica Piccialli, Henry Wolkowicz
Linear Programming
An Efficient Approach to Updating Simplex Multipliers in the Simplex Algorithm
JianFeng Hu, PingQi Pan
Semidefinite Programming
Globally Optimal Solutions for Large SingleRow Facility Layout Problems
Miguel F. Anjos, Anthony Vannelli
An inexact primaldual path following algorithm for convex quadratic SDP
KimChuan Toh
June 2006
Semidefinite Programming
Identifying Redundant Linear Constraints in Systems of Linear Matrix Inequality Constraints
Shafiu Jibrin, Daniel Stover
July 2006
On the Convergence of the EntropyExponential Penalty Trajectories and Generalized Proximal Point Methods in Semidefinite Optimization
O. P. Ferreira, P. R. Oliveira, R. C. M. Silva
August 2006
Linear Programming
Polytopes and Arrangements versus Diameter and Curvature
Antoine Deza, Tamas Terlaky, Yuriy Zinchenko
Semidefinite Programming
The first cut is the cheapest: improving SDP bounds for the clique number via copositivity
Immanuel M. Bomze, Florian Frommlet, Marco Locatelli
New upper bounds for kissing numbers from semidefinite programming
Christine Bachoc, Frank Vallentin
Central path curvature and iterationcomplexity for redundant KleeMinty cubes
Antoine Deza, Tamas Terlaky, Yuriy Zinchenko
On Handling Free Variables in InteriorPoint Methods for Conic Linear Optimization
Miguel F. Anjos, Samuel Burer
Linear Programming
A WarmStart Approach for LargeScale Stochastic Linear Programs
Marco Colombo, Jacek Gondzio, Andreas Grothey
September 2006
Correlative sparsity in primaldual interiorpoint methods for LP, SDP and SOCP
Kazuhiro Kobayashi, Sunyoung Kim, Masakazu Kojima
October 2006
On the SecondOrder Feasibility Cone: PrimalDual Representation and Efficient Projection
Alexandre Belloni, Robert M. Freund
An Efficient Rescaled Perceptron Algorithm for Conic Systems
Alexandre Belloni, Robert M. Freund, Santosh Vempala
Linear Programming
A Simpler and Tighter Redundant KleeMinty Construction
Eissa Nematollahi, Tamas Terlaky
On the Copositive Representation of Binary and Continuous Nonconvex Quadratic Programs
Samuel Burer
Semidefinite Programming
A Matrixlifting Semidefinite Relaxation for the Quadratic Assignment Problem
Yichuan Ding, Henry Wolkowicz
Semidefinite programming, multivariate orthogonal polynomials, and codes in spherical caps
Christine Bachoc, Frank Vallentin
November 2006
Semidefinite Programming
A Unified Theorem on SDP Rank Reduction
Anthony ManCho So, Yinyu Ye, Jiawei Zhang
Other
Selective GramSchmidt orthonormalization for conic cutting surface algorithms
John E. Mitchell, Vasile L. Basescu
December 2006
Semidefinite Programming
A PARALLEL conic interior point decomposition approach for blockangular semidefinite programs
Kartik Krishnan Sivaramakrishnan
Primaldual firstorder methods with ${\cal O}(1/\epsilon)$ iterationcomplexity for cone programming
Guanghui Lan, Zhaosong Lu, Renato D.C. Monteiro
Optimal Embeddings of Distance Regular Graphs into Euclidean Spaces
Frank Vallentin
Sensor Network Localization, Euclidean Distance Matrix Completions, and Graph Realization
Yichuan Ding, Nathan Krislock, Jiawei Qian, Henry Wolkowicz
Recursive Construction of Optimal SelfConcordant Barriers for Homogeneous Cones
Olena Shevchenko
Linear Programming
Finding a point in the relative interior of a polyhedron
Coralia Cartis, Nicholas I M Gould
