Approximate subgradient methods for nonlinearly constrained network flow problems

DOI10.1007/S10957-005-7563-0MaRDI QIDQ2499376zbMATH OpenOpenAlexWikidataFDO

Authors Eugenio Mijangos

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

zbMATH Keywords

\(\epsilon\)-subgradient methodsdiminishing stepsizesNetwork flowsside constraints

Mathematics Subject Classification ID

Nonsmooth analysis (49J52) Deterministic network models in operations research (90B10) Programming involving graphs or networks (90C35)

Recommendations

• On the efficiency of the -subgradient methods over nonlinearly constrained networks
• Performance of some approximate subgradient methods over nonlinearly constrained networks
• Lagrangian relaxations on networks by \(\varepsilon \)-subgradient methods
• scientific article; zbMATH DE number 3952462
• Approximate subgradient methods for Lagrangian relaxations on networks

Cites work

• A primal truncated newton algorithm with application to large-scale nonlinear network optimization
• An efficient method for nonlinearly constrained networks
• An implementation of Newton-like methods on nonlinearly constrained networks
• Convergence of a simple subgradient level method
• Convergence of some algorithms for convex minimization
• scientific article; zbMATH DE number 3282977 (Why is no real title available?)
• Incremental subgradient methods for nondifferentiable optimization
• Large-scale linearly constrained optimization
• Minimization of unsmooth functionals
• On large scale nonlinear network optimization
• On the first-order estimation of multipliers from Kuhn-Tucker systems

Cited in

(13)

• A subgradient method for solving multiproduct network development problems with survivability guarantees
• An inexact modified subgradient algorithm for nonconvex optimization
• Subdivision schemes, network flows and linear optimization
• Lagrangian relaxations on networks by \(\varepsilon \)-subgradient methods
• Accelerated Dual Descent for Network Flow Optimization
• On the efficiency of the -subgradient methods over nonlinearly constrained networks
• On primal convergence for augmented Lagrangian duality
• Approximate subgradient methods for Lagrangian relaxations on networks
• A Variant of the Constant Step Rule for Approximate Subgradient Methods over Nonlinear Networks
• A Newton method for convex separable network flow problems
• scientific article; zbMATH DE number 3952462 (Why is no real title available?)
• Subgradient Methods for the Service Network Design Problem
• Performance of some approximate subgradient methods over nonlinearly constrained networks

Describes a project that uses

Uses Software

• PFNRN

This page was built for publication: Approximate subgradient methods for nonlinearly constrained network flow problems

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