Multipoint methods for separable nonlinear networks

DOI10.1007/BFb0121016zbMath0553.90037OpenAlexW115980880MaRDI QIDQ3216399

Pasumarti V. Kamesam, Robert R. Meyer

Publication date: 1984

Published in: Mathematical Programming Studies (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bfb0121016

zbMATH Keywords

linear convergencepiecewise-linear approximationsdirected networkseparable objective functionimplicit-grid strategyoptimal feasible flow

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Numerical mathematical programming methods (65K05) Convex programming (90C25) Deterministic network models in operations research (90B10)

Related Items

Application of the dual active set algorithm to quadratic network optimization, Computational development of a lagrangian dual approach for quadratic networks, Sandwich approximation of univariate convex functions with an application to separable convex programming, An efficient global algorithm for indefinite separable quadratic knapsack problems with box constraints, Mean‐standard deviation model for minimum cost flow problem, Computational comparisons of dual conjugate gradient algorithms for strictly convex networks., An algorithm for a singly constrained class of quadratic programs subject upper and lower bounds, A survey on the continuous nonlinear resource allocation problem, Implementing an “exact” Newton method for separable convex transportation problems, New algorithms for singly linearly constrained quadratic programs subject to lower and upper bounds, A Two-Phase Gradient Method for Quadratic Programming Problems with a Single Linear Constraint and Bounds on the Variables, Parallel decomposition methods for linearly constrained problems subject to simple bound with application to the SVMs training, Restricted Simplicial Decomposition for Symmetric Convex Cost Flow Problems, Decomposition algorithm model for singly linearly-constrained problems subject to lower and Upper bounds, A variable-penalty alternating directions method for convex optimization, Performance evaluation of independent superbasic sets on nonlinear replicated networks