Optimization Online Digest — March 2005

Applications — OR and Management Sciences

Wavelength Assignment in Multi-Fiber WDM Networks by Generalized Edge Coloring
Arie M.C.A. Koster

Dual Constrained Single Machine Sequencing to Minimize Total Weighted Completion Time
Yunpeng Pan, Leyuan Shi

Applications — Science and Engineering

Experimental Datasets from Chemical Thermodynamics
Evgenii Rudnyi

Combinatorial Optimization

Semidefinite programming relaxations for graph coloring and maximal clique problems
Igor Dukanovic, Franz Rendl

Semidefinite Programming Based Approaches to Home-away Assignment Problems in Sports Scheduling
Ayami Suzuka, Ryuhei Miyashiro, Akiko Yoshise, Tomomi Matsui

Convex and Nonsmooth Optimization

Solving Maximum-Entropy Sampling Problems Using Factored Masks
Samuel Burer, Jon Lee

Variable metric method for minimization of partially separable nonsmooth functions.
Ladislav Luksan, Jan Vlcek

On a closedness theorem
Újvári Miklós

Global Optimization

Toward a new DIRECT algorithm. A two-points based sampling method
chiter lakhdar

Social Cognitive Maps, Swarm Collective Perception and Distributed Search on Dynamic Landscapes
Vitorino Ramos, Carlos Fernandes, Agostinho C. Rosa

Varying the Population Size of Artificial Foraging Swarms on Time Varying Landscapes
Carlos Fernandes, Vitorino Ramos, Agostinho C. Rosa

A linear programming reformulation of the standard quadratic optimization problem
Etienne De Klerk, Dmitrii, V. Pasechnik

Packing circles in a square: new putative optima obtained via global optimization
Bernardetta Addis, Marco Locatelli, Fabio Schoen

SparsePOP : a Sparse Semidefinite Programming Relaxation of Polynomial Optimization Problems
Hayato Waki, Sunyoung Kim, Masakazu Kojima, Masakazu Muramatsu

Integer Programming

On the equivalence of the max-min transportation lower bound and the time-indexed lower bound for single-machine scheduling problems
Yunpeng Pan, Leyuan Shi

Linear, Cone and Semidefinite Programming

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

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

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

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

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

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

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

Nonlinear Optimization

On Augmented Lagrangian methods with general lower-level constraints
Roberto Andreani, Ernesto Birgin, José Mario Martínez, María Laura Schuverdt

Adaptive Barrier Strategies for Nonlinear Interior Methods
Jorge Nocedal, Andreas Wächter, Richard A Waltz

Local Analysis of the Feasible Primal-Dual Interior-Point Method
R. Silva, J. Soares, L. N. Vicente

Stochastic Programming

A Perturbed Gradient Algorithm in Hilbert Spaces
Kengy Barty, Jean-Sebastien Roy, Cyrille Strugarek

Other Topics

Generalized Dynamic Programming: A Unified Optimization Framework
Yunpeng Pan, Leyuan Shi