

Optimization Online Digest — February 2019
Applications — OR and Management Sciences
A branch and cut algorithm for the timedependent profitable tour problem with resource constraints
Gonzalo LeraRomero, Juan Jose Miranda Bront
Optimizing the Recovery of Disrupted MultiEchelon Assembly Supply Chain Networks
Huy Nguyen, Thomas Sharkey, John Mitchell, Al Wallace
Applications — Science and Engineering
A study of rankone sets with linear side constraints and application to the pooling problem
Santanu S. Dey, Burak Kocuk, Asteroide Santana
Nonasymptotic Results for Langevin Monte Carlo: Coordinatewise and Blackbox Sampling
Lingqing Shen, Krishnakumar Balasubramanian, Saeed Ghadimi
A scalable mixedinteger decomposition approach for optimal power system restoration
Ignacio Aravena, Deepak Rajan, Georgios Patsakis, Shmuel Oren, Jennifer Rios
Optimal Residential Battery Storage Operations Using Robust Datadriven Dynamic Programming
Nan Zhang, Benjamin Leibowicz, Grani Hanasusanto
Recovery of a mixture of Gaussians by sumofnorms clustering
Tao Jiang, Stephen Vavasis, Chen Wen Zhai
Combinatorial Optimization
Minimum ColorDegree Perfect b Matchings
Mariia Anapolska, Christina Büsing, Martin Comis, Tabea Krabs
Convex and Nonsmooth Optimization
Activeset Newton methods and partial smoothness
Adrian Lewis, Calvin Wylie
Subdifferentials and SNC property of scalarization functionals with uniform level sets and applications
Bao Truong, Christiane Tammer
On Heuristics Based on ADMM and DouglasRachford Splitting to Minimize Convex Functions over Nonconvex Sets
Shuvomoy Das Gupta
Weak subgradient algorithm for solving nonsmooth nonconvex unconstrained optimization problems
Gulcin Dinc Yalcin, Refail Kasimbeyli
Fast and Faster Convergence of SGD for OverParameterized Models and an Accelerated Perceptron
Sharan Vaswani, Francis Bach, Mark Schmidt
Status Determination by InteriorPoint Methods for Convex Optimization Problems in DomainDriven Form
Mehdi Karimi, Levent Tuncel
Generalized conditional subgradient and generalized mirror descent: duality, convergence, and symmetry
Javier Pena
Global Optimization
Tangencies and Polynomial Optimization
TienSon PHAM
Integer Programming
ConflictDriven Heuristics for Mixed Integer Programming
Jakob Witzig, Ambros Gleixner
Improved Flowbased Formulations for the Skiving Stock Problem
John Martinovic, Maxence Delorme, Manuel Iori, Guntram Scheithauer, Nico Strasdat
Algorithms for the circle packing problem based on mixedinteger DC programming
Satoru Masuda, Yoshiko Ikebe, Takayuki Okuno
A Computational Comparison of Optimization Methods for the Golomb Ruler Problem
Burak Kocuk, WillemJan van Hoeve
Clairvoyant Restarts in BranchandBound Search Using Online TreeSize Estimation
Daniel Anderson, Gregor Hendel, Pierre Le Bodic, Merlin Viernickel
Avoiding redundant columns by adding classical Benders cuts to column generation subproblems
Marco E. Luebbecke, Stephen J. Maher, Jonas T. Witt
A switching cost aware rounding method for relaxations of mixedinteger optimal control problems
Felix Bestehorn, Christoph Hansknecht, Christian Kirches, Paul Manns
Linear, Cone and Semidefinite Programming
Exploiting Sparsity for SemiAlgebraic Set Volume Computation
Matteo Tacchi, Tillmann Weisser, Jean Bernard Lasserre, Didier Henrion
Interior Point Method on Semidefinite Linear Complementarity Problems using the NesterovTodd (NT) Search Direction: Polynomial Complexity and Local Convergence
Chee Khian Sim
Logarithmicbarrier decomposition interiorpoint methods for stochastic linear optimization in a Hilbert space
Baha Alzalg, Akhtar Khan
Network Optimization
Dynamic Discretization Discovery Algorithms for TimeDependent Shortest Path Problems
Edward He, Natashia Boland, George Nemhauser, Martin Savelsbergh
Computational Complexity of TimeDependent Shortest Path Problems
Edward He, Natashia Boland, George Nemhauser, Martin Savelsbergh
Minimizing travelled time in timedependent networks with waiting
Jérémy Omer, Michael Poss
Nonlinear Optimization
QuasiNewton Methods for Deep Learning: Forget the Past, Just Sample
Albert S. Berahas, Majid Jahani, Martin Takáč
Inexact restoration with subsampled trustregion methods for finitesum minimization
Stefania Bellavia, Natasa Krejic, Benedetta Morini
A twolevel distributed algorithm for general constrained nonconvex optimization with global convergence
Kaizhao Sun, X. Andy Sun
Pathfollowing for Parametric Mathematical Programs with Complementarity Constraints
Vyacheslav Kungurtsev, Johannes Jaschke
An optimal control theory for accelerated optimization
I Ross
Minimization of nonsmooth nonconvex functions using inexact evaluations and its worstcase complexity
Serge Gratton, Ehouarn Simon, Philippe L. Toint
HighOrder Evaluation Complexity for ConvexlyConstrained Optimization with NonLipschitzian Group Sparsity Terms
Xiaojun Chen, Philippe L. Toint
Stochastic Programming
Modeling Flexible Generator Operating Regions via Chanceconstrained Stochastic Unit Commitment
Bismark Singh, Bernard Knueven, JeanPaul Watson
A generalized Benders decompositionbased branch and cut algorithm for twostage stochastic programs with nonconvex constraints and mixedbinary first and second stage variables
Can Li, Ignacio Grossmann
An Adaptive Sequential Sample Average Approximation Framework for Solving Twostage Stochastic Programs
Raghu Pasupathy, Yongjia Song
Single cut and multicut SDDP with cut selection for multistage stochastic linear programs: convergence proof and numerical experiments
Vincent Guigues, Michelle Bandarra
RiskAverse Markov Decision Processes under Parameter Uncertainty with an Application to SlowOnset Disaster Relief
Merve Merakli, Simge Kucukyavuz
Robust sample average approximation with small sample sizes
E.J. Anderson, A.B. Philpott
Multiscale stochastic programming
Martin Glanzer, Georg Ch. Pflug
Other Topics
Identifying the Optimal Value Function of a Negative Markov Decision Process: An Integer Programming Approach
Amin Dehghanian
