Optimization Online Digest — May 2003

Combinatorial Optimization

A Branch and Cut Algorithm for Hub Location Problems with Single Assignment
Martine Labbé, Hande Yaman, Eric Gourdin

Convex and Nonsmooth Optimization

LMI approximations for cones of positive semidefinite forms
Luis Zuluaga, Juan Vera, Javier Pena

Characterizations of error bounds for lower semicontinuous functions on metric spaces
Dominique Azé, Jean-Noël Corvellec

Conic systems and sublinear mappings: equivalent approaches
Javier Pena

Global Optimization

Global optimization of rational functions: a semidefinite programming approach
Dorina Jibetean, Etienne De Klerk

D.C. Versus Copositive Bounds for Standard QP
Kurt Anstreicher, Samuel Burer

Linear, Cone and Semidefinite Programming

Properties of a Cutting Plane Method for Semidefinite Programming
Kartik Krishnan, John Mitchell

A predictor-corrector algorithm for linear optimization based on a specific self-regular proximity function
jiming Peng, Tamas Terlaky, Yunbin Zhao

The Complexity of Self-Regular Proximity Based Infeasible IPMs
Maziar Salahi, Tama's Terlaky, Guoqing Zhang

On Conically Ordered Convex Programs
Shuzhong Zhang

Nonlinear Optimization

A Multicriteria Approach to Bilevel Optimization
Jörg Fliege, Luis N. Vicente

Error Estimates and Poisedness in Multivariate Polynomial Interpolation
Andrew R. Conn, Katya Scheinberg, Luis N. Vicente

SIAG/Opt Views-and-News Vol 14 No 1
Jos F. Sturm