An exponential‐function reduction method for block‐angular convex programs
DOI10.1002/NET.3230260202zbMATH Open0856.90089OpenAlexW2146519844MaRDI QIDQ4894869FDOQ4894869
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
Recommendations
\(\varepsilon\)-approximate solutiongeneralized multicommodity network flowconvex block-angular optimizationexponential potential-function reduction algorithm
Convex programming (90C25) Large-scale problems in mathematical programming (90C06) Deterministic network models in operations research (90B10)
Cites Work
Cited In (7)
- 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)
- Multicommodity network flows: A survey. II: Solution methods
Uses Software
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)