Abstract
A rootfinding problem, arising in the solution of a class of nonlinear knapsack problems, is addressed. It is demonstrated that, in spite of unfavorable properties, it is still possible to elegantly construct a fast and globally convergent method.
Original language | English |
---|---|
Pages (from-to) | 440-448 |
Number of pages | 9 |
Journal | SIAM Review |
Volume | 42 |
Issue number | 3 |
DOIs | |
State | Published - 1 Jan 2000 |
ASJC Scopus subject areas
- Theoretical Computer Science
- Computational Mathematics
- Applied Mathematics