-

 

 

 




Optimization Online





 

Linear, Cone and Semidefinite Programming Submissions - 2011

January 2011

Linear Programming
Klee-Minty'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 primal-dual column generation technique
Jacek Gondzio, Pablo González-Brevis, Pedro Munari

Semi-definite Programming
Approximation Theory of Matrix Rank Minimization and Its Application to Quadratic Equations
Yun-Bin 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 relaxation-type algorithm for linear programming
Sergei Chubanov

Semi-definite Programming
Preprocessing and Reduction for Degenerate Semidefinite Programs
Yuen-Lam Cheung, Simon Schurr, Henry Wolkowicz

Linear Programming
Interior-Point Algorithms for a Generalization of Linear Programming and Weighted Centering
Kurt Anstreicher


March 2011

Semi-definite 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

Semi-definite Programming
CONSTRAINED POLYNOMIAL OPTIMIZATION PROBLEMS WITH NONCOMMUTING VARIABLES
Kristijan Cafuta, Igor Klep, Janez Povh


April 2011

Semi-definite Programming
Approximation algorithms for trilinear optimization with nonconvex constraints and its extensions
Yuning Yang, Qingzhi Yang

Semi-definite Programming
On Solving Biquadratic Optimization via Semidefinite Relaxation
Yang Yuning, Yang Qingzhi

Semi-definite Programming
High accuracy solution of large scale semidefinite programs
Thomas Davi, Florian Jarre

Semi-definite 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 Matrix-valued Functions
Liwei Zhang, Ning Zhang , Xiantao Xiao

Semi-definite Programming
Inner approximations for polynomial matrix inequalities and robust stability regions
Didier Henrion, Jean-Bernard Lasserre

Linear Programming
A Simple Variant of the Mizuno-Todd-Ye Predictor-Corrector Algorithm and its Objective-Function-Free Complexity
Tomonari Kitahara, Takashi Tsuchiya


May 2011

Semi-definite Programming
A Computational Study for the Single-Row 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

Semi-definite Programming
Exact Approaches to Multi-level 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

Semi-definite Programming
Computing the Grothendieck constant of some graph classes
Monique Laurent, Antonios Varvitsiotis


July 2011

Implementing the simplex method as a cutting-plane method
Csaba I. Fabian, Olga Papp, Krisztian Eretnek

On the set-semidefinite representation of nonconvex quadratic programs over arbitrary feasible sets
Gabriele Eichfelder, Janez Povh

Semi-definite 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

Semi-definite 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

Second-Order Cone Programming
Sampling with respect to a class of measures arising in second-order cone optimization with rank constraints
Leonid Faybusovich

Semi-definite 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 Interior-Point 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

Semi-definite Programming
Improved lower bounds for the 2-page crossing numbers of K(m,n) and K(n) via semidefinite programming
Etienne De Klerk, Dmitrii V. Pasechnik

Second-Order Cone Programming
Differentiable exact penalty functions for nonlinear second-order 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
Linear-time 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, Jean-Bertrand Gauthier, Marco Lübbecke

The Gram dimension of a graph
Monique Laurent, Antonios Varvitsiotis


  Visitors Authors More about us Links
  Subscribe, Unsubscribe
Digest Archive
Search, Browse the Repository

 

Submit
Update
Policies
Coordinator's Board
Classification Scheme
Credits
Give us feedback
Optimization Journals, Sites, Societies
Mathematical Programming Society