An efficient method for nonlinearly constrained networks
From MaRDI portal
Publication:706946
DOI10.1016/J.EJOR.2003.06.032zbMATH Open1120.90059DBLPjournals/eor/Mijangos05OpenAlexW1977439873WikidataQ57397220 ScholiaQ57397220MaRDI QIDQ706946FDOQ706946
Authors: 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
Recommendations
- An implementation of Newton-like methods on nonlinearly constrained networks
- On the efficiency of multiplier methods for nonlinear network problems with nonlinear constraints
- scientific article; zbMATH DE number 433004
- An implementation of linear and nonlinear multicommodity network flows
- A hybrid algorithm for solving network flow problems with side constraints.
Nonlinear programmingAugmented Lagrangian methodHydrothermal scheduling of electricity generationLimited memory BFGS methodNetwork flows
Cites Work
- Numerical experiments with the Lancelot package (Release \(A\)) for large-scale nonlinear optimization
- LOQO:an interior point code for quadratic programming
- Title not available (Why is that?)
- Large-scale linearly constrained optimization
- Updating Quasi-Newton Matrices with Limited Storage
- Title not available (Why is that?)
- Representations of quasi-Newton matrices and their use in limited memory methods
- Title not available (Why is that?)
- Inexact Newton Methods
- Matrix conditioning and nonlinear optimization
- SNOPT: An SQP Algorithm for Large-Scale Constrained Optimization
- An Interior Point Algorithm for Large-Scale Nonlinear Programming
- Enlarging the region of convergence of Newton's method for constrained optimization
- Title not available (Why is that?)
- An interior-point algorithm for nonconvex nonlinear programming
- Interior-point methods for nonconvex nonlinear programming: orderings and higher-order methods
- Maintaining LU factors of a general sparse matrix
- Title not available (Why is that?)
- Exceptional Paper—Design and Implementation of Large Scale Primal Transshipment Algorithms
- An implementation of linear and nonlinear multicommodity network flows
- A smooth penalty function algorithm for network-structured problems
- On the first-order estimation of multipliers from Kuhn-Tucker systems
- Title not available (Why is that?)
- A primal truncated newton algorithm with application to large-scale nonlinear network optimization
- Title not available (Why is that?)
- On large scale nonlinear network optimization
Cited In (22)
- Title not available (Why is that?)
- Title not available (Why is that?)
- A hybrid algorithm for solving network flow problems with side constraints.
- Title not available (Why is that?)
- A motivation for using the truncated Newton approach in a very large scale nonlinear network problem
- An Algorithm for Non-Linear Network Programming: Implementation, Results and Comparisons
- Title not available (Why is that?)
- On the efficiency of multiplier methods for nonlinear network problems with nonlinear constraints
- An implementation of Newton-like methods on nonlinearly constrained networks
- A combinatorial method for computing bounds on solutions of active non‐linear resistive networks
- Title not available (Why is that?)
- PFNRN
- Approximate subgradient methods for nonlinearly constrained network flow problems
- OR Practice—Large-Scale Nonlinear Network Models and Their Application
- Title not available (Why is that?)
- A method of network programming in problems of nonlinear optimization
- Performance evaluation of independent superbasic sets on nonlinear replicated networks
- A surrogate and Lagrangian approach to constrained network problems
- Title not available (Why is that?)
- On the dual coordinate ascent approach for nonlinear networks
- Lagrangian relaxations on networks by \(\varepsilon \)-subgradient methods
- A set of connection network synthesis based on the linear Diophantine constraints solution in area {0,1}
Uses Software
This page was built for publication: An efficient method for nonlinearly constrained networks
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q706946)
