B. T. Poljak. Iterative algorithms for singular minimization problems, In: Nonlinear Programming, 4. Academic Press, N.Y., 1981, 147-166. Home/Search Document Not in Database Summary Related Articles |
This paper is cited in the following contexts:
Numerical Solution Of Some Singular Unconstrained.. - Abram Zhuzhunashvili And (Correct)
....the whole pre history (0; t) To solve (24) and (25) numerically, one can apply the approximate iterative method (16) with nearly the same results as above. 5. Concluding Remarks. A large number of papers is devoted to the numerical methods for solving singular minimization problems; see, e.g. [1,4,8,17], and references therein. However, these works deal with the method error only. They do not touch upon investigating the inherent and round o errors, neither optimality of methods. It should also be noted that the result coinciding with the upper bound (14) has been obtained essentially in [1] ....
B. T. Poljak. Iterative algorithms for singular minimization problems, In: Nonlinear Programming, 4. Academic Press, N.Y., 1981, 147-166.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC