Perturbed Kuhn-Tucker points and rates of convergence for a class of nonlinear-programming algorithms (original) (raw)
Access this article
Subscribe and save
- Starting from 10 chapters or articles per month
- Access and download chapters and articles from more than 300k books and 2,500 journals
- Cancel anytime View plans
Buy Now
Price excludes VAT (USA)
Tax calculation will be finalised during checkout.
Instant access to the full article PDF.
References
- R.L. Armacost and A.V. Fiacco, “Computational experience in sensitivity analysis for nonlinear programming”,Mathematical Programming 6 (1974) 301–326.
Google Scholar - C. Berge,Topological spaces (Macmillan, New York, 1963).
Google Scholar - 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.
Google Scholar - R.H. Day,Recursive programming and production response (North-Holland, Amsterdam, 1963).
Google Scholar - R.H. Day and P. Kennedy, “Recursive decision systems: an existence analysis”,Econometrica 38 (1970) 666–681.
Google Scholar - J.P. Evans and F.J. Gould, “Stability in nonlinear programming”,Operations Research 18 (1970) 107–118.
Google Scholar - 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).
Google Scholar - A.V. Fiacco and G.P. McCormick,Nonlinear programming: sequential unconstrained minimization techniques (Wiley, New York 1968).
Google Scholar - L.V. Kantorovich and G.P. Akilov,Functional analysis in normed spaces (Macmillan, New York 1964).
Google Scholar - 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.]
Google Scholar - G.P. McCormick, “Penalty function versus nonpenalty function methods for constrained nonlinear programming problems”,Mathematical Programming 1 (1971) 217–238.
Google Scholar - R.R. Meyer, “The solution of non-convex optimization problems by iterative convex programming”, Dissertation, University of Wisconsin, Madison, Wis. (1968).
Google Scholar - R.R. Meyer, “The validity of a family of optimization methods”,SIAM Journal on Control 8 (1970) 41–54.
Google Scholar - J.M. Ortega and W.C. Rheinboldt,Iterative solution of nonlinear equations in several variables (Academic Press, New York, 1970).
Google Scholar - S.M. Robinson, “A quadratically-convergent algorithm for general nonlinear programming problems”,Mathematical Programming 3 (1972) 145–156.
Google Scholar - 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.
Google Scholar - J.B. Rosen, “Iterative solution of nonlinear optimal control problems”,SIAM Journal on Control 4 (1966) 223–244.
Google Scholar - 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.
Google Scholar - R.B. Wilson, “A simplicial algorithm for concave programming”, Dissertation, Graduate School of Business Administration, Harvard University, Cambridge, Mass. (1963).
Google Scholar