Optimization Online


Optimization Online Digest — December 2020

Applications — OR and Management Sciences

Select, Route and Schedule: Optimizing Community Paramedicine Service Delivery with Mandatory Visits and Patient Prioritization
Shima Azizi, Brenton Faber, Sharon Johnson, Renata Konrad, Andrew C. Trapp

An exact solution approach for an electric bus dispatch problem
Matías Alvo, Gustavo Angulo, Mathias A. Klapp

Stochastic RWA and Lightpath Rerouting in WDM Networks
Maryam Daryalal, Merve Bodur

Planar Maximum Coverage Location Problem with Partial Coverage, Continuous Spatial Demand, and Adjustable Quality of Service
Manish Bansal, Parshin Shojaee

An exact (re)optimization framework for real-time traffic management
Giorgio Sartor, Carlo Mannino

Fleet Sizing and Service Region Partitioning for Same-Day Delivery Systems
Dipayan Banerjee, Alan Erera, Alejandro Toriello

Applications — Science and Engineering

Algorithms for Block Tridiagonal Systems: Foundations and New Results for Generalized Kalman Smoothing
Aleksandr Aravkin, Bradley Bell, James Burke, Gianluigi Pillonetto

Unbiased Subdata Selection for Fair Classification: A Unified Framework and Scalable Algorithms
Qing Ye, Weijun Xie

Combinatorial Optimization

Planar Maximum Coverage Location Problem with Partial Coverage, Continuous Spatial Demand, and Adjustable Quality of Service
Manish Bansal, Parshin Shojaee

A new branch-and-filter exact algorithm for binary constraint satisfaction problems
Pablo San Segundo, Fabio Furini, Rafael León

Complementarity and Variational Inequalities

Stability Analysis of Discrete-Time Linear Complementarity Systems
Arvind Raghunathan, Jeff Linderoth

Convex and Nonsmooth Optimization

On the Iterate Convergence and Manifold Identification of Inexact Proximal-Newton-Type Methods Under a Sharpness Condition
Ching-pei Lee

Moreau envelope of supremum functions with applications to infinite and stochastic programming
Pedro Pérez-Aros, Emilio Vilches

A Structure Exploiting Algorithm for Non-Smooth Semi-Linear Elliptic Optimal Control Problems
Olga Weiß, Andrea Walther, Stephan Schmidt

Polyhedral Separation via Difference of Convex (DC) Programming
Annabella Astorino, Massimo Di Francesco, Manlio Gaudioso, Enrico Gorgone, Benedetto Manca

On Hölder Calmness of Minimizing Sets
Diethard Klatte, Bernd Kummer

Some Modified Fast Iteration Shrinkage Thresholding Algorithms with a New Adaptive Non-monotone Stepsize Strategy for Nonsmooth and Convex Minimization Problems
Liu Hongwei, Wang Ting, Liu Zexian

Global Optimization

An Exact Projection-Based Algorithm for Bilevel Mixed-Integer Problems with Nonlinearities
Maximilian Merkert, Galina Orlinskaya, Dieter Weninger

Integer Programming

Convex Hulls of Symmetric Multilinear Polynomials over Box Constraints
Yibo Xu, Warren Adams, Akshay Gupte

On the Integrality Gap of Binary Integer Programs with Gaussian Data
Sander Borst, Daniel Dadush, Sophie Huiberts, Samarth Tiwari

Arc-Item Based Formulations for the Cumulative Vehicle Routing Problem
Mauro Henrique Mulati, Ricardo Fukasawa, Flávio Keidi Miyazawa

Learning To Scale Mixed-Integer Programs
Timo Berthold, Gregor Hendel

Supermodularity and valid inequalities for quadratic optimization with indicators
Alper Atamturk, Andres Gomez

Conic Mixed-Binary Sets: Convex Hull Characterizations and Applications
Fatma Kılınç-Karzan, Simge Küçükyavuz, Dabeen Lee

A Survey on Mixed-Integer Programming Techniques in Bilevel Optimization
Thomas Kleinert, Martine Labbé, Ivana Ljubić, Martin Schmidt

Linear, Cone and Semidefinite Programming

A New Dual Face Algorithm Using LU Factorization for Linear Programming
Ping-Qi Pan

Error bounds, facial residual functions and applications to the exponential cone
Scott B. Lindstrom, Bruno F. Lourenco, Ting Kei Pong

Weak notions of nondegeneracy in nonlinear semidefinite programming
Roberto Andreani, Gabriel Haeser, Leonardo M. Mito, Héctor Ramírez

Network Optimization

Commodity Prioritized Maximum Dynamic Multi-Commodity Flow Problem
Tanka Nath Dhamala, Durga Prasad Khanal, Urmila Pyakurel

Nonlinear Optimization

On the Linear Convergence to Weak/Standard D-stationary Points of DCA-based Algorithms for Structured Nonsmooth DC Programming
Dong Hongbo , Tao Min

A Distributed and Secure Algorithm for Computing Dominant SVD Based on Projection Splitting
Lei Wang, Xin Liu, Yin Zhang

A Riemannian Block Coordinate Descent Method for Computing the Projection Robust Wasserstein Distance
Minhui Huang, Shiqian Ma, Lifeng Lai

On complexity and convergence of high-order coordinate descent algorithms
V. S. Amaral, R. Andreani, E. G. Birgin, D. S. Marcondes, J. M. Martínez

ADMM and inexact ALM: the QP case
Stefano Cipolla, Jacek Gondzio

Secant acceleration of sequential residual methods for solving large-scale nonlinear systems of equations
Ernesto G. Birgin, J. M. Martínez

The Landscape of the Proximal Point Method for Nonconvex-Nonconcave Minimax Optimization
Benjamin Grimmer, Haihao Lu, Pratik Worah, Vahab Mirrokni

Constrained and Composite Optimization via Adaptive Sampling Methods
Yuchen Xie, Raghu Bollapragada, Richard Byrd, Jorge Nocedal

Graph topology invariant gradient and sampling complexity for decentralized and stochastic optimization
Guanghui Lan, Yuyuan Ouyang, Yi Zhou

Robust Optimization

Pareto Adaptive Robust Optimality via a Fourier-Motzkin Elimination Lens
Dimitris Bertsimas, Stefan ten Eikelder, Dick den Hertog, Nikolaos Trichakis

Kernel Distributionally Robust Optimization
Jia-Jie Zhu, Wittawat Jitkrittum, Bernhard Schölkopf, Moritz Diehl

Data-Driven Optimization with Distributionally Robust Second-Order Stochastic Dominance Constraints
Chun Peng, Erick Delage

Stochastic Programming

ALSO-X is Better Than CVaR: Convex Approximations for Chance Constrained Programs Revisited
Nan Jiang, Weijun Xie

A converging Benders’ decomposition algorithm for two-stage mixed-integer recourse models
Niels van der Laan, Ward Romeijnders

Other Topics

A dynamic programming approach to segmented isotonic regression
Victor Bucarey, Martine Labbé, Juan M. Morales, Salvador Pineda

Branch-and-bound and objective branching with three objectives
Nicolas Forget, Kathrin Klamroth, Sune Lauth Gadegaard, Anthony Przybylski, Lars Relund Nielsen

Twenty Years of Continuous Multiobjective Optimization
Gabriele Eichfelder

The follower optimality cuts for mixed-integer linear bilevel programming problems
Sara Mattia

  Visitors Authors More about us Links
  Subscribe, Unsubscribe
Digest Archive
Search, Browse the Repository


Coordinator's Board
Classification Scheme
Give us feedback
Optimization Journals, Sites, Societies
Mathematical Optimization Society