Optimization Online Digest — August 2008

Applications — Science and Engineering

The N - k Problem in Power Grids: New Models, Formulations and Computation
Daniel Bienstock, Abhinav Verma

An SDP-based divide-and-conquer algorithm for large scale noisy anchor-free graph realization
Ngai-Hang Z. Leung, Kim-Chuan Toh

Combinatorial Optimization

Near-Optimal Solutions and Integrality Gaps for Almost All Instances of Single-Machine Precedence-Constrained Scheduling
Andreas S. Schulz, Nelson A. Uhan

Complementarity and Variational Inequalities

Projections Onto Super-Half-Spaces for Monotone Variational Inequality Problems in Finite-Dimensional Spaces
Yair Censor, Aviv Gibali

Necessary Conditions for the Impulsive Optimal Control of Multibody Mechanical Systems
Kerim Yunt

Convex and Nonsmooth Optimization

On the String Averaging Method for Sparse Common Fixed Points Problems
Yair Censor, Alexander Segal

Efficient Methods for Stochastic Composite Optimization
Guanghui Lan

Optimal steepest descent algorithms for unconstrained convex problems: fine tuning Nesterov's method
Clóvis Caesar Gonzaga, Elizabeth Wegner Karas

An efficient TVL1 algorithm for deblurring multichannel images corrupted by impulsive noise
Junfeng Yang, Yin Zhang, Wotao Yin

Identification and Elimination of Interior Points for the Minimum Enclosing Ball Problem
S. Damla AHIPASAOGLU, E. Alper YILDIRIM

Dynamic Subgradient Methods
Gregory Emiel, Claudia Sagastizabal

Global Optimization

Descent heuristics for unconstrained minimization
Florian Jarre, Ania Lopez

Integer Programming

Branching and bounds tightening techniques for non-convex MINLP
Pietro Belotti, Jon Lee, Leo Liberti, Francois Margot, Andreas Waechter

On the Relative Strength of Split, Triangle and Quadrilateral Cuts
Amitabh Basu, Pierre Bonami, Gerard Cornuejols, Francois Margot

Convex Relaxations of Non-Convex Mixed Integer Quadratically Constrained Programs: Extended Formulations
Anureet Saxena, Pierre Bonami, Jon Lee

Improved strategies for branching on general disjunctions
Gerard Cornuejols, Leo Liberti, Giacomo Nannicini

Linear, Cone and Semidefinite Programming

Strong Duality and Minimal Representations for Cone Optimization
Levent Tuncel, Henry Wolkowicz

Strange Behaviors of Interior-point Methods for Solving Semidefinite Programming Problems in Polynomial Optimization
Hayato Waki, Maho Nakata, Masakazu Muramatsu

Fourier analysis, linear programming, and densities of distance avoiding sets in R^n
Fernando M. de Oliveira Filho, Frank Vallentin

A new library of structured semidefinite programming instances
Etienne De Klerk, Renata Sotirov

Nonlinear Optimization

A Subspace Limited Memory BFGS Algorithm For Box Constrained Optimization
Wei Zengxin, Wu Yanlin, Yuan Gonglin

Stochastic Programming

The Facility Location Problem with Bernoulli Demands
Maria Albareda-Sambola, Elena Fernandez, Francisco Saldanha-da-Gama

Other Topics

Minimum Dissatisfaction Personnel Scheduling
Mugurel Ionut Andreica, Romulus Andreica, Angela Andreica