Performance of Some Approximate Subgradient Methods over Nonlinearly Constrained Networks

DOI10.1007/978-3-540-77903-2_16zbMath1209.90338OpenAlexW1545010927MaRDI QIDQ5391886

Eugenio Mijangos

Publication date: 7 April 2011

Published in: Operations Research Proceedings (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-77903-2_16

zbMATH Keywords

networksnonlinear programmingsubgradient methods

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Nonlinear programming (90C30)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On large scale nonlinear network optimization
• Convergence of some algorithms for convex minimization
• Approximate subgradient methods for nonlinearly constrained network flow problems
• Incremental Subgradient Methods for Nondifferentiable Optimization

This page was built for publication: Performance of Some Approximate Subgradient Methods over Nonlinearly Constrained Networks