The convergence of equilibrium algorithms with non-monotone line search technique.

DOI10.1016/S0096-3003(02)00821-4zbMath1049.65047OpenAlexW1967365655MaRDI QIDQ1415258

Hai Yang, S. C. Wong, Zi-You Gao, William H. K. Lam

Publication date: 3 December 2003

Published in: Applied Mathematics and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0096-3003(02)00821-4

zbMATH Keywords

global convergencenumerical resultsnonlinear programmingnon-monotone line searchconvex combination algorithmequilibrium assignment

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Nonlinear programming (90C30)

Related Items

A Frank-Wolfe based branch-and-bound algorithm for mean-risk optimization ⋮ A heuristic algorithm for network equilibration

Cites Work

• Unnamed Item
• Sequential systems of linear equations algorithm for nonlinear optimization problems with general constraints
• Avoiding the Maratos Effect by Means of a Nonmonotone Line Search I. General Constrained Problems
• A scaled reduced gradient algorithm for network flow problems with convex separable costs
• Avoiding the Maratos Effect by Means of a Nonmonotone Line Search. II. Inequality Constrained Problems—Feasible Iterates
• A Nonmonotone Line Search Technique for Newton’s Method
• Traffic assignment problem for a general network
• The algorithm of sequential KKT equations by nonmonotone search for arbitrary initial point