Convergence of Newton's method for convex best interpolation

Numerische Mathematik

Volumn 87, Issue 3, 2001, Pages 435-456

  Dontchev, Asen L ^a   Qi, Houduo ^b   Qi, Liqun ^b  

^a Mathematical Reviews   (United States)

^b UNIVERSITY OF NEW SOUTH WALES   (Australia)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0035595452     PISSN: 0029599X     EISSN: None     Source Type: Journal    
DOI: 10.1007/PL00005419     Document Type: Article

References (31)

1. L.-E. Andersson, T. Elfving, (1987): An algorithm for constrained interpolation. SIAM J. Sci. Statist. Comput. 8, 1012-1025
2. L.-E. Andersson, T. Elfving, (1995): Best constrained approximation in Hilbert space and interpolation by cubic splines subject to obstacles. SIAM J. Sci. Comput. 16, 1209-1232
3. J.R. Birge, L. Qi, (1995): Subdifferential convergence in stochastic programs. SIAM J. Optim. 5, 436-453
4. J. Borwein, A. S. Lewis, (1992): Partially finite convex programming I: Quasi relative interiors and duality theory. Math. Programming 57, 15-4-8
5. F. H. Clarke: Optimization and Nonsmooth Analysis. John Wiley & Sons, New York, 1983 (Reprinted by SIAM, Philadelphia, PA, 1990)
6. C. de Boor: A Practical Guide to Splines. Springer, New York, 1987
7. T. De Luca, F. Facchinei, C. Kanzow, (1996: A semismooth equation approach to the solution of nonlinear complementarity problems. Math. Programming 75, 407-439
8. F. Deutsch: Interpolation from a convex subset of Hilbert space: a survey of some recent results. Approximation theory, wavelets and applications (Maratea, 1994), 95-105, NATO Adv. Sci. Inst. Ser. C Math. Phys. Sci., 454, Kluwer Acad. Publ., Dordrecht, 1995
9. A. L. Dontchev, B. D. Kalchev, (1989): Duality and well-posedness in convex interpolation. Numer. Funct. Anal. and Optim. 10, 673-689
10. A. L. Dontchev, I. Kolmanovsky, (1996): Best interpolation in a strip. II. Reduction to unconstrained convex optimization. Comput. Optim. Appl. 5, 233-251
11. F. Facchinei, C. Kanzow, (1997): A nonsmooth inexact Newton method for the solution of large-scale nonlinear complementarity problems. Math. Programming 76, 493-512
12. A. Fischer, (1995): A Newton-type method for positive-semidefinite linear complementarity problems. J. Optim. Theory and Appl. 86, 585-608
13. A. Fischer, (1997): Solution of monotone complementarity problems with locally Lipschitzian functions. Math. Programming 76, 513-532
14. B. Fischer, G. Opfer, M. L. Puri, (1991): A local algorithm for constructing nonnegative cubic splines. J. Approx. Theory 64, 1-16
15. U. Hornung, (1980): Interpolation by smooth functions under restriction on the derivatives. J. Approx. Theory 28, 227-237
16. p, norm (1 < p < ∞) of the kth derivative. Mathematics and mathematical education (Sunny Beach, 1984), pp. 31-12, Bulg. Akad. Nauk, Sofia, 1984
17. L. D. Irvine, S. P. Marin, P. W. Smith, (1986): Constrained interpolation and smoothing. Constr. Approx. 2, 129-151
18. H. Jiang, L. Qi, (1995): Local uniqueness and Newton-type methods for nonsmooth variational inequalities. J. Math. Analysis Appl. 196, 314-331
19. H. Jiang, L. Qi, X. Chen, D. Sun: Semismoothness and superlinear convergence in nonsmooth optimization and nonsmooth equations. Nonlinear optimization and applications (Erice, 1995), 197-212, G. Di Pillo and F. Giannessi eds. Plenum Publishing Corporation, New York, 1996
20. p, approximation. Constr. Approx. 1, 93-102
21. C. A. Micchelli, F. I. Utreras, (1988): Smoothing and interpolation in a convex subset of a Hilbert space. SIAM J. Sci. Statist. Comput. 9, 728-747
22. R. Mifflin, (1977): Semismoothness and semiconvex functions in constrained optimization. SIAM J. Control Optim. 15, 959-972
23. H. J. Oberle, G. Opfer, (1998): Nonnegative splines, in particular of degree five. Numer. Math. 79, 427-450
24. 1 minimization problems. J. Optim. Theory Appl. 85, 633-648
25. L. Qi, (1993): Convergence analysis of some algorithms for solving nonsmooth equations. Math. Oper. Res. 18, 227-244
26. L. Qi, H. Jiang, (1997): Semismooth Karush-Kuhn-Tucker equations and convergence analysis of Newton and quasi-Newton methods for solving these equations. Math. Oper. Res. 22, 301-325
27. L. Qi, J. Sun, (1993): A nonsmooth version of Newton's method. Math. Programming 58, 353-367
28. J. W. Schmidt, (1992): Dual algorithms for solving convex partially separable optimization problems. Jahresber Deutch Math.-Verein 94, 40-62
29. J.W. Schmidt, (1997): Interpolation in a derivative strip. Computing 58, 377-389
30. N. Yamashita, M. Fukushima, (1997): Modified Newton methods for solving semismooth reformulations of monotone complementarity problems. Math. Programming 76, 469-491
31. OPTIMA-16: A software package for approximation of functions. Institute of Mathematics, Bulg. Acad. Sc., Sofia, 1990