All Areas Submissions - February 2019

Applications — OR and Management Sciences
Scheduling jobs with a V-shaped time-dependent processing time
Helmut Sedding

Applications — OR and Management Sciences
Chance-Constrained Bin Packing Problem with an Application to Operating Room Planning
Shanshan Wang, Jinlin Li, Sanjay Mehrotra

Complementarity and Variational Inequalities
An extragradient algorithm for quasimonotone variational inequalities
Ming Lei Yiran He

Convex and Nonsmooth Optimization
Active-set Newton methods and partial smoothness
Adrian Lewis, Calvin Wylie

Applications — Science and Engineering
A study of rank-one sets with linear side constraints and application to the pooling problem
Santanu S. Dey, Burak Kocuk, Asteroide Santana

Nonlinear Optimization
Quasi-Newton Methods for Deep Learning: Forget the Past, Just Sample
Albert S. Berahas, Majid Jahani, Martin Takáč

Stochastic Programming
Modeling Flexible Generator Operating Regions via Chance-constrained Stochastic Unit Commitment
Bismark Singh, Bernard Knueven, Jean-Paul Watson

Nonlinear Optimization
Inexact restoration with subsampled trust-region methods for finite-sum minimization
Stefania Bellavia, Natasa Krejic, Benedetta Morini

Convex and Nonsmooth Optimization
Subdifferentials and SNC property of scalarization functionals with uniform level sets and applications
Bao Truong, Christiane Tammer

Applications — Science and Engineering
Non-asymptotic Results for Langevin Monte Carlo: Coordinate-wise and Black-box Sampling
Lingqing Shen, Krishnakumar Balasubramanian, Saeed Ghadimi

Applications — Science and Engineering
A scalable mixed-integer decomposition approach for optimal power system restoration
Ignacio Aravena, Deepak Rajan, Georgios Patsakis, Shmuel Oren, Jennifer Rios

Linear, Cone and Semidefinite Programming
Exploiting Sparsity for Semi-Algebraic Set Volume Computation
Matteo Tacchi, Tillmann Weisser, Jean Bernard Lasserre, Didier Henrion

Integer Programming
Conflict-Driven Heuristics for Mixed Integer Programming
Jakob Witzig, Ambros Gleixner

Stochastic Programming
A generalized Benders decomposition-based branch and cut algorithm for two-stage stochastic programs with nonconvex constraints and mixed-binary first and second stage variables
Can Li, Ignacio Grossmann

Applications — Science and Engineering
Optimal Residential Battery Storage Operations Using Robust Data-driven Dynamic Programming
Nan Zhang, Benjamin Leibowicz, Grani Hanasusanto

Integer Programming
Improved Flow-based Formulations for the Skiving Stock Problem
John Martinovic, Maxence Delorme, Manuel Iori, Guntram Scheithauer, Nico Strasdat

Stochastic Programming
An Adaptive Sequential Sample Average Approximation Framework for Solving Two-stage Stochastic Programs
Raghu Pasupathy, Yongjia Song

Stochastic Programming
Single cut and multicut SDDP with cut selection for multistage stochastic linear programs: convergence proof and numerical experiments
Vincent Guigues, Michelle Bandarra

Integer Programming
Algorithms for the circle packing problem based on mixed-integer DC programming
Satoru Masuda, Yoshiko Ikebe, Takayuki Okuno

Combinatorial Optimization
Minimum Color-Degree Perfect b -Matchings
Mariia Anapolska, Christina Büsing, Martin Comis, Tabea Krabs

Other Topics
Identifying the Optimal Value Function of a Negative Markov Decision Process: An Integer Programming Approach
Amin Dehghanian

Convex and Nonsmooth Optimization
On Heuristics Based on ADMM and Douglas-Rachford Splitting to Minimize Convex Functions over Nonconvex Sets
Shuvomoy Das Gupta

Global Optimization
Tangencies and Polynomial Optimization
Tien-Son PHAM

Linear, Cone and Semidefinite Programming
Interior Point Method on Semi-definite Linear Complementarity Problems using the Nesterov-Todd (NT) Search Direction: Polynomial Complexity and Local Convergence
Chee Khian Sim

Applications — Science and Engineering
Recovery of a mixture of Gaussians by sum-of-norms clustering
Tao Jiang, Stephen Vavasis, Chen Wen Zhai

Applications — OR and Management Sciences
A branch and cut algorithm for the time-dependent profitable tour problem with resource constraints
Gonzalo Lera-Romero, Juan Jose Miranda Bront

Applications — OR and Management Sciences
A two-level distributed algorithm for general constrained nonconvex optimization with convergence guarantee
Kaizhao Sun, X. Andy Sun

Nonlinear Optimization
A two-level distributed algorithm for general constrained nonconvex optimization with global convergence
Kaizhao Sun, X. Andy Sun

Combinatorial Optimization
An (e/e-1)-approximation algorithm for the covering linear program with penalties
Yotaro Takazawa, Susumu Hashimoto, Mizuno Shinji

Applications — OR and Management Sciences
Optimizing the Recovery of Disrupted Multi-Echelon Assembly Supply Chain Networks
Huy Nguyen, Thomas Sharkey, John Mitchell, Al Wallace

Network Optimization
Dynamic Discretization Discovery Algorithms for Time-Dependent Shortest Path Problems
Edward He, Natashia Boland, George Nemhauser, Martin Savelsbergh

Network Optimization
Computational Complexity of Time-Dependent Shortest Path Problems
Edward He, Natashia Boland, George Nemhauser, Martin Savelsbergh

Nonlinear Optimization
Pathfollowing for Parametric Mathematical Programs with Complementarity Constraints
Vyacheslav Kungurtsev, Johannes Jaschke

Integer Programming
A Computational Comparison of Optimization Methods for the Golomb Ruler Problem
Burak Kocuk, Willem-Jan van Hoeve

Stochastic Programming
Risk-Averse Markov Decision Processes under Parameter Uncertainty with an Application to Slow-Onset Disaster Relief
Merve Merakli, Simge Kucukyavuz

Nonlinear Optimization
An optimal control theory for accelerated optimization
I Ross

Convex and Nonsmooth Optimization
Weak subgradient algorithm for solving nonsmooth nonconvex unconstrained optimization problems
Gulcin Dinc Yalcin, Refail Kasimbeyli

Convex and Nonsmooth Optimization
Fast and Faster Convergence of SGD for Over-Parameterized Models and an Accelerated Perceptron
Sharan Vaswani, Francis Bach, Mark Schmidt

Applications — Science and Engineering
A Framework for Peak Shaving Through the Coordination of Smart Homes
Michael David De Souza Dutra, Miguel F. Anjos, Sébastien Le Digabel

Linear, Cone and Semidefinite Programming
Logarithmic-barrier decomposition interior-point methods for stochastic linear optimization in a Hilbert space
Baha Alzalg, Akhtar Khan

Stochastic Programming
Robust sample average approximation with small sample sizes
E.J. Anderson, A.B. Philpott

Nonlinear Optimization
Minimization of nonsmooth nonconvex functions using inexact evaluations and its worst-case complexity
Serge Gratton, Ehouarn Simon, Philippe L. Toint

Nonlinear Optimization
High-Order Evaluation Complexity for Convexly-Constrained Optimization with Non-Lipschitzian Group Sparsity Terms
Xiaojun Chen, Philippe L. Toint

Integer Programming
Clairvoyant Restarts in Branch-and-Bound Search Using Online Tree-Size Estimation
Daniel Anderson, Gregor Hendel, Pierre Le Bodic, Merlin Viernickel

Integer Programming
Avoiding redundant columns by adding classical Benders cuts to column generation subproblems
Marco E. Luebbecke, Stephen J. Maher, Jonas T. Witt

Convex and Nonsmooth Optimization
Status Determination by Interior-Point Methods for Convex Optimization Problems in Domain-Driven Form
Mehdi Karimi, Levent Tuncel