Entropy based primal-dual algorithm for convex and linear cost transportation problems with serial and parallel implementations

Chabini, I; Florian, M

Title: Entropy based primal-dual algorithm for convex and linear cost transportation problems with serial and parallel implementations

Full Record
Other Related Research

Abstract

In this paper we present a new class of sequential and parallel algorithms for transportation problems with linear and convex costs. First, we consider a capacitated transportation problem with an entropy type objective function. We show that this problem has some interesting properties, namely that its optimal solution verifies both the non negativity and capacity constraints. Then, we give a new solution method for this problem. The algorithm consists of a sequence of {open_quotes}balancing{close_quotes} iterations on the conservation of flow constraints which may be viewed as a generalization of the well known RAS algorithm for matrix balancing. Then we prove the convergence of this method and extend it to strictly convex and linear cost transportation problems. For differentiable convex costs we develop an adaptation where each projection is an entropy type capacitated transportation problem. For linear costs, we prove a triple equivalence between the entropy projection method, the proximal minimization approach (with our entropy type function) and an entropy barrier method. We give a convergence rate analysis for strongly convex costs and linear objectif functions. We show efficient implementations on both serial and parallel environments. Computational results indicate that this methods yields very encouraging results. We solve large problems withmore »« less

Authors:: Chabini, I; Florian, M

Publication Date:: 1994-12-31

OSTI Identifier:: 35884

Report Number(s):: CONF-9408161-
TRN: 94:009753-0146

Resource Type:: Conference

Resource Relation:: Conference: 15. international symposium on mathematical programming, Ann Arbor, MI (United States), 15-19 Aug 1994; Other Information: PBD: 1994; Related Information: Is Part Of Mathematical programming: State of the art 1994; Birge, J.R.; Murty, K.G. [eds.]; PB: 312 p.

Country of Publication:: United States

Language:: English

Subject:: 32 ENERGY CONSERVATION, CONSUMPTION, AND UTILIZATION; 99 MATHEMATICS, COMPUTERS, INFORMATION SCIENCE, MANAGEMENT, LAW, MISCELLANEOUS; TRAFFIC CONTROL; OPTIMIZATION; COMPUTERIZED SIMULATION; BUSES; PARALLEL PROCESSING; ALGORITHMS

Citation Formats


                    Chabini, I, and Florian, M. Entropy based primal-dual algorithm for convex and linear cost transportation problems with serial and parallel implementations.  United States: N. p., 1994. 
        Web.

Copy to clipboard


                    Chabini, I, & Florian, M. Entropy based primal-dual algorithm for convex and linear cost transportation problems with serial and parallel implementations.  United States.

Copy to clipboard


                    Chabini, I, and Florian, M. 1994.  
        "Entropy based primal-dual algorithm for convex and linear cost transportation problems with serial and parallel implementations".  United States.

Copy to clipboard


                    
@article{osti_35884,

  title        = {Entropy based primal-dual algorithm for convex and linear cost transportation problems with serial and parallel implementations},

  author       = {Chabini, I and Florian, M},

  abstractNote = {In this paper we present a new class of sequential and parallel algorithms for transportation problems with linear and convex costs. First, we consider a capacitated transportation problem with an entropy type objective function. We show that this problem has some interesting properties, namely that its optimal solution verifies both the non negativity and capacity constraints. Then, we give a new solution method for this problem. The algorithm consists of a sequence of {open_quotes}balancing{close_quotes} iterations on the conservation of flow constraints which may be viewed as a generalization of the well known RAS algorithm for matrix balancing. Then we prove the convergence of this method and extend it to strictly convex and linear cost transportation problems. For differentiable convex costs we develop an adaptation where each projection is an entropy type capacitated transportation problem. For linear costs, we prove a triple equivalence between the entropy projection method, the proximal minimization approach (with our entropy type function) and an entropy barrier method. We give a convergence rate analysis for strongly convex costs and linear objectif functions. We show efficient implementations on both serial and parallel environments. Computational results indicate that this methods yields very encouraging results. We solve large problems with several million variables on a network of transputers and Sun workstations. For the linear case, the serial implementation is compared to some network simplex codes like RELAX and RNET. Computational experiments indicate that this algorithm can outperform both RELAX and RNET. The parallel implementations are analysed using especially a new measure of performance developed by the authors. The results demonstrate that this measure can give more information than the classical measure of speedup. Some unexpected behaviors are reported.},

  doi          = {},

  url          = {https://www.osti.gov/biblio/35884},
  journal      = {},
number       = ,

  volume       = ,

  place        = {United States},

  year         = {1994},

  month        = {12}

}

Copy to clipboard

Conference:

Other availability

Please see Document Availability for additional information on obtaining the full-text document. Library patrons may search WorldCat to identify libraries that hold this conference proceeding.

Save / Share:

Export Metadata

Save to My Library

Similar records in OSTI.GOV collections:

Entropy based primal-dual algorithm for convex and linear cost transportation problems with serial and parallel implementations

Conference Chabini, I; Florian, M

In this paper we present a new class of sequential and parallel algorithms for transportation problems with linear and convex costs. First, we consider a capacitated transportation problem with an entropy type objectif function. We show that this problem has some interesting properties, namely that its optimal solution verifies both the non negativity and capacity constraints. Then, we give a new solution method for this problem. The algorithm consists of a sequence of {open_quotes}balancing{close_quotes} iterations on the conservation of flow constraints which may be viewed as a generalization of the well known RAS algorithm for matrix balancing. Then we provemore »« less
Quadratic based primal-dual algorithms for multicommodity convex and linear cost transportation problems with serial and parallel implementations

Conference Chabini, I

In this paper we present a new class of sequential and parallel algorithms for multicommodity transportation problems with linear and convex costs. First, we consider a capacitated multicommodity transportation problem with an orthogonal quadratic objective function. We develop two new solution methods. Both exploit the fact that a projection on the conservation of flow constraints has an explicit form which was proved in an early paper by I. Chabini and M. Florian. The two algorithms deal differently with the remaining constraints namely the non negativity and capacity constraints. We prove the convergence of both algorithms using a basic general theorymore »« less
A proximal-based decomposition method for convex minimization problems

Conference Chen, G; Teboulie, M

We present a new proximal based decomposition method for solving convex minimization problems. At each iteration, the algorithm computes two proximal steps in the dual variables and one proximal step in the primal variables. We derive this algorithm from Rockafellar`s proximal method of multipliers, which involves an augmented Lagrangian with an additional quadratic proximal term. The algorithm preserves the good features of the proximal method of multipliers, with the additional advantage that it leads to a decoupling of the constraints, and is thus suitable for parallel implementation. We allow for computing approximately the proximal minimization steps and we prove that,more »« less
Distributed Approximate Newton Algorithms and Weight Design for Constrained Optimization

Journal Article Anderson, Tor; Chang, Chin-Yao; Martinez, Sonia - Automatica

Motivated by economic dispatch and linearly-constrained resource allocation problems, this paper proposes a class of novel algorithms that approximate the standard Newton optimization method. We first develop the notion of an optimal edge weighting for the communication graph over which agents implement the second-order algorithm, and propose a convex approximation for the nonconvex weight design problem. We next build on the optimal weight design to develop a discrete distributed approx-Newton algorithm which converges linearly to the optimal solution for economic dispatch problems with unknown cost functions and relaxed local box constraints. For the full box-constrained problem, we develop a continuousmore »« less
https://doi.org/10.1016/j.automatica.2019.108538
Short-term generation scheduling with transmission and environmental constraints using an augmented Lagrangian relaxation

Journal Article Wang, S; Shahidehpour, S; Kirschen, D; ... - IEEE Transactions on Power Systems

This paper proposes a new approach based on augmented Lagrangian relaxation for short term generation scheduling problem with transmission and environmental constraints. In this method, the system constraints, e.g. load demand, spinning reserve, transmission capacity and environmental constraints, are relaxed by using Lagrangian multipliers, and quadratic penalty terms associated with system load demand balance are added to the Lagrangian objective function. Then the decomposition and coordination technique is used, and non-separable quadratic penalty terms are replaced by linearization around the solution obtained from the previous iteration. In order to improve the convergence property, the exactly convex quadratic terms of decisionmore »« less
https://doi.org/10.1109/59.466524

Similar Records