All Areas Submissions - February 2016

Linear, Cone and Semidefinite Programming
Solving rank-constrained semidefinite programs in exact arithmetic
Simone Naldi

Robust Optimization
Min-max-min Robust Combinatorial Optimization Subject to Discrete Uncertainty
Christoph Buchheim, Jannis Kurtz

Convex and Nonsmooth Optimization
An Algorithmic Framework of Generalized Primal-Dual Hybrid Gradient Methods for Saddle Point Problems
Bingsheng He, Feng Ma, Xiaoming Yuan

Combinatorial Optimization
Exploiting Optimization for Local Graph Clustering
Fountoulakis Kimon, Cheng Xiang, Shun Julian, Roosta-Khorasani Farbod, Mahoney Michael

Complementarity and Variational Inequalities
Gap functions for quasi-equilibria
Giancarlo Bigi, Mauro Passacantando

Stochastic Programming
A Distributed Interior-Point KKT Solver for Multistage Stochastic Optimization
Hübner Jens, Schmidt Martin, Steinbach Marc C.

Stochastic Programming
An empirical analysis of scenario generation methods for stochastic optimization
Nils Löhndorf

Global Optimization
Global optimization of disjunctive programs
Peter Kirst, Fabian Rigterink, Oliver Stein

Network Optimization
An O(nm) time algorithm for finding the min length directed cycle in a graph
James Orlin, Antonio Sedeño-Noda

Infinite Dimensional Optimization
Strong Duality and Dual Pricing Properties in Semi-infinite Linear Programming--A Non-Fourier-Motzkin Elimination Approach
Qinghong Zhang

Nonlinear Optimization
On the convergence of stochastic bi-level gradient methods
Nicolas Couellan, Wenjuan Wang

Linear, Cone and Semidefinite Programming
Facial reduction heuristics and the motivational example of mixed-integer conic optimization
Henrik A. Friberg

Nonlinear Optimization
Gradient Descent only Converges to Minimizers
Jason D. Lee, Max Simchowitz, Michael I. Jordan, Benjamin Recht

Applications — OR and Management Sciences
City Logistics: Challenges and Opportunities
Martin Savelsbergh, Tom Van Woensel

Applications — OR and Management Sciences
Numerical Solution of Linear-Quadratic Optimal Control Problems for Switching System
Shahlar Meherrem, Deniz Hasan Gucoglu, Samir Guliyev

Robust Optimization
A dynamic programming approach for a class of robust optimization problems
Marcio Costa, Agostinho Agra, Michael Poss, Dritan Nace

Combinatorial Optimization
Robust scheduling with budgeted uncertainty
Marinb Bougeret, Artur Pessoa, Michael Poss

Integer Programming
Generation of Feasible Integer Solutions on a Massively Parallel Computer
Utku Koc, Sanjay Mehrotra

Convex and Nonsmooth Optimization
A Reduced-Space Algorithm for Minimizing $\ell_1$-Regularized Convex Functions
Tianyi Chen, Frank E. Curtis, Daniel P. Robinson

Nonlinear Optimization
A Dual Gradient-Projection Method for Large-Scale Strictly Convex Quadratic Problems
Nicholas I. M. Gould, Daniel P. Robinson

Convex and Nonsmooth Optimization
Iteration-complexity of a Rockafellar's proximal method of multipliers for convex programming based on second-order approximations
Maicon M. Alves, R. D. C. Monteiro, Benar F. Svaiter

Nonlinear Optimization
Hardness of Approximation for Sparse Optimization with L0 Norm
Yichen Chen, Mengdi Wang

Network Optimization
Risk Averse Shortest Path Interdiction
Yongjia Song, Siqian Shen

Convex and Nonsmooth Optimization
The Euclidean distance degree of orthogonally invariant matrix varieties
Dmitriy Drusvyatskiy, Hon-Leung Lee, Giorgio Ottaviani, Rekha R. Thomas

Convex and Nonsmooth Optimization
Error bounds, quadratic growth, and linear convergence of proximal methods
Dmitriy Drusvyatskiy, Adrian S. Lewis

Convex and Nonsmooth Optimization
Level-set methods for convex optimization
Aleksandr Y. Aravkin, James V. Burke, Dmitriy Drusvyatskiy, Michael P. Friedlander, Scott Roy

Convex and Nonsmooth Optimization
Approximations and Generalized Newton Methods
Diethard Klatte, Bernd Kummer

Combinatorial Optimization
A decomposition approach for single allocation hub location problems with multiple capacity levels
Borzou Rostami, Christopher Strothmann, Christoph Buchheim

Combinatorial Optimization
The Quadratic Shortest Path Problem: Complexity, Approximability, and Solution Methods
Borzou Rostami, André Chassein, Michael Hopf, Davide Frey, Christoph Buchheim, Federico Malucelli, Marc Goerigk

Integer Programming
Beating the SDP bound for the floor layout problem: A simple combinatorial idea
Joey Huchette, Santanu S. Dey, Juan Pablo Vielma

Integer Programming
Strong mixed-integer formulations for the floor layout problem
Joey Huchette, Santanu S. Dey, Juan Pablo Vielma

Applications — OR and Management Sciences
A joint routing and speed optimization problem
Ricardo Fukasawa, Qie He, Fernando Santos, Yongjia Song

Convex and Nonsmooth Optimization
Two-sided linear chance constraints and extensions
Miles Lubin, Juan Pablo Vielma, Daniel Bienstock

Linear, Cone and Semidefinite Programming
A robust Lagrangian-DNN method for a class of quadratic optimization problems
Naohiko Arima, Sunyoung Kim, Masakazu Kojima, Kim-Chuan Toh

Linear, Cone and Semidefinite Programming
On geometrical properties of preconditioners in IPMs for classes of block-angular problems
J. Castro, S. Nasini