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

DOI10.1002/NET.3230260202MaRDI QIDQ4894869zbMATH OpenOpenAlexFDO

Authors M. 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)

Recommendations

• Fast Approximation Schemes for Convex Programs with Many Blocks and Coupling Constraints
• Potential function methods for approximately solving linear programming problems: theory and practice.
• scientific article; zbMATH DE number 1215271

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

Cited in

(7)

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

Describes a project that uses

Uses Software

• OSL
• DIMACS
• tn

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4894869)