Optimization Online Digest — April 2012

Applications — OR and Management Sciences

Solving Bin Packing Related Problems Using an Arc Flow Formulation
Filipe Brandão, João Pedro Pedroso

Hybridizing VNS and path-relinking on a particle swarm framework to minimize total flowtime
Wagner Emanoel Costa, Marco C. Goldbarg, Elizabeth G. Goldbarg

Stochastic integer programming based algorithms for adaptable open block surgery scheduling
Camilo Mancilla, Robert Storer

Applications — Science and Engineering

Linear System Identification via Atomic Norm Regularization
Parikshit Shah, Badri Bhaskar, Gonnguo Tang, Benjamin Recht

pcaL1: An implementation in R of three methods for L1-norm principal component analysis
J. Paul Brooks, Sapan Jot

Combinatorial Optimization

A biased random-key genetic algorithm for a 2D and 3D bin packing problem
José F. Gonçalves, Mauricio G.C. Resende

Complementarity and Variational Inequalities

A class of Fejer convergent algorithms, approximate resolvents and the Hybrid Proximal-Extragradient method
B. F. Svaiter

The Split Common Null Point Problem
Charles Byrne, Yair Censor, Aviv Gibali, Simeon Reich

A barrier-based smoothing proximal point algorithm for NCPs over closed convex cones
Chek Beng Chua, Zhen Li

Convex and Nonsmooth Optimization

Atomic norm denoising with applications to line spectral estimation
Badri Bhaskar, Gongguo Tang, Benjamin Recht

Solution of monotone complementarity and general convex programming problems using modified potential reduction interior point method
Kuo-Ling Huang, Sanjay Mehrotra

On the Convergence Properties of Non-Euclidean Extragradient Methods for Variational Inequalities with Generalized Monotone Operators
Cong D. Dang, Guanghui Lan

Extrapolation and Local Acceleration of an Iterative Process for Common Fixed Point Problems
Andrzej Cegielski, Yair Censor

Global Optimization

Analytical formulas for calculating the extremal ranks of the matrix-valued function $A + BXC$ when the rank of $X$ is fixed
Tian Yongge

Global Optimization of Nonlinear Network Design
Arvind Raghunathan

Integer Programming

Semi-continuous network flow problems
Gustavo Angulo, Shabbir Ahmed, Santanu S. Dey

Linear, Cone and Semidefinite Programming

Decomposition Methods for Large Scale LP Decoding
Siddharth Barman, Xishuo Liu, Stark Draper, Benjamin Recht

On Chubanov's method for Linear Programming
Amitabh Basu, Jesus De Loera, Mark Junod

Single-Row Equidistant Facility Layout as a Special Case of Single-Row Facility Layout
Philipp Hungerländer

Parallel distributed-memory simplex for large-scale stochastic LP problems
Miles Lubin, J. A. Julian Hall, Cosmin G. Petra, Mihai Anitescu

ON AN EFFICIENT IMPLEMENTATION OF THE FACE ALGORITHM FOR LINEAR PROGRAMMING
Zhang Leihong, Yang Weihong, Liao Lizhi

Containment problems for polytopes and spectrahedra
Kai Kellner, Thorsten Theobald, Christian Trabandt

Nonlinear Optimization

Successive Convex Approximations to Cardinality-Constrained Quadratic Programs: A DC Approach
Xiaojin Zheng, Xiaoling Sun, Duan Li, Jie Sun

On a self-consistent-field-like iteration for maximizing the sum of the Rayleigh quotients
Zhang Leihong

Using Inexact Gradients in a Multilevel Optimization Algorithm
Michael Lewis, Stephen Nash

Stochastic Programming

The optimal harvesting problem under risk aversion
Bernardo Pagnoncelli, Adriana Piazza

Complexity of Bilevel Coherent Risk Programming
Jonathan Eckstein

Consistency of sample estimates of risk averse stochastic programs
Alexander Shapiro

Optimization with multivariate conditional value-at-risk constraints
Nilay Noyan, Gabor Rudolf

On the convergence of decomposition methods for multi-stage stochastic convex programs
P. Girardeau, A. B. Philpott

A Penalty Decomposition Method for Probabilistically Constrained Convex Programs
Xiaodi Bai, Jie Sun, Xiaojin Zheng, Xiaoling Sun

Other Topics

Moneyless strategy-proof mechanism on single-sinked policy domain: characterization and applications
Qiaoming Han, Donglei Du