Abstract
In this paper an algorithm for the computation of a locally optimal polefree solution to the discrete rational least squares problem under a mild regularity condition is presented. It is based on an adaptation of projection methods [8], [12], [13], [14], [18], [19] to the modified Gauß-Newton method [4], [10]. A special device makes possible the direct handling of the infinitely many linear constraints present in this problem.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Barrodale, I. B.: Best Rational Approximation And Strict Quasi-Convexity, SIAM J. Numer. Anal. 10, (1973), 8–12.
Björck, Å.: Iterative Refinement Of Linear Least Squares Solutions II, BIT 8, (1968), 8–30.
Björck, Å., Golub, G. H.: Iterative Refinement Of Linear Least Squares Solutions By Householder Transformation, BIT 7, (1967), 322–337.
Braun, B.: Nichtlineare Gauß-Approximation, Lösungsverfahren und Kondition, mit Anwendung auf Exponential summenapproximation, Thesis, Mainz 1967.
Dietze, S., Schwetlick, H.: Über die Schrittweitenwahl bei Abstiegsverfahren zur Minimierung konvexer Funktionen, ZAMM 51, (1971), 451–454.
Dunham, C. B.: Best Discrete Mean Rational Approximation, Aeq. Math. 11, (1974), 8–12.
Fiacco, A. V., McCormick, G. P.: Nonlinear Programming (Sequential Unconstrained Minimization Techniques), New York, London, Toronto, Sydney: J. Wiley (1968)
Goldfarb, D.: Extension Of Davidon's Variable Metric Method To Maximization Under Linear Inequality And Equality Constraints, SIAM J. Appl. Math. 17, (1969), 739–764.
Golub, G. H., Pereyra, V.: The Differentiation Of Pseudo-Inverses And Nonlinear Least Squares Problems Whose Variables Separate, SIAM J. Numer. Anal. 10, (1973), 413–432.
Hartley, H. O.: The Modified Gauß-Newton Method For The Fitting Of Nonlinear Regression Functions By Least Squares, Technometrics 3, (1961), 269–280.
Pomentale, T.: On Rational Least Squares Approximation, Num. Math. 12, (1968), 40–46.
Rauch, S. W.: A Convergence Theory For A Class Of Nonlinear Programming Problems, SIAM J. Numer. Anal. 10, (1973), 207–228.
Rosen, J. B.: The Gradient Projection Method For Nonlinear Programming, Part I: Linear Constraints. SIAM J. Appl. Math. 8, (1960), 181–217.
Rosen, J. B.: The Gradient Projection Method For Nonlinear Programming, Part II: Nonlinear Constraints. SIAM J. Appl. Math. 9, (1961), 514–532.
Spellucci, P.: Algorithms For Rational Discrete Least Squares Approximation, Part I: Unconstrained Optimization. To be published.
Spellucci, P.: Über den Koeffizientenbereich gewisser positiver Polynome. To be published.
Spellucci, P.: Einige neue Ergebnisse auf dem Gebiet der diskreten rationalen Approximation, Thesis, Ulm 1972.
Stoer, J.: On The Numerical Solution Of Constrained Least Squares Problems, SIAM J. Numer. Anal. 8, (1971), 382–411.
Zettl, G.: Ein Verfahren zum Minimieren einer Funktion bei eingeschränktem Variationsbereich der Parameter, Num. Math. 15, (1970), 415–432.
Zoutendijk, G.: Methods Of Feasible Directions: A Study In Linear And Nonlinear Programming, Amsterdam: Elsevier (1960).
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1975 Springer-Verlag Berlin · Heidelberg
About this paper
Cite this paper
Spellucci, P. (1975). Algorithms for rational discrete least squares approximation. In: Bulirsch, R., Oettli, W., Stoer, J. (eds) Optimization and Optimal Control. Lecture Notes in Mathematics, vol 477. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0079181
Download citation
DOI: https://doi.org/10.1007/BFb0079181
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-07393-2
Online ISBN: 978-3-540-37591-3
eBook Packages: Springer Book Archive