Lagrange multiplier characterizations of robust best approximations under constraint data uncertainty

Journal of Mathematical Analysis and Applications

Volumn 393, Issue 1, 2012, Pages 285-297

  Jeyakumar, V ^a   Wang, J H ^b   Li, G ^a  

^a UNIVERSITY OF NEW SOUTH WALES   (Australia)

^b ZHEJIANG UNIVERSITY OF TECHNOLOGY   (China)

Author keywords

Best approximation; Ellipsoidal uncertainty; Robust optimization; Shape preserving interpolation; Strong conical hull intersection property

Indexed keywords

EID: 84860747788     PISSN: 0022247X     EISSN: 10960813     Source Type: Journal    
DOI: 10.1016/j.jmaa.2012.03.037     Document Type: Article

References (21)

1. Deutsch F. Best Approximation in Inner Product Spaces 2000, Springer-Verlag, New York.
2. Deutsch F., Li W., Swetits J. Fenchel duality and the strong conical hull intersection property. J. Optim. Theory Appl. 1999, 102:681-695.
3. Deutsch F., Li W., Ward J. A dual approach to constrained interpolation from a convex subset of Hilbert space. J. Approx. Theory 1997, 90:385-444.
4. Deutsch F., Li W., Ward J.D. Best approximation from the intersection of a closed convex set and a polyhedron in Hilbert space, weak Slater conditions, and the strong conical hull intersection property. SIAM J. Optim. 1999, 10:252-268.
5. Jeyakumar V. The strong conical hull intersection property for convex programming. Math. Program. Ser. A 2006, 106:81-92.
6. Jeyakumar V., Mohebi H. A global approach to nonlinearly constrained best approximation. Numer. Funct. Anal. Optim. 2005, 26(2):205-227.
7. Li C., Jin X. Nonlinearly constrained best approximation in Hilbert spaces: the strong CHIP, and the basic constraint qualification. SIAM J. Optim. 2002, 13(1):228-239.
8. Li C., Ng K.F. Constraint qualification, the strong CHIP and best approximation with convex constraints in Banach spaces. SIAM J. Optim. 2003, 14:584-607.
9. Bertsimas D., Brown D., Caramanis C. Theory and applications of robust optimization. SIAM Rev. 2011, 53:464-501.
10. Ben-Tal A., Ghaoui L.E., Nemirovski A. Robust Optimization. Princeton Series in Applied Mathematics 2009.
11. Jeyakumar V., Li G. Characterizing robust set containments and solutions of uncertain linear programs without qualifications. Oper. Res. Lett. 2010, 38:188-194.
12. Jeyakumar V., Li G. A robust von-Neumann minimax theorem for zero-sum games under bounded payoff uncertainty. Oper. Res. Lett. 2011, 39(2):109-114.
13. Shapiro A., Dentcheva D., Ruszczynski A. Lectures on Stochastic Programming: Modeling and Theory 2009, SIAM, Philadelphia.
14. Jeyakumar V., Li G. Strong duality in robust convex programming: complete characterizations. SIAM J. Optim. 2010, 6:3384-3407.
15. Jeyakumar V., Mohebi H. Limiting E-subgradient characterizations of constrained best approximation. J. Approx. Theory 2005, 135(2):145-159.
16. Zǎlinescu C. Convex Analysis in General Vector Spaces 2002, World Scientific, London.
17. Li G., Ng K.F. On extension of Fenchel duality and its application. SIAM J. Optim. 2008, 19:1489-1509.
18. Jeyakumar V., Lee G.M., Dinh N. New sequential Lagrange multiplier conditions characterizing optimality without constraint qualification for convex programs. SIAM J. Optim. 2003, 14(2):534-547.
19. Burachik R.S., Jeyakumar V. A simple closure condition for the normal cone intersection formula. Proc. Amer. Math. Soc. 2004, 133(6):1741-1748.
20. Deutsch F. The role of conical hull intersection property in convex optimization and approximation. Approximation Theory IX 1998, Vanderbilt University Press, Nashville, TN. C.K. Chui, L.L. Schumaker (Eds.).
21. Kanzow C., Ferenczi I., Fukushima M. On the local convergence of semismooth Newton methods for linear and nonlinear second-order cone programs without strict complementarity. SIAM J. Optim. 2009, 20(1):297-320.