On applications of the calmness moduli for multifunctions to error bounds

References

• Bonnans JF, Shapiro A. Perturbation analysis of optimization problems. Berlin: Springer-Verlag; 2000.
   Google Scholar
• Burke JV. Calmness and exact penalization. SIAM J Control Optim. 1991;29:493–497.
   Web of Science ®Google Scholar
• Clarke FH. Optimization and nonsmooth analysis. New York (NY): Wiley; 1983.
   Google Scholar
• Deng S. Global error bounds for convex inequality systems in Banach spaces. SIAM J Control Optim. 1998;36:1240–1249.
   Web of Science ®Google Scholar
• Dontchev AL, Rockafellar RT. Regularity and conditioning of solution mappings in variational analysis. Set-Valued Anal. 2004;12:79–109.
   Google Scholar
• Dontchev AL, Rockafellar RT. Implicit functions and solutions mapping. Berlin: Springer; 2009.
   Google Scholar
• Ioffe AD. Necessary and sufficient conditions for a local minimum, I: A reduction theorem and first order conditions. SIAM J Control Optim. 1979;17:245–250.
   Web of Science ®Google Scholar
• Levy AB. Solution sensitivity from general principles. SIAM J Control Optim. 2001;40:1–38.
   Web of Science ®Google Scholar
• Shen Z, Yao J-C, Zheng XY. Calmness and the Abadie CQ for multifunctions and linear regularity for a collection of closed sets. SIAM J Optim. 2019;29(3):2291–2319.
   Web of Science ®Google Scholar
• Henrion R, Jourani A. Subdifferential conditions for calmness of convex constraints. SIAM J Optim. 2002;13:520–534.
   Web of Science ®Google Scholar
• Henrion R, Jourani A, Outrata J. On the calmness of a class of multifunctions. SIAM J Optim. 2002;13:603–618.
   Web of Science ®Google Scholar
• Henrion R, Outrata J. Calmness of constraint systems with applications. Math Program. 2005;104:437–464.
   Web of Science ®Google Scholar
• Zheng XY, Ng KF. Metric subregularity and constraint qualifications for convex generalized equations in Banach spaces. SIAM J Optim. 2007;18:437–460.
   Web of Science ®Google Scholar
• Zheng XY, Ng KF. Calmness for L-subsmooth multifunctions in Banach spaces. SIAM J Optim. 2009;19:1648–1673.
   Web of Science ®Google Scholar
• Wei Z, Yao J-C, Zheng XY. Strong Abadie CQ, ACQ, calmness and linear regularity. Math Program. 2014;145:97–131.
   Web of Science ®Google Scholar
• Wei Z, Yao J-C. Abadie constraint qualifications for convex constraint systems and applications to calmness property. J Optim Theory Appl. 2017;174:388–407.
   Web of Science ®Google Scholar
• Burke JV, Deng S. Weak sharp minima revisited. III. Error bounds for differentiable convex inclusions. Math Program (Ser B). 2009;116(1–2):37–56.
   Web of Science ®Google Scholar
• Studniarski M, Ward DE. Weak sharp minima: characterizations and sufficient conditions. SIAM J Control Optim. 1999;38:219–236.
   Web of Science ®Google Scholar
• Zheng XY, Yang XQ. Weak sharp minima for semi-infinite optimization problems with applications. SIAM J Optim. 2007;18:573–588.
   Web of Science ®Google Scholar
• Burke JV, Deng S. Weak sharp minima revisited. I. Basic theory. Control Cybernet. 2002;31:439–469.
   Web of Science ®Google Scholar
• Burke JV, Deng S. Weak sharp minima revisited. II. Application to linear regularity and error bounds. Math Program (Ser B). 2005;104:235–261.
   Web of Science ®Google Scholar
• Zheng XY, Ng KF. Linear regularity for a collection of subsmooth sets in Banach spaces. SIAM J Optim. 2008;19:62–76.
   Web of Science ®Google Scholar
• Aubin JP, Frankowska H. Set-valued analysis. Boston (MA): Birkhäuser; 1990.
   Google Scholar
• Shapiro A. Existence and differentiability of metric projections in Hilbert spaces. SIAM J Optim. 1994;4:130–141.
   Web of Science ®Google Scholar
• Shapiro A, Al-Khayyal F. First order conditions for isolated locally optimal solutions, J. Optim Theory Appl. 1993;77:189–196.
   Web of Science ®Google Scholar
• Schirotzek W. Nonsmooth analysis. Berlin: Springer-Verlag; 2007.
   Google Scholar
• King AJ, Rockafellar RT. Sensitivity analysis for nonsmooth generalized equations. Math Program. 1992;55:193–212.
   Web of Science ®Google Scholar
• Levy AB. Implicit multifunction theorems for the sensitivity analysis of variational conditions. Math Program. 1996;74:333–350.
   Web of Science ®Google Scholar
• Polyak BT. Sharp minima. Institute of control sciences lecture notes. Presented at the IIASA Workshop on Generalized Lagrangians and Their Applications; IIASA; Laxenburg, Austria; 1979. Moscow: USSR; 1979.
   Google Scholar
• Ferris MC. Weak sharp minima and penalty functions in mathematical programming [PhD thesis]. Cambridge: University of Cambridge; 1988.
   Google Scholar
• Burke JV, Ferris MC. Weak sharp minima in mathematical programming. SIAM J Control Optim. 1993;31:1340–1359.
   Web of Science ®Google Scholar
• Li W. Sharp Lipschitz constants for basic optimal solutions and basic feasible solutions of linear programs. SIAM J Control Optim. 1994;32:140–153.
   Web of Science ®Google Scholar
• Pang J-S. Error bounds in mathematical programming. Math Program. 1997;79:299–332.
   Web of Science ®Google Scholar
• Zalinescu C. Weak sharp minima, well-behaving functions and global error bounds for convex inequalities in Banach spaces. Proceedings of the 12th Baikal International Conference on Optimization Methods and Their Application. Irkutsk, Russia: Institute of System Dynamics and Control Theory of SB RAS; 2001. p. 272–284.
   Google Scholar
• Zheng XY, Yang XQ. Weak sharp minima for piecewise linear multiobjective optimization in normed spaces. Nonlinear Anal. 2008;68:3771–3779.
   Web of Science ®Google Scholar
• Aspelmeier T, Charitha C, Luke DR. Local linear convergence of the ADMM/Douglas-Rachford algorithms without strong convexity and application to statistical imaging. SIAM J Imaging Sci. 2016;9:842–868.
   Web of Science ®Google Scholar
• Burke JV, Ferris MC. A Gauss-Newton method for convex composite optimization. Math Program. 1995;71:179–194.
   Web of Science ®Google Scholar
• Ferris MC. Finite termination of the proximal point algorithm. Math Program. 1991;50:359–366.
   Web of Science ®Google Scholar
• Bauschke H, Borwein J. On projection algorithms for solving convex feasibility problems. SIAM Rev. 1996;38:367–426.
   Web of Science ®Google Scholar
• Bakan A, Deutsch F, Li W. Strong CHIP, normality and linear regularity of convex sets. Trans Amer Math Soc. 2005;357:3831–3863.
   Web of Science ®Google Scholar
• Bauschke H, Borwein J. On the convergence of von Neumanns alternating projection algorithm for two sets. Set-Valued Anal. 1993;1:185–212.
   Google Scholar
• Bauschke H, Borwein J, Li W. Strong conical hull intersection property, bounded linear regularity, Jamesons property (G), and error bounds in convex optimization. Math Program (Ser A). 1999;86:135–160.
   Web of Science ®Google Scholar
• Klatte D, Kummer B. Nonsmooth equations in optimization in regularity, calculus, methods, and applications. Dordrecht: Kluwer Academic Publishers; 2002. (Nonconvex Optimization and its Application; 60).
   Google Scholar
• Wei Z, He Q. Normal property, Jameson property, CHIP and linear regularity for an infinite system of convex sets in Banach spaces. Optimization. 2016;65(12):2095–2114.
   Web of Science ®Google Scholar
• Zheng XY, Wei Z, Yao J-C. Uniform subsmoothness and linear regularity for a collection of infinitely many closed sets. Nonlinear Anal. 2010;73:413–430.
   Web of Science ®Google Scholar