Abstract
In this paper basic results on sensitivity analysis in differentiable nonlinear programming are surveyed. Also, a simpler standard proof of a recent result due to Kojima is given.
This research was supported in part by the National Science Foundation.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
AARMCOST, R.L. and A.V. FIACCO (1978). Sensitivity analysis for parametric nonlinear programming using penalty methods. In Computers and Mathematical Programming, National Bureau of Standards Special Publication, 502, 261–269.
BERGE, G. (1963). Topological Spaces. Macmillan, New York.
BIGELOW, J.H. and N.Z. SHAPIRO (1974). Implicit function theorems for mathematical programming and for systems of inequalities, Math. Programming 6 (2), 141–156.
EDAHL, R. (1982). Sensitivity analysis in nonlinear programming, Ph.D. Dissertation, Carnegie-Mellon University.
FIACCO, A.V. (1976). Sensitivity analysis for nonlinear programming using penalty methods, Math. Programming 10 (3), 287–311.
FIACCO, A.V. (1980). Nonlinear programming sensitivity analysis results using strong second order assumptions. In Numerical Optimization of Dynamic Systems (L.C.W. Dixon and G.P. Szego, eds.). North-Holland, Amsterdam, 327–348.
FIACCO, A.V. (1983). Optimal value continuity and differential stability bounds under the Mangasarian-Fromovitz constraint qualification. In Mathematical Programming with Data Perturbations, Vol. II (A.V. Fiacco, ed.). Marcel Dekker, New York, 65–90.
FIACCO, A.V. (1983). Introduction to Sensitivity and Stability Analysis in Nonlinear Programming. Academic Press, New York.
FIACCO, A.V. and A. GHAEMI (1982). Sensitivity analysis of a nonlinear water pollution control model using an upper Hudson River data base, Operations Research 30 (1), 1–28.
FIACCO, A.V. and G.P. McCORMICK (1968). Nonlinear Programming: Sequential Unconstrained Minimization Techniques. Wiley, New York.
GAUVIN, J. (1977). A necessary and sufficient regularity condition to have bounded multipliers in nonconvex programming, Math. Programming 12, 136–138.
JITTORNTRUM, J. (1978). Sequential algorithms in nonlinear programming, Ph.D. Dissertation, Australian National University, Canberra.
JITTORNTRUM, K. (1981). Solution point differentiability without strict complementarity in nonlinear programming, Math. Programming Study 21, Sensitivity, Stability and Parametric Analysis (A.V. Fiacco, ed.), 1984.
KARUSH, W. (1939). Minima of functions of several variables with inequalities as side conditions, M.S. Thesis, Department of Mathematics, University of Chicago.
KOJIMA, M. (1978). Studies on piecewise-linear approximations of piecewise-C2 mappings in fixed point and complementarity theory, Mathematics of Operations Research 3, 17–36.
KOJIMA, M. (1980). Strongly stable stationary solutions in nonlinear programs. In Analysis and Computation of Fixed Points (S.M. Robinson, ed.). Academic Press, New York, 93–138.
KUHN, H.W. and A.W. TUCKER (1951). Nonlinear programming. In Proceedings of the 2nd Berkeley Symposium on Mathematical Statistics and Probability (J. Neyman, ed.). University of California Press, Berkeley, 481–493.
LEVITIN, E.S. (1975). On the local perturbation theory of a problem of mathematical programming in a Banach space, Soviet Math. Doklady 16, 1354–1358.
McCORMICK, G.P. (1976). Optimality criteria in nonlinear programming. In SIAM-AMS Proceedings 9. SIAM, Philadelphia, 27–38.
ORTEGA, J.M. and W.C. RHEINBOLDT (1970). Iterative Solution of Nonlinear Equations in Several Variables. Academic Press, New York.
PENNISI, L. (1953). An indirect proof for the problem of Lagrange with differential inequalities as added side conditions, Trans. Amer. Math. Soc. 74, 177–198.
ROBINSON, S.M. (1974). Perturbed Kuhn-Tucker points and rates of convergence for a class of nonlinear programming algorithms, Math. Programming 7 (1), 1–16.
ROBINSON, S.M. (1979). Generalized equations and their solutions, Part I: Basic theory, Math. Programming Study 10, 128–141.
ROBINSON, S.M. (1980). Strongly regular generalized equations, Mathematics of Operations Research 5 (1), 43–62.
ROBINSON, S.M. (1982). Generalized equations and their solutions, Part II: Applications to nonlinear programming, Math. Programming Study 19, 200–221.
ROCKAFELLAR, R.T. (1984). Directional differentiability of the optimal value function in a nonlinear programming problem, Math Programming Study 21, Sensitivity, Stability and Parametric Analysis (A.V. Fiacco, ed.).
SPINGARN, J.E. (1977). Generic conditions for optimality in constrained minimization problems, Ph.D. Dissertation, University of Washington, Seattle.
SPINGARN, J.E. (1980). Fixed and variable constraints in sensitivity analysis, SIAM J. Control Optimiz. 18 (3), 297–310.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1985 Springer-Verlag
About this paper
Cite this paper
Fiacco, A.V., Kyparisis, J. (1985). Sensitivity analysis in nonlinear programming under second order assumptions. In: Bagchi, A., Jongen, H.T. (eds) Systems and Optimization. Lecture Notes in Control and Information Sciences, vol 66. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0043393
Download citation
DOI: https://doi.org/10.1007/BFb0043393
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-15004-6
Online ISBN: 978-3-540-39215-6
eBook Packages: Springer Book Archive