Linear, Cone and Semidefinite Programming Submissions - 2005

January 2005

Semi-definite Programming
Rigorous Error Bounds for the Optimal Value in Semidefinite Programming
C. Jansson, C. Keil

February 2005

Linear Programming
A Full-Newton Step $O(n)$ Infeasible Interior-Point Algorithm for Linear Optimization
Kees Roos

Linear Programming
Towards a practical parallelisation of the simplex method
Julian Hall

Linear Programming
Some Disadvantages of a Mehrotra-Type Primal-Dual Corrector Interior Point Algorithm for Linear Programming
Coralia Cartis

Semi-definite Programming
Large-scale semidefinite programs in electronic structure calculation
Mituhiro Fukuda, Bastiaan J. Braams, Maho Nakata, Michael L. Overton, Jerome K. Percus, Makoto Yamashita , Zhengji Zhao

Semi-definite Programming
Behavioral Measures and their Correlation with IPM Iteration Counts on Semi-Definite Programming Problems
Robert M. Freund, Fernando Ordonez, Kim Chuan Toh

March 2005

Semi-definite Programming
On the solution of large-scale SDP problems by the modified barrier method using iterative solvers
Michal Kocvara, Michael Stingl

Semi-definite Programming
How Far Can We Go With Primal-Dual Interior Point Methods for SDP?
Brian Borchers, Joseph Young

Semi-definite Programming
Reduction of symmetric semidefinite programs using the regular *-representation
Etienne De Klerk, Dmitrii V. Pasechnik, Alexander Schrijver

Solving Large-Scale Semidefinite Programs in Parallel
Madhu Nayakkankuppam

Semi-definite Programming
Inexact primal-dual path-following algorithms for a special class of convex quadratic SDP and related problems
K. C. Toh, R. H. Tutuncu, M. J. Todd

Semi-definite Programming
Parallel Primal-Dual Interior-Point Methods for SemiDefinite Programs
Makoto Yamashita, Katsuki Fujisawa, Mituhiro Fukuda, Masakazu Kojima, Kazuhide Nakata

Linear Programming
On the Convergence of a Primal-Dual Second-Order Corrector Interior Point Algorithm for Linear Programming
Coralia Cartis

On Mehrotra-Type Predictor-Corrector Algorithms
Maziar Salahi, Jiming Peng, Tamas Terlaky

Semi-definite Programming
A Semidefinite Optimization Approach for the Single-Row Layout Problem with Unequal Dimensions
Miguel F. Anjos, Andrew Kennings, Anthony Vannelli

April 2005

Semi-definite Programming
A NEW BARRIER FOR A CLASS OF SEMIDEFINITE PROBLEMS
Erik Papa Quiroz, Paulo Roberto Oliveira

Linear Programming
Generalization of the primal and dual affine scaling algorithms
F. G. M. Cunha, A. W. M. Pinto, P. R. Oliveira, J. X. da C. Neto

Linear Programming
Constraint Reduction for Linear Programs with Many Inequality Constraints
Andre L. Tits, Pierre-Antoine Absil, William P. Woessner

May 2005

Semi-definite Programming
An Explicit Semidefinite Characterization of Satisfiability for Tseitin Instances
Miguel F. Anjos

Projective Pre-Conditioners for Improving the Behavior of a Homogeneous Conic Linear System
Alexandre Belloni, Robert M. Freund

June 2005

Termination and Verification for Ill-Posed Semidefinite Programming Problems
Christian Jansson

Semi-definite Programming
The Strong Second-Order Sufficient Condition and Constraint Nondegeneracy in Nonlinear Semidefinite Programming and Their Implications
Defeng Sun

New Complexity Analysis of IIPMs for Linear Optimization Based on a Specific Self-Regular Function
Maziar Salahi, Mohammad Reza Peyghami, Tamas Terlaky

Linear Programming
A Full-Newton Step $O(n)$ Infeasible Interior-Point Algorithm for Linear Optimization
C Roos

An analytic center cutting plane approach for conic programming
Vasile L. Basescu, John E. Mitchell

Largest dual ellipsoids inscribed in dual cones
M. J. Todd

Jordan-algebraic approach to convexity theorem for quadratic mappings
Leonid Faybusovich

Linear Programming
Enlarging Neighborhoods of Interior-Point Algorithms for Linear Programming via Least Values of Proximity measure Functions
Y.B. ZHAO

Semi-definite Programming
Semidefinite Bounds for the Stability Number of a Graph via Sums of Squares of Polynomials
Nebojsa Gvozdenovic, Monique Laurent

An Iterative Solver-Based Long-Step Infeasible Primal-Dual Path-Following Algorithm for Convex QP Based on a Class of Preconditioners
Zhaosong Lu, Renato Monteiro, Jerome O'Neal

July 2005

Linear Programming
Generalized Support Set Invariancy Sensitivity Analysis
Alireza Ghaffari Hadigheh, Tamas Terlaky

Semi-definite Programming
Sparse Covariance Selection via Robust Maximum Likelihood Estimation
Onureena Banerjeee, Alexandre d'Aspremont, Laurent El Ghaoui

Semi-definite Programming
Complex Matrix Decomposition and Quadratic Programming
Yongwei Huang, Shuzhong Zhang

Linear Programming
The Simplex Method - Computational Checks for the Simplex Calculation
G. Yarmish

Linear Programming
A DISTRIBUTED, SCALEABLE SIMPLEX METHOD
Gavriel Yarmish, Richard Van Slyke

September 2005

Postponing the Choice of the Barrier Parameter in Mehrotra-Type Predictor-Corrector Algorithms
Maziar Salahi, Tama's Terlaky

Linear Programming
An Exact Primal-Dual Penalty Method Approach to Warmstarting Interior-Point Methods for Linear Programming
Hande Benson, David Shanno

Anstreicher-Terlaky type monotonic simplex algorithms for linear feasibility problems
Illés Tibor, Bilen Filiz, Csizmadia Zsolt

Semidefinite Optimization Approaches for Satisfiability and Maximum-Satisfiability Problems
Miguel F. Anjos

Linear Programming
Computational NETLIB experience with a dense projected gradient sagitta method
Ángel Santos-Palomo, Pablo Guerrero-García

Semi-definite Programming
Variational Two-electron Reduced Density Matrix Theory for Many-electron Atoms and Molecules: Implementation of the Spin- and Symmetry-adapted T2 Condition through First-order Semidefinite Programming
David A. Mazziotti

A Homogeneous Model for Mixed Complementarity Problems over Symmetric Cones
Yedong Lin, Akiko Yoshise

Semi-definite Programming
Implementation of a Primal-Dual Method for SDP on a Parallel Architecture
Brian Borchers, Joseph Young

Linear Programming
A strong bound on the integral of the central path curvature and its relationship with the iteration complexity of primal-dual path-following LP algorithms
Renato D. C. Monteiro, Takashi Tsuchiya

October 2005

Linear Programming
Further Development of Multiple Centrality Correctors for Interior Point Methods
Marco Colombo, Jacek Gondzio

November 2005

Semi-definite Programming
A conic interior point decomposition approach for large scale semidefinite programming
Kartik Krishnan Sivaramakrishnan, Gema Plaza, Tamas Terlaky

December 2005

Semi-definite Programming
An LMI description for the cone of Lorentz-positive maps
Roland Hildebrand

The perceptron-rescaling algorithm for symmetric cone optimization
Imre Pólik, Tamás Terlaky

Approximating the Chromatic Number of a Graph by Semidefinite Programming
Nebojsa Gvozdenovic, Monique Laurent