Optimization Online


Optimization Online Digest — November 2018

Applications — OR and Management Sciences

Geometric insights and proofs on optimal inventory control policies
ND van Foreest, OA Kilic

On Mixed Integer Programming Formulations for the Unit Commitment Problem
Bernard Knueven, Jim Ostrowski, Jean Paul Watson

A new binary programming formulation and social choice property for expediting the solution to Kemeny ranking aggregation
Yeawon Yoo, Adolfo Escobedo

A Dynamic Mobile Production Capacity and Inventory Control Problem
Satya S. Malladi, Alan L. Erera, Chelsea C. White III

Multi-component Maintenance Optimization: A Stochastic Programming Approach
Zhicheng Zhu, Yisha Xiang, Bo Zeng

The Impact of Potential-Based Physics Models on Pricing in Energy Networks
Lars Schewe, Martin Schmidt

Enhancement on the Improved Recursive Method for Multi-objective Integer Programming Problem
Masar Al-Rabeeah, Ali Al-Hasani, Andrew Eberhard, Santosh Kumar, Elias Munapo

The Benefits of Transfers in Crowdsourced Pickup-and-Delivery Systems
Afonso Sampaio, Martin Savelsbergh, Lucas Veelenturf, Tom Van Woensel

Multi-step discrete-time Zhang neural networks with application to time-varying nonlinear optimization
Sun Min, Tian Maoying, Wang Yiju

Applications — Science and Engineering

Nonmonotonicity and Quasiconvexity on Equilibrium Problems
Lennin Lennin Mallma R

A Unified Framework for Sparse Relaxed Regularized Regression: SR3
Peng Zheng, Travis Askham, Steve Brunton, Nathan Kutz, Aleksandr Aravkin

Energy and Reserve Dispatch with Distributionally Robust Joint Chance Constraints
Christos Ordoudis, Viet Anh Nguyen, Daniel Kuhn, Pierre Pinson

Combinatorial Optimization

On the use of the simplex method for a type of allocation problems
Yoshihiro Tanaka

A fast exact algorithm for discrete resource allocation with nested constraints
Zeyang Wu, Qie He, Kameng Nip

A Tutorial on Formulating QUBO Models
Fred Glover, Gary Kochenberger

Convex and Nonsmooth Optimization

Stochastic Primal-Dual Method for Empirical Risk Minimization with O(1) Per-Iteration Complexity
Conghui Tan, Tong Zhang, Shiqian Ma, Ji Liu

Gradient methods exploiting spectral properties
Yakui Huang, Yu-Hong Dai, Xin-Wei Liu

A new splitting method for monotone inclusions of three operators
dong yunda, yu xiaohuan

A gradient type algorithm with backward inertial steps for a nonconvex minimization
Szilard Csaba Laszlo, Adrian Viorel, Cristian Alecsa

Acceleration of Primal-Dual Methods by Preconditioning and Fixed Number of Inner Loops
Yanli Liu, Yunbei Xu, Wotao Yin

A Doubly Accelerated Inexact Proximal Point Method for Nonconvex Composite Optimization Problems
Jiaming Liang, Renato Monteiro

Global Optimization

Deterministic upper bounds in global minimization with nonlinear equality constraints
Christian Füllner, Peter Kirst, Oliver Stein

Feature selection in SVM via polyhedral k-norm
Manlio Gaudioso, Enrico Gorgone, Jean-Baptiste Hiriart-Urruty

On local non-global minimizers of quadratic optimization problem with a single quadratic constraint
Akram Taati, Maziar Salahi

Selecting cutting planes for quadratic semidefinite outer-approximation via trained neural networks
Radu Baltean-Lugojan, Pierre Bonami, Ruth Misener, Andrea Tramontani

Packing Ovals In Optimized Regular Polygons
F.J. Kampas, J.D. Pintér, I. Castillo

Largest Small n-Polygons: Numerical Results and Optimum Estimates
Janos Pinter

Integer Programming

Improving the heuristic performance of Benders' decomposition
Stephen Maher

n-step cutset inequalities: facets for multi-module capacitated network design problem
Haochen Luo, Kiavash Kianfar

Pattern-based models and a cooperative parallel metaheuristic for high school timetabling problems
Landir Saviniec, Maristela O. Santos, Alysson M. Costa, Lana M. R. Santos

Strong convex relaxations and mixed-integer programming formulations for trained neural networks
Ross Anderson, Joey Huchette, Christian Tjandraatmadja, Juan Pablo Vielma

Strong Mixed-Integer Formulations for Power System Islanding and Restoration
Georgios Patsakis, Deepak Rajan, Ignacio Aravena, Shmuel Oren

Submodularity and valid inequalities in nonlinear optimization with indicator variables
Andres Gomez

Equivariant Perturbation in Gomory and Johnson's Infinite Group Problem. VII. Inverse semigroup theory, closures, decomposition of perturbations
Robert Hildebrand, Matthias Köppe, Yuan Zhou

A branch and price algorithm for the resource constrained home health care vehicle routing problem
Neda Tanoumand, Tonguç Ünlüyurt

Compact Disjunctive Approximations to Nonconvex Quadratically Constrained Programs
Hongbo Dong, Yunqi Luo

Strong IP Formulations Need Large Coefficients
Christopher Hojny

Chvatal rank in binary polynomial optimization
Alberto Del Pia, Silvia Di Gregorio

A random search method for finding ‘K ≥ 2’ number of ranked optimal solution to an assignment problem
Santosh Kumar, Ali Al-Hasani, Masar Al-Rabeeah, Andrew Eberhard

Generating feasible points for mixed-integer convex optimization problems by inner parallel cuts
Christoph Neumann, Oliver Stein

Sparse and Smooth Signal Estimation: Convexification of L0 Formulations
Alper Atamturk, Andres Gomez, Shaoning Han

Linear, Cone and Semidefinite Programming

A survey of semidefinite programming approaches to the generalized problem of moments and their error analysis
Etienne De Klerk, Monique Laurent

A specialized interior-point algorithm for huge minimum convex cost flows in bipartite networks
Jordi Castro, Stefano Nasini

Nonlinear Optimization

Proximal Gradient Method for Manifold Optimization
Shixiang Chen, Shiqian Ma, Anthony Man-Cho So, Tong Zhang

Sharp worst-case evaluation complexity bounds for arbitrary-order nonconvex optimization with inexpensive constraints
Coralia Cartis, Nick I. M. Gould, Philippe L. Toint

Inexact alternating projections on nonconvex sets
Dmitriy Drusvyatskiy, Adrian S. Lewis

Deterministic and stochastic inexact regularization algorithms for nonconvex optimization with optimal complexity
Stefania Bellavia, Gianmarco Gurioli, Benedetta Morini, Philippe L. Toint

A class of derivative-free CG projection methods for nonsmooth equations with an application to the LASSO problem
min sun, maoying tian

A globally and linearly convergent PGM for zero-norm regularized quadratic optimization with sphere constraint
Wu Yuqia, Pan Shaohua, Bi Shujun

On the complexity of solving feasibility problems
L. F. Bueno, J. M. Martínez

Over-Parameterized Deep Neural Networks Have No Strict Local Minima For Any Continuous Activations
Dawei Li, Tian Ding, Ruoyu Sun

A New Sequential Optimality Condition for Constrained Nonsmooth Optimization
Elias S. Helou, Sandra A. Santos, Lucas E. A. Simőes

Basis Pursuit Denoise with Nonsmooth Constraints
Robert Baraldi, Rajiv Kumar, Aleksandr Aravkin

An almost cyclic 2-coordinate descent method for singly linearly constrained problems
Andrea Cristofari

Robust Optimization

A Data-Driven Approach for Multi-Stage Linear Optimization
Dimitris Bertsimas, Shimrit Shtern, Bradley Sturt

A Distributionally Robust Analysis of PERT
Ernst Roos, Dick den Hertog

An Algorithmic Approach to Multiobjective Optimization with Decision Uncertainty
Gabriele Eichfelder, Julia Niebling, Stefan Rocktäschel

Robust Data-Driven Vehicle Routing with Time Windows
Yu Zhang, Zhenzhen Zhang, Andrew Lim, Melvyn Sim

Stochastic Programming

The policy graph decomposition of multistage stochastic optimization problems
Oscar Dowson

Parallelizing Subgradient Methods for the Lagrangian Dual in Stochastic Mixed-Integer Programming
Cong Han Lim, Jeff Linderoth, James Luedtke, Stephen Wright

Other Topics

On the extension of the Hager-Zhang conjugate gradient method for vector optimization
M. L. N. Gonçalves, L. F. Prudente

Decomposition Methods for Solving Multi-model Markov Decision Processes
Lauren Steimle, Vinayak Ahluwalia, Charmee Kamdar, Brian Denton

  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