Supercalm Multifunctions For Convergence Analysis
- 42 Downloads
Calmness of multifunctions is a well-studied concept of generalized continuity in which single-valued selections from the image sets of the multifunction exhibit a restricted type of local Lipschitz continuity where the base point is fixed as one point of comparison. Generalized continuity properties of multifunctions like calmness can be applied to convergence analysis when the multifunction appropriately represents the iterates generated by some algorithm. Since it involves an essentially linear relationship between input and output, calmness gives essentially linear convergence results when it is applied directly to convergence analysis. We introduce a new continuity concept called ‘supercalmness’ where arbitrarily small calmness constants can be obtained near the base point, which leads to essentially superlinear convergence results. We also explore partial supercalmness and use a well-known generalized derivative to characterize both when a multifunction is supercalm and when it is partially supercalm. To illustrate the value of such characterizations, we explore in detail a new example of a general primal sequential quadratic programming method for nonlinear programming and obtain verifiable conditions to ensure convergence at a superlinear rate.
Key wordscalmness multifunctions generalized continuity variational analysis convergence analysis sequential quadratic programming
AMS 2000 Subject ClassificationPrimary: 49J53 Secondary: 90C30
Unable to display preview. Download preview PDF.
- 3.Dontchev, A.D.: Characterizations of Lipschitz stability in optimization. In: Lucchetti, R., Revalski, J. (eds.) Recent Developments in Well-Posed Problems, pp. 95–115. Kluwer, Dordrecht, The Netherlands (1995)Google Scholar
- 4.Dontchev, A.D.: Lipschitzian stability of Newton's method for variational inclusions. In: System Modeling and Optimization (Cambridge, 1999), pp. 119–147. Kluwer, Boston (2000)Google Scholar
- 9.Klatte, D., Kummer, B.: Contingent derivatives of implicit (multi-) functions and stationary points in optimization with data perturbations, II. Ann. Oper. Res. 101, 313–331 (2001)Google Scholar
- 11.Levy, A.B., Rockafellar, R.T.: Sensitivity of solutions in nonlinear programming problems with nonunique multipliers. In: Du, D.-Z., Qi, L., Womersley, R.S. (eds.) Recent Advances in Nonsmooth Optimization, pp. 215–223. World Scientific, River Edge, New Jersey (1995)Google Scholar
- 15.Pang, J.-S.: Necessary and sufficient conditions for solution stability of parametric nonsmooth equations. In: Du, D.-Z., Qi, L., Womersley, R.S. (eds.) Recent Advances in Nonsmooth Optimization, pp. 261–288. World Scientific, River Edge, New Jersey (1995)Google Scholar
- 18.Rockafellar, R.T.: Proto-differentiability of set-valued mappings and its application in optimization. In: Attouch, H., Aubin, J.-P., Clarke, F.H., Ekeland, I. (eds.) Analyse Non Linéaire, pp. 449–482. Gauthier-Villars, Paris (1989)Google Scholar