A primal truncated newton algorithm with application to large-scale nonlinear network optimization
DOI10.1007/BFB0121178zbMATH Open0635.90072OpenAlexW30546340MaRDI QIDQ3775337FDOQ3775337
Authors: Ron S. Dembo 
Publication date: 1987
Published in: Mathematical Programming Studies (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bfb0121178
Recommendations
- The performance of NLPNET, a large-scale nonlinear network optimizer
- Parallel Block-Partitioning of Truncated Newton for Nonlinear Network Optimization
- scientific article; zbMATH DE number 1568984
- scientific article; zbMATH DE number 4068627
- A Truncated Newton Algorithm for Large Scale Box Constrained Optimization
linearly constrained optimizationtruncated Newton methodslarge-scale nonlinear network optimizationprimal-feasible algorithm
Numerical mathematical programming methods (65K05) Large-scale problems in mathematical programming (90C06) Programming involving graphs or networks (90C35) Nonlinear programming (90C30) Numerical methods based on nonlinear programming (49M37)
Cited In (19)
- Computational comparisons of dual conjugate gradient algorithms for strictly convex networks.
- Computational development of a lagrangian dual approach for quadratic networks
- On large scale nonlinear network optimization
- A COMPARATIVE STUDY OF PARALLEL DECOMPOSITIONS FOR MULTICOMMODITY FLOW PROBLEMS∗
- A motivation for using the truncated Newton approach in a very large scale nonlinear network problem
- A smooth penalty function algorithm for network-structured problems
- The performance of NLPNET, a large-scale nonlinear network optimizer
- On the first-order estimation of multipliers from Kuhn-Tucker systems
- An implementation of Newton-like methods on nonlinearly constrained networks
- Application of the dual active set algorithm to quadratic network optimization
- Parallel Block-Partitioning of Truncated Newton for Nonlinear Network Optimization
- Approximate subgradient methods for nonlinearly constrained network flow problems
- Restricted Simplicial Decomposition for Symmetric Convex Cost Flow Problems
- An efficient method for nonlinearly constrained networks
- Network planning under uncertainty with an application to hydropower generation
- Performance evaluation of independent superbasic sets on nonlinear replicated networks
- Computing equilibria on large multicommodity networks: An application of truncated quadratic programming algorithms
- Numerical experiments with the Lancelot package (Release \(A\)) for large-scale nonlinear optimization
- Title not available (Why is that?)
Uses Software
This page was built for publication: A primal truncated newton algorithm with application to large-scale nonlinear network optimization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3775337)
