Optimization Online Digest — June 2007

Applications — OR and Management Sciences

Satisficing measures for analysis of risky positions
David B. Brown, Melvyn Sim

A MIP Approach for some Practical Packing Problems: Balancing Constraints and Tetris-like Items
giorgio fasano

MIP-based heuristic for non-standard 3D-packing problems
Giorgio Fasano

A new lower bound for one-machine earliness-tardiness scheduling
Francis Sourd

Partition Inequalities for Capacitated Survivable Network Design Based on Directed P-Cycles
Alper Atamturk, Deepak Rajan

An O(n^2) Algorithm for Lot Sizing with Inventory Bounds and Fixed Costs
Alper Atamturk, Simge Kucukyavuz

Applications — Science and Engineering

Graph Modeling for Quadratic Assignment Problem Associated with the Hypercube
jiming peng, Hans Mittelmann, Xiaolin Wu

Gradient Projection for Sparse Reconstruction: Application to Compressed Sensing and Other Inverse Problems
M. A. T. Figueiredo, R. D. Nowak, S. J. Wright

Combinatorial Optimization

On the strength of cut-based inequalities for capacitated network design polyhedra
Christian Raack, Arie M.C.A. Koster, Roland Wessäly

Expressing Combinatorial Optimization Problems by Systems of Polynomial Equations and the Nullstellensatz
Jesus De Loera, Jon Lee, Susan Margulies, Shmuel Onn

Minimum weight t-composition of an integer
Domingos M. Cardoso, J. Orestes Cerdeira

Tractable algorithms for chance-constrained combinatorial problems
Olivier Klopfenstein

New Lower Bounds on the Stability Number of a Graph
E. Alper YILDIRIM

Complementarity and Variational Inequalities

An Algorithm for the Fast Solution of Linear Complementarity Problems
Jose Luis Morales, Jorge Nocedal, Mikhail Smelyanskiy

An iterative approach for cone complementarity problems for nonsmooth multibody dynamics
Mihai Anitescu, Alessandro Tasora

Convex and Nonsmooth Optimization

Necessary optimality condition for Nonsmooth Switching Control problem
Shahlar Maharramov

Guaranteed Minimum-Rank Solutions of Linear Matrix Equations via Nuclear Norm Minimization
Benjamin Recht, Maryam Fazel, Pablo A. Parrilo

Smooth Optimization Approach for Covariance Selection
Zhaosong Lu

Global Optimization

Max-min separability: incremental approach and application to supervised data classification
Adil M Bagirov, Dean Webb, Bulent Karasozen

Integer Programming

Separation Algorithms for 0-1 Knapsack Polytopes
Konstantinos Kaparis, Adam Letchford

Improving a Formulation of the Quadratic Knapsack Problem
Daniel Grainger, Adam Letchford

Conic Mixed-Integer Rounding Cuts
Alper Atamturk, Vishnu Narayanan

A strong conic quadratic reformulation for machine-job assignment with controllable processing times
M. Selim Akturk, Alper Atamturk, Sinan Gurel

The Flow Set with Partial Order
Alper Atamturk, Muhong Zhang

Column basis reduction and decomposable knapsack problems
Bala Krishnamoorthy, Gabor Pataki

Linear, Cone and Semidefinite Programming

Exploiting group symmetry in semidefinite programming relaxations of the quadratic assignment problem
Etienne De Klerk, Renata Sotirov

Semidefinite Representation of Convex Sets
J. William Helton, Jiawang Nie

Symmetry in semidefinite programs
Frank Vallentin

Nonlinear Optimization

An implicit trust-region method on Riemannian manifolds
C. G. Baker, P.-A. Absil, K. A. Gallivan

A view of algorithms for optimization without derivatives
M.J.D. Powell

Convergence Analysis of an Interior-Point Method for Nonconvex Nonlinear Programming
Hande Y. Benson, Arun Sen, David F. Shanno

Developments of NEWUOA for unconstrained minimization without derivatives
M.J.D. Powell

A globally convergent trust-region SQP method without a penalty function for nonlinearly constrained optimization
Hiroshi Yamashita, Hiroshi Yabe

A primal-dual interior point method for nonlinear semidefinite programming
Hiroshi Yamashita, Hiroshi Yabe, Kouhei Harada

Robust Optimization

Explicit reformulations for robust optimization problems with general uncertainty sets
Igor Averbakh, Yun-Bin Zhao