Globally Convergent Cutting Plane Method for
✍ Scribed by Napsu Karmitsa; Mario Tanaka Filho; José Herskovits
- Book ID
- 106433349
- Publisher
- Springer
- Year
- 2010
- Tongue
- English
- Weight
- 561 KB
- Volume
- 148
- Category
- Article
- ISSN
- 0022-3239
No coin nor oath required. For personal study only.
📜 SIMILAR VOLUMES
A new zero finding method for algebraic equation, using the Fourier coefficient on a circle in the complex plane, is proposed. The proof of the main theorem which guarantees its global convergence is shown precisely. Some results of numerical experiments are given.
This paper presents a globally convergent method for solving a general semi-infinite linear programming problem. Some important features of this method include: It can solve a semi-infinite linear program having an unbounded feasible region. It requires an inexact solution to a nonlinear subproblem