Abstract

Error bounds are central objects in optimization theory and its applications. They were for a long time restricted only to the theory before becoming over the course of time a field by itself. This paper is devoted to the study of error bounds of a general inequality defined by a proper lower semicontinuous function on an Asplund space. If one drops the convexity assumption, the dual characterization of error bounds for a general inequality may not be valid, but even in this case, several dual necessary conditions are still obtained in terms of Fréchet/Mordukhovich subdifferentials of the concerned function at points in the solution set. Moreover, for an inequality defined by a convex-composite function that is to say by a function which is the composition of a convex function with a smooth mapping, such dual conditions also turn out to be sufficient to have the error bound property. Our work is an extension of the results on dual characterizations of convex inequalities to the possibly non-convex case.

Author information

Contact details are reproduced from the original publication and may be historical.

Zhou Wei

Hebei Key Laboratory of Machine Learning and Computational Intelligence,
College of Mathematics and Information Science, Hebei University, Baoding, China

weizhou@hbu.edu.cn

Jen-Chih Yao

Research Center for Interneural Computing, China Medical University Hospital, Taichung, Taiwan
and: China Medical University, Taichung, Taiwan

yaojc@mail.cmu.edu.tw

Keywords

  • Error bound
  • Fréchet subdifferential
  • Mordukhovich subdifferential
  • fuzzy calculus
  • Asplund space

Mathematics Subject Classification

90C31, 90C25, 49J52, 46B20

References

  1. M. Abbasi, M. Théra: About Error bounds in metrizable topological vector spaces, Set-Valued Var. Analysis 30 (2022) 1291–1311.https://doi.org/10.1007/s11228-022-00643-2Google Scholar
  2. A. Auslender, J.-P. Crouzeix: Global regularity theorems, Math. Oper. Res. 13/2 (1988) 243–253.https://doi.org/10.1287/moor.13.2.243Google Scholar
  3. D. Aussel, A. Daniilidis, L. Thibault: Subsmooth sets: functional characterizations and related concepts, Trans. Amer. Math. Soc. 357/4 (2005) 1275–1301.https://doi.org/10.1090/S0002-9947-04-03718-3Google Scholar
  4. D. Azé, J.-N. Corvellec: Characterizations of error bounds for lower semicontinuous functions on metric spaces, ESAIM Control Optim. Calc. Var. 10/3 (2004) 409–425.https://doi.org/10.1051/cocv:2004013Google Scholar
  5. H. H. Bauschke, J. M. Borwein: On projection algorithms for solving convex feasibility problems, SIAM Review 38/3 (1996) 367–426.https://doi.org/10.1137/S0036144593251710Google Scholar
  6. A. Beck, M. Teboulle: Convergence rate analysis and error bounds for projection algorithms in convex feasibility problems, Optimization Methods Software 18/4 (2003) 377–394.https://doi.org/10.1080/10556780310001604977Google Scholar
  7. E. M. Bednarczuk, A. Y. Kruger: Error bounds for vector-valued functions: necessary and sufficient conditions, Nonlinear Analysis 75/3 (2012) 1124–1140.https://doi.org/10.1016/j.na.2011.05.098Google Scholar
  8. J. M. Borwein, Q. J. Zhu: Techniques of Variational Analysis, Springer, New York (2005).Google Scholar
  9. J. V. Burke, S. Deng: Weak sharp minima revisited. I: Basic theory, Control Cybern. 31/3 (2002) 439–469.Google Scholar
  10. J. V. Burke, S. Deng: Weak sharp minima revisited. II: Application to linear regularity and error bounds, Math. Programming B 104/2-3 (2005) 235–261.https://doi.org/10.1007/s10107-005-0615-2Google Scholar
  11. M. J. Cánovas, A. Y. Kruger, M. A. López, J. Parra, M. A. Théra: Calmness modulus of linear semi-infinite programs, SIAM J. Optimization 24/1 (2014) 29–48.https://doi.org/10.1137/130907008Google Scholar
  12. P. L. Combettes: Hilbertian convex feasibility problem: convergence of projection methods, Appl. Math. Optim. 35/3 (1997) 311–330.https://doi.org/10.1007/BF02683333Google Scholar
  13. J. N. Corvellec, V. V. Motreanu: Nonlinear error bounds for lower semicontinuous functions on metric spaces, Math. Programming A 114/2 (2008) 291–319.https://doi.org/10.1007/s10107-007-0102-zGoogle Scholar
  14. N. D. Cuong, A. Y. Kruger: Error Bounds revisited, Optimization 71/4 (2022) 1021–1053.https://doi.org/10.1080/02331934.2022.2032695Google Scholar
  15. M. Fabian: Subdifferentiability and trustworthiness in the light of a new variational principle of Borwein and Preiss, Acta Univ. Carol., Math. Phys. 30/2 (1989) 51–56.Google Scholar
  16. M. J. Fabian, R. Henrion, A. Y. Kruger, J. Outrata: Error bounds: necessary and sufficient conditions, Set-Valued Var. Analysis 18/2 (2010) 121–149.https://doi.org/10.1007/s11228-010-0133-0Google Scholar
  17. H. Gfrerer: First order and second order characterizations of metric subregularity and calmness of constraint set mappings, SIAM J. Optim. 21/4 (2011) 1439–1474.https://doi.org/10.1137/100813415Google Scholar
  18. O. Güler: Augmented Lagrangian algorithms for linear programming, J. Optim. Theory Appl. 75/3 (1992) 445–470.https://doi.org/10.1007/BF00940486Google Scholar
  19. A. J. Hoffman: On approximate solutions of systems of linear inequalities, J. Research Nat. Bur. Standards 49 (1952) 263–265.https://doi.org/10.6028/jres.049.027Google Scholar
  20. L. R. Huang, K. F. Ng: On first- and second-order conditions for error bounds, SIAM J. Optim. 14/4 (2004) 1057–1073.https://doi.org/10.1137/S1052623401390549Google Scholar
  21. V. N. Huynh, M. Théra: Error bounds and implicit multifunction theorem in smooth Banach spaces and applications to optimization, Set-Valued Var. Analysis 12/1-2 (2004) 195–223.https://doi.org/10.1023/B:SVAN.0000023396.58424.98Google Scholar
  22. A. D. Ioffe: Regular points of Lipschitz functions, Trans. Amer. Math. Soc. 251 (1979) 61–69.https://doi.org/10.1090/S0002-9947-1979-0531969-6Google Scholar
  23. A. D. Ioffe: Metric regularity – a survey. I: Theory, J. Aust. Math. Soc. 101/2 (2016) 188–243.https://doi.org/10.1017/S1446788715000701Google Scholar
  24. A. D. Ioffe: Metric regularity – a survey. II; Applications, J. Aust. Math. Soc. 101/3 (2016) 376–417.https://doi.org/10.1017/S1446788715000695Google Scholar
  25. A. D. Ioffe: Variational Analysis of Regular Mappings, Springer Monographs in Mathematics. Springer, Cham (2017).https://doi.org/10.1007/978-3-319-64277-2Google Scholar
  26. A. N. Iusem, A. R. De Pierro: On the convergence properties of Hildreth’s quadratic programming algorithm, Math. Programming A 47/1 (1990) 37–51.https://doi.org/10.1007/BF01580851Google Scholar
  27. A. Jourani: Hoffman’s error bound, local controllability, and sensitivity analysis, SIAM J. Control Optim. 38/3 (2000) 947–970.https://doi.org/10.1137/S0363012998339216Google Scholar
  28. D. Klatte, W. Li: Asymptotic constraint qualifications and global error bounds for convex inequalities, Math. Programming A 84/1 (1999) 137–160.https://doi.org/10.1007/s10107980002aGoogle Scholar
  29. A. Y. Kruger, M. A. López, X. Yang, J. Zhu: Hölder error bounds and Hölder calmness with applications to convex semi-infinite optimization, Set-Valued Var. Analysis 27/4 (2019) 995–1023.https://doi.org/10.1007/s11228-019-0504-0Google Scholar
  30. A. S. Lewis, J.-S. Pang: Error bounds for convex inequality systems, Nonconvex Optim. Appl. 27 (1998) 75–110.https://doi.org/10.1007/978-1-4613-3341-8_3Google Scholar
  31. D. R. Luke, N. H. Thao, M. K. Tam: Implicit error bounds for Picard iterations on Hilbert spaces, Vietnam J. Math. 46/2 (2018) 243–258.https://doi.org/10.1007/s10013-018-0279-xGoogle Scholar
  32. Z.-Q. Luo, P. Tseng: On a global error bound for a class of monotone affine variational inequality problems, Oper. Res. Letters 11/3 (1992) 159–165.https://doi.org/10.1016/0167-6377(92)90080-MGoogle Scholar
  33. O. L. Mangasarian: A condition number for differentiable convex inequalities, Math. Oper. Res. 10/2 (1985) 175–179.https://doi.org/10.1287/moor.10.2.175Google Scholar
  34. B. S. Mordukhovich: Variational Analysis and Generalized Differentiation I, Springer, New York (2006).https://doi.org/10.1007/3-540-31246-3Google Scholar
  35. B. S. Mordukhovich, Y. Shao: Nonsmooth sequential analysis in Asplund spaces, Trans. Amer. Math. Soc. 348 (1996) 1235–1280.https://doi.org/10.1090/S0002-9947-96-01543-7Google Scholar
  36. K. F. Ng, X. Y. Zheng: Error bounds for lower semicontinuous functions in normed spaces, SIAM J. Optim. 12/1 (2001) 1–17.https://doi.org/10.1137/S1052623499358884Google Scholar
  37. H. V. Ngai, M. Théra: Metric inequality, subdifferential calculus and applications, Set-Valued Var. Analysis 9/1-2 (2001) 187–216.https://doi.org/10.1023/A:1011291608129Google Scholar
  38. H. V. Ngai, M. Théra: Error bounds for systems of lower semicontinuous functions in Asplund spaces, Math. Programming B 116/1-2 (2009) 397–427.https://doi.org/10.1007/s10107-007-0121-9Google Scholar
  39. J.-S. Pang: Error bounds in mathematical programming, Math. Programming B 79/1-3 (1997) 299–332.https://doi.org/10.1007/BF02614322Google Scholar
  40. J.-P. Penot: Calculus without Derivatives, Graduate Texts in Mathematics Vol. 266, Springer, New York (2013).https://doi.org/10.1007/978-1-4614-4538-8Google Scholar
  41. R. R. Phelps: Convex Functions, Monotone Operators and Differentiability, Lecture Notes in Mathematics 1364, 2nd ed., Springer, Berlin (1993).Google Scholar
  42. S. M. Robinson: Bounds for error in the solution set of a perturbed linear program, Linear Algebra Appl. 6 (1973) 69–81.https://doi.org/10.1016/0024-3795(73)90007-4Google Scholar
  43. S. M. Robinson: An application of error bounds for convex programming in a linear space, SIAM J. Control 13 (1975) 271–273.https://doi.org/10.1137/0313015Google Scholar
  44. S. M. Robinson: A characterization of stability in linear programming, Operations Res. 25/3 (1977) 435–447.https://doi.org/10.1287/opre.25.3.435Google Scholar
  45. L. Thibault: Unilateral Variational Analysis in Banach Spaces, World Scientific, Singapore (2023).https://doi.org/10.1142/12797Google Scholar
  46. P. Tseng, D. P. Bertsekas: On the convergence of the exponential multiplier method for convex programming, Math. Programming A 60/1 (1993) 1–19.https://doi.org/10.1007/BF01580598Google Scholar
  47. Z. Wei, M. Théra, J.-C. Yao: Subtransversality and strong CHIP of closed sets in Asplund spaces, Set-Valued Var. Analysis 32/3 (2024), art.no. 23, 30p.https://doi.org/10.1007/s11228-024-00727-1Google Scholar
  48. Z. Wu, J. J. Ye: On error bounds for lower semicontinuous functions, Math. Programming A 92/2 (2002) 301–314.https://doi.org/10.1007/s101070100278Google Scholar
  49. D. Yost: Asplund spaces for beginners, Acta Univ. Carolinae Math. Phys. 34/2 (1993) 159–177.Google Scholar
  50. X. Y. Zheng, K. F. Ng: Metric regularity and constraint qualifications for convex inequalities on Banach spaces, SIAM J. Optim. 14/3 (2004) 757–772.https://doi.org/10.1137/S1052623403423102Google Scholar
  51. X. Y. Zheng, K. F. Ng: Linear regularity for a collection of subsmooth sets in Banach spaces, SIAM J. Optim. 19/1 (2008) 62–76.https://doi.org/10.1137/060659132Google Scholar
  52. X. Y. Zheng, K. F. Ng: Metric subregularity and calmness for nonconvex generalized equations in Banach spaces, SIAM J. Optim. 20/5 (2010) 2119–2136.https://doi.org/10.1137/090772174Google Scholar
  53. X. Y. Zheng, K. F. Ng: Metric subregularity for proximal generalized equations in Hilbert spaces, Nonlinear Analysis Theor. Appl. 75/3 (2012) 1686–1699.https://doi.org/10.1016/j.na.2011.07.004Google Scholar

Suggested citation

Z. Wei, M. Théra, J.-C. Yao. “On Error Bounds of Inequalities in Asplund Spaces.” Journal of Convex Analysis 33 (2026), No. 3&4, 1077–1094. https://doi.org/10.68381/jca33057

Download BibTeXPublished by Heldermann Verlag.

Published by Heldermann Verlag, 2026. Rights now held by Banach Press LLC.