An efficient method for nonlinearly constrained networks

DOI10.1016/j.ejor.2003.06.032zbMath1120.90059OpenAlexW1977439873WikidataQ57397220 ScholiaQ57397220MaRDI QIDQ706946

Eugenio Mijangos

Publication date: 9 February 2005

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ejor.2003.06.032

zbMATH Keywords

Nonlinear programmingNetwork flowsAugmented Lagrangian methodHydrothermal scheduling of electricity generationLimited memory BFGS method

Mathematics Subject Classification ID

Nonlinear programming (90C30) 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 ⋮ PFNRN

Uses Software

• KNITRO
• LANCELOT
• LOQO
• SNOPT
• L-BFGS
• AMPL
• PPRN
• MINOS
• NPSOL
• DIMACS
• NEOS

Cites Work

• On large scale nonlinear network optimization
• Enlarging the region of convergence of Newton's method for constrained optimization
• An implementation of linear and nonlinear multicommodity network flows
• An interior-point algorithm for nonconvex nonlinear programming
• Representations of quasi-Newton matrices and their use in limited memory methods
• A smooth penalty function algorithm for network-structured problems
• Interior-point methods for nonconvex nonlinear programming: orderings and higher-order methods
• On the first-order estimation of multipliers from Kuhn-Tucker systems
• Maintaining LU factors of a general sparse matrix
• Numerical experiments with the Lancelot package (Release \(A\)) for large-scale nonlinear optimization
• A primal truncated newton algorithm with application to large-scale nonlinear network optimization
• Updating Quasi-Newton Matrices with Limited Storage
• Inexact Newton Methods
• Matrix conditioning and nonlinear optimization
• Exceptional Paper—Design and Implementation of Large Scale Primal Transshipment Algorithms
• Large-scale linearly constrained optimization
• LOQO:an interior point code for quadratic programming
• An Interior Point Algorithm for Large-Scale Nonlinear Programming
• SNOPT: An SQP Algorithm for Large-Scale Constrained Optimization
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: An efficient method for nonlinearly constrained networks