Optimization Online Digest — February 2013
Applications — OR and Management Sciences
Decentralised Shared Resource Constraint Scheduling with Confidentiality Protection
Gaurav Singh, Christine O'Keefe
A bigbucket timeindexed formulation for nonpreemptive single machine scheduling problems
Natashia Boland, Riley Clement, Hamish Waterer
Composite Retrieval of Diverse and Complementary Bundles
Sihem AmerYahia, Francesco Bonchi, Carlos Castillo, Esteban Feuerstein, Isabel MéndezDíaz, Paula Zabala
Applications — Science and Engineering
GammaRobust Facility Relocation Problem
Gino Lim, Ayse Sonmez
Robust NearSeparable Nonnegative Matrix Factorization Using Linear Optimization
Nicolas Gillis, Robert Luce
Principle of optimal accuracy classification for metrological purposes
David Kisets
Combinatorial Optimization
Equivalence of an Approximate Linear Programming Bound with the HeldKarp Bound for the Traveling Salesman Problem
Alejandro Toriello
A NOTE ON THE EXTENSION COMPLEXITY OF THE KNAPSACK POLYTOPE
Sebastian Pokutta, Mathieu Van Vyve
Complementarity and Variational Inequalities
A New Error Bound Result for Generalized Nash Equilibrium Problems and its Algorithmic Application
Axel Dreves, Francisco Facchinei, Andreas Fischer, Markus Herrich
The sMonotone Index Selection Rule for CrissCross Algorithms of Linear Complementarity Problems
Csizmadia Zsolt, Illés Tibor, Nagy Adrienn
Convex and Nonsmooth Optimization
Bundle methods in depth: a unified analysis for inexact oracles
Welington Oliveira, Claudia Sagastizábal, Claude Lemaréchal
An Augmented Lagrangian Method for Conic Convex Programming
Necdet Serhat Aybat, Garud Iyengar
Global Optimization
Analytical formulas for calculating the extremal ranks and inertias of $A + BXB^{*}$ when $X$ is a fixedrank Hermitian matrix
Yongge Tian
Integer Programming
Intersection Cuts for Nonlinear Integer Programming: Convexification Techniques for Structured Sets
Sina Modaresi, Mustafa Kilinc, Juan Pablo Vielma
Traveling Salesman Problem Formulations with $N \log N$ Number of Binary Variables
Thomas A. Pogiatzis, Vassilios S. Vassiliadis, Raul Conejeros
A New Class of Valid Inequalities for Nonlinear Network Design Problems
Armin Fügenschuh, Jesco Humpola
On the Rank of CuttingPlane Proof Systems
Sebastian Pokutta, Andreas S. Schulz
Linear, Cone and Semidefinite Programming
Sparse Recovery on Euclidean Jordan Algebras
Lingchen Kong, Jie Sun, Jiyuan Tao, Naihua Xiu
Extension of Completely Positive Cone Relaxation to Polynomial Optimization
Naohiko Arima, Sunyoung Kim, Masakazu Kojima
Novel update techniques for the revised simplex method
Qi Huangfu, J. A. Julian Hall
Positive Semidefinite Matrix Completion, Universal Rigidity and the Strong Arnold Property
Monique Laurent, Antonios Varvitsiotis
The Trust Region Subproblem with NonIntersecting Linear Constraints
Samuel Burer, Boshi Yang
Nonlinear Optimization
Abstract Newtonian Frameworks and Their Applications
A.F. Izmailov, A.S. Kurennoy
Attraction of Newton method to critical Lagrange multipliers: fully quadratic case
A.F. Izmailov, E.I. Uskov
Strong local convergence properties of adaptive regularized methods for nonlinear leastsquares
Stefania Bellavia, Benedetta Morini
On the connection between the conjugate gradient method and quasiNewton methods on quadratic problems
Anders Forsgren, Tove Odland
An interior point method with a primaldual quadratic barrier penalty function for nonlinear semidefinite programming
Atsushi Kato, Hiroshi Yabe, Hiroshi Yamashita
A class of derivativefree nonmonotone optimization algorithms employing coordinate rotations and gradient approximations
Luigi Grippo, Francesco Rinaldi
A generalization of the LownerJohn's ellipsoid theorem
Jean B Lasserre
Optimization Software and Modeling Systems
Computational aspects of simplex and MBUsimplex algorithms using different anticycling pivot rules
Illés Tibor, Nagy Adrienn
A framework for automated PDEconstrained optimisation
S. W. Funke, P. E. Farrell
Robust Optimization
Distributionally Robust Convex Optimization
Wolfram Wiesemann, Daniel Kuhn, Melvyn Sim
Robust combinatorial optimization with cost uncertainty
Michael Poss
Stochastic Programming
RiskAverse Stochastic Dual Dynamic Programming
Václav Kozmík, David P. Morton
Other Topics
Lot Sizing with Piecewise Concave Production Costs
Esra Koca, Hande Yaman, M. Selim Akturk
Optimal Power Grid Protection through A DefenderAttackerDefender Model
Wei Yuan, Long Zhao, Bo Zeng
