A primal truncated newton algorithm with application to large-scale nonlinear network optimization
From MaRDI portal
Publication:3775337
DOI10.1007/BFb0121178zbMath0635.90072OpenAlexW30546340MaRDI QIDQ3775337
Publication date: 1987
Published in: Mathematical Programming Studies (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bfb0121178
linearly constrained optimizationtruncated Newton methodslarge-scale nonlinear network optimizationprimal-feasible algorithm
Programming involving graphs or networks (90C35) Numerical mathematical programming methods (65K05) Large-scale problems in mathematical programming (90C06) Nonlinear programming (90C30) Numerical methods based on nonlinear programming (49M37)
Related Items
Application of the dual active set algorithm to quadratic network optimization, Computational development of a lagrangian dual approach for quadratic networks, Network planning under uncertainty with an application to hydropower generation, A COMPARATIVE STUDY OF PARALLEL DECOMPOSITIONS FOR MULTICOMMODITY FLOW PROBLEMS∗, Numerical experiments with the Lancelot package (Release \(A\)) for large-scale nonlinear optimization, A smooth penalty function algorithm for network-structured problems, Computational comparisons of dual conjugate gradient algorithms for strictly convex networks., On large scale nonlinear network optimization, Computing equilibria on large multicommodity networks: An application of truncated quadratic programming algorithms, An implementation of Newton-like methods on nonlinearly constrained networks, An efficient method for nonlinearly constrained networks, Unnamed Item, Approximate subgradient methods for nonlinearly constrained network flow problems, Restricted Simplicial Decomposition for Symmetric Convex Cost Flow Problems, On the first-order estimation of multipliers from Kuhn-Tucker systems, Performance evaluation of independent superbasic sets on nonlinear replicated networks
Uses Software
