We study the problem of optimizing an arbitrary weight function w’z over the metric polytope of a graph G=(V,E), a well-known relaxation of the cut polytope. We define the signed graph (G, E^-), where E^- consists of the edges of G having negative weight. We characterize the sign patterns of the weight vector w such … Read more
In recent papers, we have shown that a Lebesgue-Stieltjes optimal control theory forms the foundations for unscented optimal control. In this paper, we further our results by incorporating uncertain mixed state-control constraints in the problem formulation. We show that the integrated Hamiltonian minimization condition resembles a semi-infinite type mathematical programming problem. The resulting computational difficulties … Read more
We present a parallel large neighborhood search framework for finding high quality primal solutions for generic Mixed Integer Programs (MIPs). The approach simultaneously solves a large number of sub-MIPs with the dual objective of reducing infeasibility and optimizing with respect to the original objective. Both goals are achieved by solving restricted versions of two auxiliary … Read more
In this paper, we propose a multi-step inertial Forward–Backward splitting algorithm for minimizing the sum of two non-necessarily convex functions, one of which is proper lower semi-continuous while the other is differentiable with a Lipschitz continuous gradient. We first prove global convergence of the scheme with the help of the Kurdyka-Lojasiewicz property. Then, when the … Read more
The Douglas–Rachford (DR) and alternating direction method of multipliers (ADMM) are two proximal splitting algorithms designed to minimize the sum of two proper lower semi-continuous convex functions whose proximity operators are easy to compute. The goal of this work is to understand the local linear convergence behaviour of DR/ADMM when the involved functions are moreover … Read more
We consider semidefinite optimization problems that include constraints that G(x) and H(x) are positive semidefinite (PSD), where the components of the symmetric matrices G(x) and H(x) are affine functions of an n-vector x. In such a case we obtain a new constraint that a matrix K(x,X) is PSD, where the components of K(x,X) are affine … Read more
We consider the general problem of industrial production in a set of countries subject to a common environmental regulation that limits the emissions of specific sectors. Due to these restrictions, the problem is treated as a generalized non-cooperative game where players (countries) have joint (environmental) constraints caused by the necessity of a common and compulsory … Read more
Global climate change has encouraged international and regional adoption of pollution taxes and carbon emission reduction policies. Europe has taken the leadership in environmental regulations by introducing the European Union Emissions Trading System (EU-ETS) in 2005 and by developing and promoting a set of policies destined to lower carbon emissions from transport sectors. These environmental … Read more
We introduce the Stochastic Asynchronous Proximal Alternating Linearized Minimization (SAPALM) method, a block coordinate stochastic proximal-gradient method for solving nonconvex, nonsmooth optimization problems. SAPALM is the first asynchronous parallel optimization method that provably converges on a large class of nonconvex, nonsmooth problems. We prove that SAPALM matches the best known rates of convergence — among … Read more
This is the first prize winning report for the 2012 INFORMS Railway Application Section Problem Solving Competition (https://www.informs.org/Community/RAS/Problem-Solving-Competition/2012-RAS-Problem-Solving-Competition). Article Download View Mixed-integer Programming Based Approaches for the Movement Planner Problem: Model, Heuristics and Decomposition