Quadratic cost flow and the conjugate gradient method
From MaRDI portal
Publication:707094
DOI10.1016/j.ejor.2003.04.003zbMath1132.90374OpenAlexW2056968550MaRDI QIDQ707094
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
Related Items
Convergence of the Polak-Ribiére-Polyak conjugate gradient method, Using improved directions of negative curvature for the solution of bound-constrained nonconvex problems, The convergence of conjugate gradient method with nonmonotone line search, Convergence of Liu-Storey conjugate gradient method, Nonconvex optimization using negative curvature within a modified linesearch, Combining and scaling descent and negative curvature directions, A new family of conjugate gradient methods, Improving directions of negative curvature in an efficient manner, Penalty algorithm based on conjugate gradient method for solving portfolio management problem
Cites Work
- An interior point algorithm of O\((\sqrt m| \ln\varepsilon |)\) iterations for \(C^ 1\)-convex programming
- A network penalty method
- Applying a Newton Method to Strictly Convex Separable Network Quadratic Programs
- A Nonlinear Conjugate Gradient Method with a Strong Global Convergence Property
- Global convergence of conjugate gradient methods without line search
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
