Linear, Cone and Semidefinite Programming Submissions  2011
January 2011
Linear Programming
KleeMinty's LP and Upper Bounds for Dantzig's Simplex Method
Tomonari Kitahara, Shinji Mizuno
Linear Programming
A Bound for the Number of Different Basic Solutions Generated by the Simplex Method
Tomonari Kitahara, Shinji Mizuno
Epigraphical cones I
Alberto Seeger
Epigraphical cones II
Alberto Seeger
Linear Programming
New developments in the primaldual column generation technique
Jacek Gondzio, Pablo GonzálezBrevis, Pedro Munari
Semidefinite Programming
Approximation Theory of Matrix Rank Minimization and Its Application to Quadratic Equations
YunBin Zhao
February 2011
Linear Programming
On the Number of Solutions Generated by the Dual Simplex Method
Tomonari Kitahara, Shinji Mizuno
Linear Programming
On the Number of Solutions Generated by Dantzig's Simplex Method for LP with Bounded Variables
Tomonari Kitahara, Tomomi Matsui, Shinji Mizuno
Linear Programming
A polynomial relaxationtype algorithm for linear programming
Sergei Chubanov
Semidefinite Programming
Preprocessing and Reduction for Degenerate Semidefinite Programs
YuenLam Cheung, Simon Schurr, Henry Wolkowicz
Linear Programming
InteriorPoint Algorithms for a Generalization of Linear Programming and Weighted Centering
Kurt Anstreicher
March 2011
Semidefinite Programming
An Iterative Scheme for Valid Polynomial Inequality Generation in Binary Polynomial Programming
Bissan Ghaddar, Juan C. Vera, Miguel F. Anjos
Other
The extreme rays of the 5x5 copositive cone
Roland Hildebrand
Semidefinite Programming
CONSTRAINED POLYNOMIAL OPTIMIZATION PROBLEMS WITH NONCOMMUTING VARIABLES
Kristijan Cafuta, Igor Klep, Janez Povh
April 2011
Semidefinite Programming
Approximation algorithms for trilinear optimization with nonconvex constraints and its extensions
Yuning Yang, Qingzhi Yang
Semidefinite Programming
On Solving Biquadratic Optimization via Semidefinite Relaxation
Yang Yuning, Yang Qingzhi
Semidefinite Programming
High accuracy solution of large scale semidefinite programs
Thomas Davi, Florian Jarre
Semidefinite Programming
Solving large scale problems over the doubly nonnegative cone
Thomas Davi, Florian Jarre
How bad is a gradient algorithm for linear programming?
Peter A. Bruijs
The Second Order Directional Derivative of Symmetric Matrixvalued Functions
Liwei Zhang, Ning Zhang , Xiantao Xiao
Semidefinite Programming
Inner approximations for polynomial matrix inequalities and robust stability regions
Didier Henrion, JeanBernard Lasserre
Linear Programming
A Simple Variant of the MizunoToddYe PredictorCorrector Algorithm and its ObjectiveFunctionFree Complexity
Tomonari Kitahara, Takashi Tsuchiya
May 2011
Semidefinite Programming
A Computational Study for the SingleRow Facility Layout Problem
Philipp Hungerländer, Franz Rendl
On the Computational Complexity of Membership Problems for the Completely Positive Cone and its Dual
P.J.C. Dickinson, L. Gijben
June 2011
On semidefinite programming bounds for graph bandwidth
Etienne De Klerk, Marianna E.Nagy, Renata Sotirov
Semidefinite Programming
Exact Approaches to Multilevel Vertical Orderings
Markus Chimani, Philipp Hungerländer
Other
Copositive optimization  recent developments and applications
Immanuel M. Bomze
Other
Think co(mpletely )positive ! Matrix properties, examples and a clustered bibliography on copositive optimization
Immanuel M. Bomze, Werner Schachinger, Gabriele Uchida
Semidefinite Programming
Computing the Grothendieck constant of some graph classes
Monique Laurent, Antonios Varvitsiotis
July 2011
Implementing the simplex method as a cuttingplane method
Csaba I. Fabian, Olga Papp, Krisztian Eretnek
On the setsemidefinite representation of nonconvex quadratic programs over arbitrary feasible sets
Gabriele Eichfelder, Janez Povh
Semidefinite Programming
How to generate weakly infeasible semidefinite programs via Lasserre's relaxations for polynomial optimization
Hayato Waki
Linear Programming
Lower bounds for the number of solutions generated by the simplex method
Tomonari Kitahara, Shinji Mizuno
August 2011
Semidefinite Programming
A tractable semidefinite programming relaxation for the graph partition problem
Sotirov
Linear Programming
A Proof by the Simplex Method for the Diameter of a (0,1)Polytope
Tomonari Kitahara, Shinji Mizuno
SecondOrder Cone Programming
Sampling with respect to a class of measures arising in secondorder cone optimization with rank constraints
Leonid Faybusovich
Semidefinite Programming
Infeasibility certificates for linear matrix inequalities
Igor Klep, Markus Schweighofer
September 2011
Properties of a Cutting Plane Method for Semidefinite Programming
Kartik K. Sivaramakrishnan, John E. Mitchell
Linear Programming
A smooth perceptron algorithm
Negar Soheili, Javier Pena
Curvature Integrals and Iteration Complexities in SDP and Symmetric Cone Programs
Satoshi Kakihara, Atsumi Ohara, Takashi Tsuchiya
Information Geometry and InteriorPoint Algorithms in SDP and Symmetric Cone Programs
Satoshi Kakihara, Atsumi Ohara, Takashi Tsuchiya
October 2011
Correlative Sparsity Structures and Semidefinite Relaxations for Concave Cost Transportation Problems with Change of Variables
Tomohiko Mizutani, Makoto Yamashita
Semidefinite Programming
Improved lower bounds for the 2page crossing numbers of K(m,n) and K(n) via semidefinite programming
Etienne De Klerk, Dmitrii V. Pasechnik
SecondOrder Cone Programming
Differentiable exact penalty functions for nonlinear secondorder cone programs
Ellen H. Fukuda, Paulo J. S. Silva, Masao Fukushima
November 2011
An extension of the elimination method for a sparse SOS polynomiml
Hayato Waki, Masakazu Muramatsu
A Primal Barrier Function Phase I Algorithm for Nonsymmetric Conic Optimization Problems
Yasuaki Matsukawa, Akiko Yoshise
Other
Lineartime complete positivity detection and decomposition of sparse matrices
Peter J.C. Dickinson, Mirjam Dür
December 2011
Linear Programming
Improved Column Generation for Highly Degenerate Master Problems
Jacques Desrosiers, JeanBertrand Gauthier, Marco Lübbecke
The Gram dimension of a graph
Monique Laurent, Antonios Varvitsiotis
