Optimization Online Digest — March 2004

Applications — OR and Management Sciences

An annotated bibliography of GRASP
Paola Festa, Mauricio G. C. Resende

Pair-wise envy free and stable matchings for two-sided systems with techniques
Somdeb Lahiri

Convex and Nonsmooth Optimization

Dual Convergence of the Proximal Point Method with Bregman Distances for Linear Programming
J. X. Cruz Neto, , O. P. Ferreira, A. N. Iusem, R. D. C. Monteiro

Global Optimization

Semidefinite Approximations for Global Unconstrained Polynomial Optimization
Dorina Jibetean, Monique Laurent

On the globally convexized filled function method for box constrained continuous global optimization
Wenxing Zhu

Integer Programming

Unification of lower-bound analyses of the lift-and-project rank of combinatorial optimization polyhedra
Sung-Pil Hong, Levent Tuncel

Valid inequalities based on the interpolation procedure
Sanjeeb Dash, Oktay Gunluk

Integer programming, duality and superadditive functions
Jean B. Lasserre

Linear, Cone and Semidefinite Programming

Preprocessing sparse semidefinite programs via matrix completion
Katsuki Fujisawa, Mituhiro Fukuda, Kazuhide Nakata

A new notion of weighted centers for semidefinite programming
Chek Beng Chua

Hyperbolic Programs, and Their Derivative Relaxations
James Renegar

Network Optimization

Fortran subroutines for network flow optimization using an interior point algorithm
João Patrício, Luis F. Portugal, Mauricio G. C. Resende, Geraldo Veiga, Joaquim J. Júdice

Nonlinear Optimization

On the Implementation of an Interior-Point Filter Line-Search Algorithm for Large-Scale Nonlinear Programming
Andreas Wächter, Lorenz T Biegler

Graph Coloring in the Estimation of Sparse Derivative Matrices: Instances and Applications
Shahadat Hossain, Trond Steihaug

Other Topics

An Efficient Interior-Point Method for Convex Multicriteria Optimization Problems
Joerg Fliege

A moment approach to analyze zeros of triangular polynomial sets
Jean B. Lasserre