Optimization Online Digest — July 2002

Applications — OR and Management Sciences

A Class of Hybrid Methods for Revenue Management
William Cooper, Tito Homem-de-Mello

Applications — Science and Engineering

TfMin: Short Reference Manual
Jean-Baptiste Caillau, Joseph Gergaud, Joseph Noailles

Distance Weighted Discrimination
J. S. Marron, M. J. Todd

Combinatorial Optimization

On graphs with stability number equal to the optimal value of a convex quadratic program
Domingos M. Cardoso

Lagrangian Smoothing Heuristic for Max-Cut
Hernán Alperin, Ivo Nowak

Convex and Nonsmooth Optimization

On differentiability of symmetric matrix valued functions
Alexander Shapiro

On a class of nonsmooth composite functions
Alexander Shapiro

Analysis of a Path Following Method for Nonsmooth Convex Programs
Sanjay Mehrotra, Muhittin Ozevin

Minimizing nonconvex nonsmooth functions via cutting planes and proximity control
Antonio Fuduli, Manlio Gaudioso, Giovanni Giallombardo

Integer Programming

Lower bound for the number of iterations in semidefinite hierarchies for the cut polytope
Monique Laurent

Solving the knapsack problem via Z-transform
Jean B. Lasserre, Eduardo S. Zeron

Linear, Cone and Semidefinite Programming

The Inverse Optimal Value Problem
Shabbir Ahmed, Yongpei Guan

Unifying Condition Numbers for Linear Programming
Dennis Cheung, Felipe Cucker, Javier Pena

Nonlinear Optimization

A Primal-Dual Interior-Point Method for Nonlinear Programming with Strong Global and Local Convergence Properties.
Andre L. Tits, Andreas Waechter, Sasan Bakhtiari, Thomas J. Urban, Craig T. Lawrence

Interior-Point Methods for Nonconvex Nonlinear Programming: Complementarity Constraints
Hande Y. Benson, David F. Shanno, Robert J. Vanderbei

Optimization Software and Modeling Systems

Parallel Interval Continuous Global Optimization Algorithms
abdeljalil benyoub