References
- Polyak BT. Sharp minima, Institute of control sciences lecture notes, Moscow, USSR, 1979. Presented at the IIASA workshop on generalized Lagrangians and their applications; IIASA, Laxenburg, Austria; 1979.
- Ferris MC. Weak sharp minima and penalty functions in mathematical programming [PhD thesis]. University of Cambridge; 1988.
- Lewis AS, Pang JS. Error bounds for convex inequality systems. In: Crouzeix JP, editor. Proceedings of the fifth symposium on generalized convexity; Luminy-Marseille; 1996.
- Henrion R, Outrata J. A subdifferential condition for calmness of multifunctions. J. Math. Anal. Appl. 2001;258:110–130.
- Burke JV, Lewis A, Overton M. Optimization matrix stability. Proc. Amer. Math. Soc. 2000;129:1635–1642.
- Burke JV, Lewis A, Overton M. Optimization stability and eigenvalue multiplicity. Found. Comput. Math. 2001;1:205–225.
- Jourani A. Hoffman’s error bounds, local controbility and sensitivity analysis. SIAM J. Control Optim. 2000;38:947–970.
- Burke JV, Ferris MC. Weak sharp minima in mathematical programming. SIAM J. Control Optim. 1993;31:1340–1359.
- Burke JV, Moré JJ. On the identification of active constraints. SIAM J. Numer. Anal. 1988;25:1197–1211.
- Ferris MC. Iterative linear programming solution of convex programs. J. Optim. Theory Appl. 1990;65:53–65.
- Osborne MR, Womersley RS. Strong uniqueness in sequential linear programming. J. Aust. Math. Soc. Ser. B. 1990;31:379–384.
- Li C, Wang X. On convergence of the Gauss–Newton method for convex composite optimization. Math. Program. 2002;91:349–356.
- Burke JV, Deng S. Weak sharp minima revisited, part I: basic theory. Control Cybern. 2002;31:439–469.
- Burke JV, Deng S. Weak sharp minima revisited, part II: applications to linear regularity and error bounds. Math. Program. 2005;104:235–261.
- Burke JV, Deng S. Weak sharp minima revisited, part III: error bounds for differentiable convex inclusions. Math. Program. 2009;116:37–56.
- Hestenes MR. Optimization theory: the finite dimensional case. New York (NY): Krieger; 1981.
- Zalinescu C. Weak sharp minima, well-behaving functions and global error bounds for convex inequalities in Banach spaces. In: Proc. 12th Baikal Internat Conf. on Optimization Methods and Their Appl. Irkutsk, Russia; 2001. p. 272–284.
- Marcotte P, Zhu DL. Weak sharp solutions of variational inequalities. SIAM J. Optim. 1998;9:179–189.
- Wu ZL, Wu SY. Weak sharp solutions of variational inequalities in Hilbert spaces. SIAM J. Optim. 2004;14:1011–1027.
- Hu YH, Song W. Weak sharp solutions for variational inequalities in Banach spaces. J. Math. Anal. Appl. 2011;374:118–132.
- Rahmo ED. Characterizations of weak sharp minima for lower-C1 functions. J. Math. Anal. Appl. 2013;397:619–627.
- Zheng XY, Yang XQ. Weak sharp minima for piecewise linear multiobjective optimization in normed spaces. Nonlinear Anal. 2008;68:3771–3779.
- Zheng XY, Yang XQ. Weak sharp minima for semi-infinite optimization problems with applications. SIAM J. Optim. 2004;18:573–588.
- Zheng XY, Ng KF. Strong KKT conditions and weak sharp minima in convex-composite optimization. Math. Program. 2009;126:259–279.
- Luo HL, Huang XX, Peng JW. Generalized weak sharp minima in cone-constrained convex optimization with applications. Comput. Optim. Appl. 2012;53:807–821.
- Walter R. On the metric projections onto convex sets in Riemannian spaces. Arch. Math. 1974;25:91–98.
- Udriste C. Convex functions and optimization methods on Riemannian manifolds. Vol. 297, Mathematics and its Applications. Dordrecht: Kluwer Academic; 1994.
- Ferreira OP, Oliveira PR. Proximal point algorithm on Riemannian manifolds. Optimization. 2002;51:257–270.
- Rapcsák T. Smooth nonlinear optimization in ℝn. Nonconvex Optim. Appl. Dordrecht: Kluwer Academic; 1997.
- Adler R, Dedieu JP, Margulies J, Martens M, Shub M. Newton’s method on Riemannian manifolds and a geometric model for the human spine. IMA J. Numer. Anal. 2002;22:359–390.
- Dedieu JP, Priouret P, Malajovich G. Newton’s method on Riemannian manifolds: covariant alpha theory. IMA J. Numer. Anal. 2003;23:395–419.
- Edelman A, Arias TA, Smith ST. The geometry of algorithms with orthogonality constraints. SIAM J. Matrix Anal. Appl. 1998;20:303–353.
- Ferreira OP, Svaiter BF. Kantorovich’s theorem on Newton’s method on Riemannian manifolds. J. Complexity. 2002;18:304–329.
- Li C, Wang JH. Newton’s method on Riemannian manifolds: Smale’s point estimate theory under the γ-condition. IMA J. Numer. Anal. 2006;26:228–251.
- Li C, López G, Martín-Márquez V. Monotone vector fields and the proximal point algorithm on Hadamard manifolds. J. Lond. Math. Soc. 2009;79:663–683.
- Azagra D, Ferrera J, López-Mesas M. Nonsmooth analysis and Hamilton-Jacobi equations on Riemannian manifolds. J. Funct. Anal. 2005;220:304–361.
- Ledyaev YS, Zhu QJ. Nonsmooth analysis on smooth manifolds. Trans. Amer. Math. Soc. 2007;359:3687–3732.
- Hosseini S, Pouryayevali MR. Generalized gradients and characterizations of epi-Lipschitz sets in Riemannian manifolds. Nonlinear Anal. 2011;74:3884–3895.
- Li C, Mordukhovich BS, Wang JH, Yao JC. Weak sharp minima on Riemannian manifolds. SIAM J. Optim. 2011;21:1523–1560.
- Klingenberg W. A course in differential geometry. Berlin: Springer; 1978.
- Chavel I. Riemannian geometry – a modern introduction. London: Cambridge University Press; 1993.
- Sakai T. Riemannian geometry. Vol. 149, Translations of Mathematical Monographs. Providence (RI): American Mathematical Society; 1996.
- Motreanu D, Pavel NH. Quasi-tangent vectors in flow-invariance and optimization problems on Banach manifolds. J. Math. Anal. Appl. 1982;88:116–132.