Approximate subgradient methods for nonlinearly constrained network flow problems
From MaRDI portal
Publication:2499376
DOI10.1007/s10957-005-7563-0zbMath1130.90051WikidataQ57397218 ScholiaQ57397218MaRDI QIDQ2499376
Publication date: 14 August 2006
Published in: Journal of Optimization Theory and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10957-005-7563-0
90C35: Programming involving graphs or networks
49J52: Nonsmooth analysis
90B10: Deterministic network models in operations research
Uses Software
Cites Work
- Unnamed Item
- An efficient method for nonlinearly constrained networks
- On large scale nonlinear network optimization
- Convergence of a simple subgradient level method
- Convergence of some algorithms for convex minimization
- On the first-order estimation of multipliers from Kuhn-Tucker systems
- An implementation of Newton-like methods on nonlinearly constrained networks
- Incremental Subgradient Methods for Nondifferentiable Optimization
- A primal truncated newton algorithm with application to large-scale nonlinear network optimization
- Large-scale linearly constrained optimization
- Minimization of unsmooth functionals