An exponential‐function reduction method for block‐angular convex programs

DOI10.1002/net.3230260202zbMath0856.90089OpenAlexW2146519844MaRDI QIDQ4894869

Michael D. Grigoriadis, Leonid G. Khachiyan

Publication date: 7 October 1996

Published in: Networks (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/net.3230260202

zbMATH Keywords

\(\varepsilon\)-approximate solutiongeneralized multicommodity network flowconvex block-angular optimizationexponential potential-function reduction algorithm

Mathematics Subject Classification ID

Convex programming (90C25) Large-scale problems in mathematical programming (90C06) Deterministic network models in operations research (90B10)

Related Items (7)

A new exact exponential penalty function method and nonconvex mathematical programming ⋮ Unnamed Item ⋮ Scientific contributions of Leo Khachiyan (a short overview) ⋮ A multistage stochastic programming approach for preventive maintenance scheduling of GENCOs with natural gas contract ⋮ Flows with unit path capacities and related packing and covering problems ⋮ A penalty function heuristic for the resource constrained shortest path problem ⋮ About Lagrangian methods in integer optimization

Uses Software

• tn
• DIMACS
• OSL

Cites Work

• An efficient implementation of the network simplex method
• Approximation Algorithms for the Maximum Concurrent Flow Problem
• Parallel Decomposition of Multicommodity Network Flows Using a Linear-Quadratic Penalty Algorithm

This page was built for publication: An exponential‐function reduction method for block‐angular convex programs