Abstract
This paper establishes quantitative bounds for the variation of an isolated local minimizer for a general nonlinear program under perturbations in the objective function and constraints. These bounds are then applied to establish rates of convergence for a class of recursive nonlinear-programming algorithms.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
R.L. Armacost and A.V. Fiacco, “Computational experience in sensitivity analysis for nonlinear programming”,Mathematical Programming 6 (1974) 301–326.
C. Berge,Topological spaces (Macmillan, New York, 1963).
G.B. Dantzig, J. Folkman and N.Z. Shapiro, “On the continuity of the minimum set of a continuous function”,Journal of Mathematical Analysis and Applications 17 (1967) 519–548.
R.H. Day,Recursive programming and production response (North-Holland, Amsterdam, 1963).
R.H. Day and P. Kennedy, “Recursive decision systems: an existence analysis”,Econometrica 38 (1970) 666–681.
J.P. Evans and F.J. Gould, “Stability in nonlinear programming”,Operations Research 18 (1970) 107–118.
A.V. Fiacco, “Sensitivity analysis for nonlinear programming using penalty methods”, Tech. Paper, Serial T-275; Institute for Management Science and Engineering, The George Washington University, Washington, D.C. (March 1973).
A.V. Fiacco and G.P. McCormick,Nonlinear programming: sequential unconstrained minimization techniques (Wiley, New York 1968).
L.V. Kantorovich and G.P. Akilov,Functional analysis in normed spaces (Macmillan, New York 1964).
E.S. Levitin and B.T. Polyak, “Constrained minimization methods”,U.S.S.R. Computational Mathematics and Mathematical Physics 6 (5) (1966) 1–50. [Original in Russian:Žurnal Vyčislitel'noi Matematiki i Matematičeskoi Fiziki 6 (5) (1966) 787–823.]
G.P. McCormick, “Penalty function versus nonpenalty function methods for constrained nonlinear programming problems”,Mathematical Programming 1 (1971) 217–238.
R.R. Meyer, “The solution of non-convex optimization problems by iterative convex programming”, Dissertation, University of Wisconsin, Madison, Wis. (1968).
R.R. Meyer, “The validity of a family of optimization methods”,SIAM Journal on Control 8 (1970) 41–54.
J.M. Ortega and W.C. Rheinboldt,Iterative solution of nonlinear equations in several variables (Academic Press, New York, 1970).
S.M. Robinson, “A quadratically-convergent algorithm for general nonlinear programming problems”,Mathematical Programming 3 (1972) 145–156.
S.M. Robinson and R.H. Day, “A sufficient condition for continuity of optimal sets in mathematical programming”,Journal of Mathematical Analysis and Applications 45 (1974) 506–511.
J.B. Rosen, “Iterative solution of nonlinear optimal control problems”,SIAM Journal on Control 4 (1966) 223–244.
J.B. Rosen and J. Kreuser, “A gradient projection algorithm for nonlinear constraints”, in:Numerical methods for nonlinear optimization, Ed. F.A. Lootsma (Academic Press, New York, 1972) pp. 297–300.
R.B. Wilson, “A simplicial algorithm for concave programming”, Dissertation, Graduate School of Business Administration, Harvard University, Cambridge, Mass. (1963).
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Robinson, S.M. Perturbed Kuhn-Tucker points and rates of convergence for a class of nonlinear-programming algorithms. Mathematical Programming 7, 1–16 (1974). https://doi.org/10.1007/BF01585500
Received:
Revised:
Issue Date:
DOI: https://doi.org/10.1007/BF01585500