Robust error bounds for uncertain convex inequality systems with applications

References

• Azé D, Corvellec J-N. On the sensitivity analysis of Hoffman constants for systems of linear inequalities. SIAM J Optim. 2002;12:913–927.
   Web of Science ®Google Scholar
• Mangasarian OL, De Leone R. Error bounds for strongly convex programs and (super) linearly convergent iterative schemes for the least 2-norm solution of linear programs. Appl Math Optim. 1988;17:1–14.
   Web of Science ®Google Scholar
• Luo XQ, Tseng P. Error bound and convergence analysis of matrix splitting algorithms for the affine variational inequality problem. SIAM J Optim. 1992;2:43–54.
   Web of Science ®Google Scholar
• Hoffman AJ. On approximate solutions of systems of linear inequalities. J Res Nat Bur Standards. 1952;49:263–265.
   Google Scholar
• Klatte D. Hoffman error bound for systems of convex inequalities. Mathematical programming with data perturbations. New York (NY): Dekker; 1998. p. 185–199. (Lecture Notes in Pure and Appl. Math.; 195).
   Google Scholar
• Lewis AS, Pang JS. Error bounds for convex inequality systems generalized convexity, generalized monotonicity. In: Crouzeix, JP, Martinez-Legaz, JE, Volle, M, editors, 1998. p. 75–110.
   Google Scholar
• Pang JS. Error bounds in mathematical programming. Math Program. 1997;79:299–332.
   Web of Science ®Google Scholar
• Yang WH. Error bounds for convex polynomials. SIAM J Optim. 2008;19:1633–1647.
   Web of Science ®Google Scholar
• Mangasarian OL. A condition number for differentiable connvex inequalities. Math Oper Res. 1985;10:175–179.
   Web of Science ®Google Scholar
• Auslender AA, Crouzeix JP. Global regularity theorems. Math Oper Res. 1988;13:243–253.
   Web of Science ®Google Scholar
• Luo XD, Luo XQ. Extension of Hoffman's error bound to polynomial systems. SIAM J Optim. 1994;4:383–392.
   Web of Science ®Google Scholar
• Ioffe AD. Regular points of Lipschitz functions. Trans Amer Math Soc. 1979;251:61–69.
   Web of Science ®Google Scholar
• Deng S. Computable error bounds for convex inequality systems in reflexive Banach spaces. SIAM J Optim. 1997;7:274–279.
   Web of Science ®Google Scholar
• Ngai HV, Théra M. Error bounds for convex differentiable inequality systems in Banach spaces. Math Program Ser B. 2005;104:465–482.
   Web of Science ®Google Scholar
• Deng S. Global error bounds for convex inequality systems in Banach spaces. SIAM J Optim. 1998;36:1240–1249.
   Web of Science ®Google Scholar
• Ben-Tal A, Ghaoui LE, Nemirovski A. Robust optimization. Princeton (NJ): Princeton University Press; 2009. (Princeton Series in Applied Mathematics).
   Google Scholar
• Bertsimas D, Brown DB, Caramanis C. Theory and applications of robust optimization. SIAM Rev. 2011;53:464–501.
   Web of Science ®Google Scholar
• Ben-Tal A, Nemirovski A. Robust convex optimization. Math Oper Res. 1998;23:769–805.
   Web of Science ®Google Scholar
• Jeyakumar V, Lee GM, Li GY. Characterizing robust solution sets of convex programs under data uncertainty. J Optim Theory Appl. 2015;164:407–435.
   Web of Science ®Google Scholar
• Jeyakumar V, Li G. A new class of alternative theorems for SOS-convex inequalities and robust optimization. Appl Anal. 2015;94:56–74.
   Web of Science ®Google Scholar
• Sun XK, Chai Y. On robust duality for fractional programming with uncertainty data. Positivity. 2014;18:9–28.
   Web of Science ®Google Scholar
• Wei HZ, Chen CR, Li SJ. Robustness to uncertain optimization using scalarization techniques and relations to multiobjective optimization. Appl Anal. 2019;98:851–866.
   Web of Science ®Google Scholar
• Huang L, Chen JW. Weighted robust optimality of convex optimization problems with data uncertainty. Optim Lett. 2020;14:1089–1105.
   Web of Science ®Google Scholar
• Chuong TD, Jeyakumar V. Characterizing local error bounds for linear inequality systems under data uncertainty. Linear Algebra Appl. 2016;489:199–216.
   Web of Science ®Google Scholar
• Chuong TD, Jeyakumar V. Robust global error bounds for uncertain linear inequality systems with applications. Linear Algebra Appl. 2016;493:183–205.
   Web of Science ®Google Scholar
• Chuong TD. Radius of robust global error bound for piecewise linear inequality systems. J Optim Theory Appl. 2021; 10.1007/s10957-021-01924-w.
   Web of Science ®Google Scholar
• Li XB, AI-Homidan S, Ansari QH, et al. Robust Farkas-Minkowski constraint qualification for convex inequality system under data uncertainty. J Optim Theory Appl. 2020;185:785–802.
   Web of Science ®Google Scholar
• Zolezzi T. Well-posedness and optimization under perturbations. Ann Oper Res. 2001;101:351–361.
   Web of Science ®Google Scholar
• Ekeland I. On the variational principle. J Math Anal Appl. 1974;47:324–353.
   Web of Science ®Google Scholar
• Rockafellar RT. Convex analysis. Princeton (NJ): Princeton University Press; 1970.
   Google Scholar
• Mordukhovich BS, Nam NM. An easy path to covex analysis and applications. Williston (ND): Morgan & Clapool Publishers; 2014. (Synth. Lect. Math. Stat.; 14).
   Google Scholar
• Bochnak J, Coste M, Roy M-F. Real algebraic geometry. Berlin: Springer; 1998.
   Google Scholar