半无限拟凸优化问题的最优性条件之研究
Optimality Conditions in Semi-Infinite Quasiconvex Optimization
摘要: 考虑目标函数和约束函数均是上半连续拟凸函数的半无限规划问题，通过引入弱Slater约束规范条件，刻画了该问题基于Greenberg-Pierskalla次微分及v-次微分的KKT类最优性条件。
Abstract: Considering semi-infinite programming problems where both the objective and constraint functions are upper semicontinuous quasiconvex, we characterize KKT-type optimality conditions for such problems based on the Greenberg-Pierskalla subdifferential and the v-subdifferential by introducing a weak Slater constraint qualification.
文章引用：余文敏. 半无限拟凸优化问题的最优性条件之研究[J]. 应用数学进展, 2025, 14(10): 70-77. https://doi.org/10.12677/aam.2025.1410420

参考文献

[1] Fang, D.H., Li, C.H. and Ng, K.F. (2010) Constraint Qualifications for Extended Farkas's Lemmas and Lagrangian Dualities in Convex Infinite Programming. SIAM Journal on Optimization, 20, 1311-1332. [Google Scholar] [CrossRef] 
[2] Fang, D.H. and Wang, M.D. (2017) Study on the Lagrange Dualities for Composite Optimization Problems with Conical Constraints. Journal of Systems Science and Mathematical Sciences, 37, 203-211.
[3] Fang, D.H., Li, C. and Ng, K.F. (2010) Constraint Qualifications for Optimality Conditions and Total Lagrange Dualities in Convex Infinite Programming. Nonlinear Analysis: Theory, Methods & Applications, 73, 1143-1159. [Google Scholar] [CrossRef] 
[4] Fang, D.H., Yang, T. and Liou, Y.C. (2022) Strong and Total Lagrange Dualities for Quasiconvex Programming. Journal of Nonlinear and Variational Analysis, 6, 1-5.
[5] Jeyakumar, V. (1997) Asymptotic Dual Conditions Characterizing Optimality for Infinite Convex Programs. Journal of Optimization Theory and Applications, 93, 153-165. [Google Scholar] [CrossRef] 
[6] Bot, R.I. (2009) Conjugate Duality in Convex Optimization.: Springer Science & Business Media.
[7] Boţ, R.I. and Grad, S. (2010) Wolfe Duality and Mond-Weir Duality via Perturbations. Nonlinear Analysis: Theory, Methods & Applications, 73, 374-384. [Google Scholar] [CrossRef] 
[8] Penot, J.P. (2003) Characterization of Solution Sets of Quasiconvex Programs. Journal of Optimization Theory and Applications, 117, 627-636. [Google Scholar] [CrossRef] 
[9] Suzuki, S. and Kuroiwa, D. (2015) Characterizations of the Solution Set for Quasiconvex Programming in Terms of Greenberg-Pierskalla Subdifferential. Journal of Global Optimization, 62, 431-441. [Google Scholar] [CrossRef] 
[10] Suzuki, S. and Kuroiwa, D. (2017) Characterizations of the Solution Set for Non-Essentially Quasiconvex Programming. Optimization Letters, 11, 1699-1712. [Google Scholar] [CrossRef] 
[11] Suzuki, S. (2021) Karush-Kuhn-Tucker Type Optimality Condition for Quasiconvex Programming in Terms of Greenberg-Pierskalla Subdifferential. Journal of Global Optimization, 79, 191-202. [Google Scholar] [CrossRef] 
[12] Greenberg, H.J. and Pierskalla, W.P. (1973) Quasi-Conjugate Functions and Surrogate Duality. Cahiers du Centre détude de Recherche Operationelle, 15, 437-448.
[13] Jeyakumar, V., Rubinov, A.M., Glover, B.M. and Ishizuka, Y. (1996) Inequality Systems and Global Optimization. Journal of Mathematical Analysis and Applications, 202, 900-919. [Google Scholar] [CrossRef] 
[14] Penot, J.P. (1998) Are Generalized Derivatives Useful for Generalized Convex Functions. In: Generalized Convexity, Generalized Monotonicity: Recent Results, Springer, 3-59.
[15] Fang, D.H. and Zhang, Y. (2020) Optimality Conditions and Total Dualities for Conic Programming Involving Composite Function. Optimization, 69, 305-327. [Google Scholar] [CrossRef] 
[16] Fang, D.H. and Zhang, Y. (2018) Extended Farkas’s Lemmas and Strong Dualities for Conic Programming Involving Composite Functions. Journal of Optimization Theory and Applications, 176, 351-376. [Google Scholar] [CrossRef] 
[17] Rockafellar, R.T. and Wets, R.J. (1998) Variational Geometry. In: Variational Analysis, Springer, 196-237.
[18] Kanzi, N., Caristi, G. and Sadeghieh, A. (2018) Optimality Conditions for Semi-Infinite Programming Problems Involving Generalized Convexity. Optimization Letters, 13, 113-126. [Google Scholar] [CrossRef] 
[19] Deutsch, F., Li, W. and Ward, J.D. (1999) 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 Journal on Optimization, 10, 252-268.
[20] Li, C., Ng, K.F. and Pong, T.K. (2007) The SECQ, Linear Regularity, and the Strong CHIP for an Infinite System of Closed Convex Sets in Normed Linear Spaces. SIAM Journal on Optimization, 18, 643-665. [Google Scholar] [CrossRef] 
[21] Bauschke, H.H., Borwein, J.M. and Li, W. (1999) Strong Conical Hull Intersection Property, Bounded Linear Regularity, Jameson’s Property (G), and Error Bounds in Convex Optimization. Mathematical Programming, 86, 135-160. [Google Scholar] [CrossRef] 
[22] Hiriart-Urruty, J.B. and Lemaréchal, C. (1993) Convex Analysis and Minimization Algorithms I: Fundamentals. Springer.

为你推荐