Optimality conditions for nonsmooth semidefinite programming via convexificators
Tóm tắt
This study is devoted to the semidefinite optimization problems with inequality constraints. We use the notion of convexificators to establish optimality conditions for nonsmooth semidefinite optimization problems. Moreover, we introduce appropriate constraint qualifications to present the Karush–Kuhn–Tucker multipliers.
Tài liệu tham khảo
Bazaraa, M.S., Sherali, H.D., Shetty, C.M.: Nonlinear Programming: Theory and Algorithms, 3rd edn. Wiley-Interscience, Hoboken (2006)
Berman, A., Shaked-Monderer, N.: Completely Positive Matrices. World Scientific Publishing Co., Inc., River Edge (2003)
Bhatia, R.: Matrix Analysis, Graduate Texts in Mathematics, vol. 169. Springer, New York (1997)
Boyd, S., El Ghaoui, L., Feron, E., Balakrishnan, V.: Linear Matrix Inequalities in System and Control Theory, SIAM Studies in Applied Mathematics, vol. 15. Society for Industrial and Applied Mathematics (SIAM), Philadelphia (1994)
Clarke, F.H.: Optimization and Nonsmooth Analysis, Classics in Applied Mathematics, vol. 5, 2nd edn. Society for Industrial and Applied Mathematics (SIAM), Philadelphia (1990)
Demyanov, V.F., Jeyakumar, V.: Hunting for a smaller convex subdifferential. J. Glob. Optim. 10, 305–326 (1997)
Dutta, J., Chandra, S.: Convexifactors, generalized convexity and vector optimization. Optimization 53, 77–94 (2004)
Fan, J.: Generalized separation theorems and the Farkas’ lemma. Appl. Math. Lett. 18, 791–796 (2005)
Goemans, M.X.: Semidefinite programming in combinatorial optimization. Math. Progr. Ser. B 79, 143–161 (1997)
Golestani, M., Nobakhtian, S.: Convexificators and strong Kuhn–Tucker conditions. Comput. Math. Appl. 64, 550–557 (2012)
Golestani, M., Nobakhtian, S.: Nonsmooth multiobjective programming and constraint qualifications. Optimization 62, 783–795 (2013)
Golestani, M., Nobakhtian, S.: Nonsmooth multiobjective programming: strong Kuhn–Tucker conditions. Positivity 13, 711732 (2013)
Jeyakumar, V., Luc, D.T.: Approximate Jacobian matrices for nonsmooth continuous maps and \(C^{1}\)-optimization. SIAM J. Control Optim. 36(1998), 1815–1832 (1998)
Jeyakumar, V., Luc, D.T.: Nonsmooth calculus, minimality, and monotonicity of convexificators. J. Optim. Theory Appl. 101, 599–621 (1999)
Kanzow, C., Nagel, C., Kato, H., Fukushima, M.: Successive linearization methods for nonlinear semidefinite programs. Comput. Optim. Appl. 31, 251–273 (2005)
Lewis, A.S., Overton, M.L.: Eigenvalue optimization. Acta Numer. 5, 149–190 (1996)
Luc, D.T.: A multiplier rule for multiobjective programming problems with continuous data. SIAM J. Optim. 13, 168–178 (2002)
Michel, P., Penot, J.P.: A generalized derivative for calm and stable functions. Differ. Integr. Equ. 5, 433–454 (1992)
Mordukhovich, B.S.: Variational analysis and generalized differentiation. I. Basic theory. Grundlehren der Mathematischen Wissenschaften [Fundamental Principles of Mathematical Sciences], vol. 330. Springer, Berlin (2006)
Mordukhovich, B.S., Shao, Y.H.: On nonconvex subdifferential calculus in Banach spaces. J. Convex Anal. 2, 211–227 (1995)
Rockafellar, R.T., Wets, R.J.B.: Variational analysis, Grundlehren der Mathematischen Wissenschaften [Fundamental Principles of Mathematical Sciences], vol. 317. Springer, Berlin (1998)
Suneja, S.K., Kohli, B.: Optimality and duality results for bilevel programming problem using convexifactors. J. Optim. Theory Appl. 150, 1–19 (2011)
Todd, M.J.: Semidefinite optimization. Acta Numer. 10, 515–560 (2001)
Treiman, J.S.: The linear nonconvex generalized gradient and Lagrange multipliers. SIAM J. Optim. 5, 670–680 (1995)
Uderzo, A.: Convex approximators, convexificators and exhausters: applications to constrained extremum problems. In: Quasidifferentiability and related topics, Nonconvex Optimization Applications, vol. 43, pp. 297–327. Kluwer Acad. Publ., Dordrecht (2000)
Zangwill, W.I., Mond, B.: Nonlinear programming: a unified approach. Prentice-Hall Inc., Englewood Cliffs (1969)