Quadratic cost flow and the conjugate gradient method

DOI10.1016/J.EJOR.2003.04.003MaRDI QIDQ707094zbMATH OpenOpenAlexFDO

Authors Jie Sun, Xiongda Chen, Xiao Qi Yang

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.04.003

zbMATH Keywords

Conjugate gradient methodsNetwork quadratic programming

Mathematics Subject Classification ID

Quadratic programming (90C20) Programming involving graphs or networks (90C35)

Recommendations

• An Algorithm for Non-Linear Network Programming: Implementation, Results and Comparisons
• scientific article; zbMATH DE number 3869028
• A polynomial algorithm for minimum quadratic cost flow problems
• An algorithm for solving quadratic network flow problems
• A network penalty method

Cites work

• A network penalty method
• A Nonlinear Conjugate Gradient Method with a Strong Global Convergence Property
• An interior point algorithm of O\((\sqrt m| \ln\varepsilon |)\) iterations for \(C^ 1\)-convex programming
• Applying a Newton Method to Strictly Convex Separable Network Quadratic Programs
• Global convergence of conjugate gradient methods without line search
• scientific article; zbMATH DE number 3843083 (Why is no real title available?)
• scientific article; zbMATH DE number 3961334 (Why is no real title available?)
• scientific article; zbMATH DE number 1243473 (Why is no real title available?)
• scientific article; zbMATH DE number 663895 (Why is no real title available?)
• scientific article; zbMATH DE number 1488895 (Why is no real title available?)
• scientific article; zbMATH DE number 3278849 (Why is no real title available?)
• scientific article; zbMATH DE number 3365044 (Why is no real title available?)

Cited in

(14)

• Improving directions of negative curvature in an efficient manner
• Penalty algorithm based on conjugate gradient method for solving portfolio management problem
• A network penalty method
• Computational comparisons of dual conjugate gradient algorithms for strictly convex networks.
• Using improved directions of negative curvature for the solution of bound-constrained nonconvex problems
• Nonconvex optimization using negative curvature within a modified linesearch
• A new family of conjugate gradient methods
• scientific article; zbMATH DE number 3869028 (Why is no real title available?)
• Lagrangian dual coordinatewise maximization algorithm for network transportation problems with quadratic costs
• scientific article; zbMATH DE number 3952462 (Why is no real title available?)
• Combining and scaling descent and negative curvature directions
• The convergence of conjugate gradient method with nonmonotone line search
• Convergence of the Polak-Ribiére-Polyak conjugate gradient method
• Convergence of Liu-Storey conjugate gradient method

This page was built for publication: Quadratic cost flow and the conjugate gradient method

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q707094)