The convergence of equilibrium algorithms with non-monotone line search technique. (Q1415258)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: The convergence of equilibrium algorithms with non-monotone line search technique. |
scientific article; zbMATH DE number 2012675
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | The convergence of equilibrium algorithms with non-monotone line search technique. |
scientific article; zbMATH DE number 2012675 |
Statements
The convergence of equilibrium algorithms with non-monotone line search technique. (English)
0 references
3 December 2003
0 references
The authors consider nonlinear programming problems of the form \(\min f(x)\), \(Ax= b\), \(x\geq 0\). For this problems, a new convex combination algorithm with non-monotone line search is presented together with the proof of ist global convergence. The given algorithm is extended to equilibrium assignement problems. Numerical results are given.
0 references
convex combination algorithm
0 references
non-monotone line search
0 references
global convergence
0 references
equilibrium assignment
0 references
nonlinear programming
0 references
numerical results
0 references
0 references
0 references
0 references
