Optimization Online


Optimization Online Digest — September 2020

Applications — OR and Management Sciences

Solving the Time Dependent Minimum Tour Duration and Delivery Man Problems with Dynamic Discretization Discovery
Duc Minh Vu, Mike Hewitt, Duc D. Vu

Randomized Assortment Optimization
Zhengchao Wang, Heikki Peura, Wolfram Wiesemann

A Stochastic Programming Model with Endogenous Uncertainty for Supplier Risk Mitigation in Low-volume, high-value Manufacturing
Rui Zhou, Tanveer Hossain Bhuiyan, Hugh R. Medal , Michael D. Sherwin, Dong Yang

A Unified Approach to Solve Convex Hull Pricing and Average Incremental Cost Pricing
Yonghong Chen, Richard O'Neill, Pete Whitman

Adaptable Energy Management System for Smart Buildings
Ilaria Salerno, Miguel F. Anjos, Kenneth McKinnon, Juan A. Gomez-Herrera

A Branch-Cut-and-Price Algorithm for the Time-Dependent Electric Vehicle Routing Problem with Time Windows
Gonzalo Lera-Romero, Juan Jose Miranda-Bront, Soulignac Francisco

Bicriteria approaches for an optimal balance between resilience and cost-effectiveness of supply chains
Erik Diessel, Heiner Ackermann

Short-Term Inventory-Aware Equipment Management in Service Networks
Yassine Ridouane, Natashia Boland, Alan Erera, Martin Savelsbergh

Applications — Science and Engineering

Optimal Residential Users Coordination Via Demand Response: An Exact Distributed Framework
Michael David de Souza Dutra, Natalia Alguacil

Mixed-integer Linear Programming Models and Algorithms for Generation and Transmission Expansion Planning of Power Systems
Can Li, Antonio Conejo, Peng Liu, Benjamin Omell, John Siirola, Ignacio Grossmann

Distributionally Robust Facility Location with Bimodal Random Demand
Karmel S. Shehadeh , Ece Sanci

Global optimality in minimum compliance topology optimization of frames and shells by moment-sum-of-squares hierarchy
Marek Tyburec, Jan Zeman, Martin Kružík, Didier Henrion

Combinatorial Optimization

A Column Generation Based Heuristic for the Split Delivery Vehicle Routing Problem with Time Windows
Pedro Munari, Martin Savelsbergh

The Bipartite Boolean Quadric Polytope with Multiple-Choice Constraints
Andreas Bärmann, Alexander Martin, Oskar Schneider

Convex and Nonsmooth Optimization

On the linear convergence of the forward-backward splitting algorithm
Ba Khiet Le

Global Optimization

A Modified Simplex Partition Algorithm to Test Copositivity
Mohammadreza Safi, Seyed Saeed Nabavi, Richard J. Caron

Global Dynamic Optimization with Hammerstein-Wiener Models Embedded
C. D. Kappatou, D. Bongartz, J. Najman, S. Sass, A. Mitsos

Constrained global optimization of functions with low effective dimensionality using multiple random embeddings
Coralia Cartis, Estelle Massart, Adilet Otemissov

Integer Programming

Decomposition and Adaptive Sampling for Data-Driven Inverse Linear Optimization
Rishabh Gupta, Qi Zhang

Accelerating Domain Propagation: an Efficient GPU-Parallel Algorithm over Sparse Matrices
Boro Sofranac, Ambros Gleixner, Sebastian Pokutta

A Branch-and-Price Algorithm Enhanced by Decision Diagrams for the Kidney Exchange Problem
Lizeth Carolina Riascos-Alvarez, Merve Bodur, Dionne M. Aleman

Feasible rounding approaches for equality constrained mixed-integer optimization problems
Christoph Neumann, Oliver Stein

Linear, Cone and Semidefinite Programming

Dual optimal design and the Christoffel-Darboux polynomial
Yohann De Castro, Fabrice Gamboa, Didier Henrion, Jean Bernard Lasserre

SDP-based bounds for the Quadratic Cycle Cover Problem via cutting plane augmented Lagrangian methods and reinforcement learning
Frank de Meijer, Renata Sotirov

Naive constant rank-type constraint qualifications for multifold second-order cone programming and semidefinite programming
R. Andreani, G. Haeser, L.M. Mito, H. Ramirez, D.O. Santos, T.P. Silveira

Strong duality and boundedness in conic optimization
Temitayo Ajayi, Akshay Gupte, Amin Khademi, Andrew Schaefer

Stokes, Gibbs and volume computation of semi-algebraic sets
Matteo Tacchi, Jean Bernard Lasserre, Didier Henrion

Strengthened SDP Relaxation for an Extended Trust Region Subproblem with an Application to Optimal Power Flow
Anders Eltved, Samuel Burer

Network Optimization

The Non-Stop Disjoint Trajectories Problem
Benno Hoch, Frauke Liers, Sarah Neumann, Francisco Javier Zaragoza Martínez

Nonlinear Optimization

Limited-memory Common-directions Method for Large-scale Optimization: Convergence, Parallelization, and Distributed Optimization
Ching-pei Lee, Po-Wei Wang, Chih-Jen Lin

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

Stochastic Multi-level Composition Optimization Algorithms with Level-Independent Convergence Rates
Krishnakumar Balasubramanian, Saeed Ghadimi, Anthony Nguyen

Line search in noisy unconstrained black box optimization
Morteza Kimiaei

Dual Randomized Coordinate Descent Method for Solving a Class of Nonconvex Problems
Amir Beck, Marc Teboulle

Largest small polygons: A sequential convex optimization approach
Christian Bingane

Inexact Variable Metric Method for Convex-Constrained Optimization Problems
Douglas Goncalves, Max Goncalves, Tiago Menezes

An assessment of Direct MultiSearch when enriched with first-order information for multiobjective optimization
R. Andreani, A. L. Custódio, M. Raydan

Regret Minimization in Stochastic Non-Convex Learning via a Proximal-Gradient Approach
Nadav Hallak, Panayotis Mertikopoulos, Volkan Cevher

Economic inexact restoration for derivative-free expensive function minimization and applications
Ernesto G. Birgin, Natasa Krejic, José Mario Martínez

Spectral Residual Method for Nonlinear Equations on Riemannian Manifolds
Harry Oviedo, Hugo Lara

Mixed-Projection Conic Optimization: A New Paradigm for Modeling Rank Constraints
Dimitris Bertsimas, Ryan Cory-Wright, Jean Pauphilet

A family of optimal weighted conjugate-gradient-type methods for strictly convex quadratic minimization
Harry Oviedo, Roberto Andreani, Marcos Raydan

Robust Optimization

Finite-Sample Guarantees for Wasserstein Distributionally Robust Optimization: Breaking the Curse of Dimensionality
Rui Gao

Stochastic Programming

Are Weaker Stationarity Concepts of Stochastic MPCC Problems Significant in Absence of SMPCC-LICQ?
Arnab Sur

Distributionally Robust Two-Stage Stochastic Programming
Daniel Duque, Sanjay Mehrotra, David P. Morton

Other Topics

Efficiently computing the approximation quality of Pareto frontiers
Erik Diessel

  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