PFNRN

swMATH5174MaRDI QIDQ17314

No author found.

Described by source

• An efficient method for nonlinearly constrained networks
• On the efficiency of multiplier methods for nonlinear network problems with nonlinear constraints

Related Items (8)

Lagrangian relaxations on networks by \(\varepsilon \)-subgradient methods ⋮ Unnamed Item ⋮ On the Efficiency of the ε-Subgradient Methods Over Nonlinearly Constrained Networks ⋮ An implementation of Newton-like methods on nonlinearly constrained networks ⋮ Unnamed Item ⋮ Approximate subgradient methods for nonlinearly constrained network flow problems ⋮ A Variant of the Constant Step Rule for Approximate Subgradient Methods over Nonlinear Networks ⋮ On the first-order estimation of multipliers from Kuhn-Tucker systems

This page was built for software: PFNRN