An implementation of Newton-like methods on nonlinearly constrained networks

DOI10.1016/S0305-0548(02)00156-9zbMath1087.90011WikidataQ57397222 ScholiaQ57397222MaRDI QIDQ1765533

Eugenio Mijangos

Publication date: 23 February 2005

Published in: Computers \& Operations Research (Search for Journal in Brave)

zbMATH Keywords

Nonlinear programmingNetwork optimizationAugmented Lagrangian methodsSuperlinear-order methods

Mathematics Subject Classification ID

Methods of quasi-Newton type (90C53) Deterministic network models in operations research (90B10)

Related Items (3)

Lagrangian relaxations on networks by \(\varepsilon \)-subgradient methods ⋮ Approximate subgradient methods for nonlinearly constrained network flow problems ⋮ Redundant and force-differentiated systems in engineering and nature

Uses Software

• L-BFGS
• MINOS
• ve08
• PFNRN
• DIMACS

Cites Work

• On large scale nonlinear network optimization
• Enlarging the region of convergence of Newton's method for constrained optimization
• Partitioned variable metric updates for large structured optimization problems
• Diagonalized multiplier methods and quasi-Newton methods for constrained optimization
• On the first-order estimation of multipliers from Kuhn-Tucker systems
• Multiplier and gradient methods
• A primal truncated newton algorithm with application to large-scale nonlinear network optimization
• The computation of Lagrange-multiplier estimates for constrained minimization
• Updating Quasi-Newton Matrices with Limited Storage
• Inexact Newton Methods
• Exceptional Paper—Design and Implementation of Large Scale Primal Transshipment Algorithms
• Large-scale linearly constrained optimization
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: An implementation of Newton-like methods on nonlinearly constrained networks