带锥约束的复合优化问题的最优性条件

Abstract

Abstract:

By using the properties of subdifferentials, some new constraint qualifications are obtained, which characterize completely some optimality conditions for composite optimization problem with conical constraints. Moreover, saddle point theorems for the Lagrange function of this optimization problem are also given. Our results extend the corresponding results in the previous papers.

Key words: Composite optimization problem, Optimality condition, Saddle point, Conic programming

CLC Number:

O221.2

Lingli Hu, Donghui Fang. Optimality Conditions for Composite Optimization Problems with Conical Constraints[J].Acta mathematica scientia,Series A, 2018, 38(6): 1112-1121.

Trendmd

References 13

1	Boţ R I , Grad S M , Wanka G . On strong and total Lagrange duality for convex optimization problems. J Math Anal Appl, 2008, 337: 1315- 1325 doi: 10.1016/j.jmaa.2007.04.071
2	Boţ R I , Grad S M , Wanka G . New regularity conditions for strong and total Fenchel-Lagrange duality in infinite dimensional spaces. Nonlinear Anal, 2008, 69: 323- 336 doi: 10.1016/j.na.2007.05.021
3	Fang D H , Li C , Ng K F . Constraint qualifications for optimality conditions and total Lagrangian dualities in convex infinite programming. Nonlinear Anal, 2010, 73: 1143- 1159 doi: 10.1016/j.na.2010.04.020
4	Dinh N , Mordukhovich B S , Nghia T T A . Qualification and optimality conditions for DC programs with infinite constraints. Acta Math Vietnamica, 2009, 34: 123- 153
5	Dinh N , Mordukhovich B S , Nghia T T A . Subdifferentials of value functions and optimality conditions for DC and bilevel infinite and semi-infinite programs. Math Program, 2010, 123: 101- 138 doi: 10.1007/s10107-009-0323-4
6	Jeyakumar V , Lee G M . Complete characterization of stable Farkas' lemma and cone-convex programming duality. Math Program Ser A, 2008, 114: 335- 347 doi: 10.1007/s10107-007-0104-x
7	Sun X K , Chai Y . Optimality conditions for DC fractional programming problems. Advan Math, 2014, 18: 9- 28
8	Li G , Zhou Y Y . The stable Farkas lemma for composite convex functions in infinite dimensional spaces. Acta Math Appl Sin, 2015, 31: 677- 692 doi: 10.1007/s10255-015-0493-1
9	方东辉, 王梦丹. 锥复合优化问题的Lagrange对偶. 系统科学与数学, 2017, 37: 203- 211
	Fang D H , Wang M D . Study on the Lagrange dualities for composite optimization problems with conical constraints. J Sys Sci Math Sci, 2017, 37: 203- 211
10	Fang D H , Gong X . Extended Farkas lemma and strong duality for composite optimization problems with DC functions. Optim, 2017, 66: 179- 196 doi: 10.1080/02331934.2016.1266628
11	Boţ R I , Grad S M , Wanka G . A new constraint qualification for the formula of the subdifferential of composed convex functions in infinite dimensional spaces. Math Nachr, 2008, 281: 1- 20 doi: 10.1002/(ISSN)1522-2616
12	Dinh N , Vallet G , Volle M . Functional inequalities and theorems of the alternative involving composite functions. J Gold Optim, 2014, 59: 837- 863 doi: 10.1007/s10898-013-0100-z
13	Zǎlinescu C . Convex Analysis in General Vector Spaces. New Jersey: World Scientific, 2002

[1]	Chen Hongye, Fang Donghui, Wu Kexing. Optimality Conditions and Total Lagrange Dualities for Evenly Convex Optimization Problems [J]. Acta mathematica scientia,Series A, 2025, 45(4): 1255-1267.
[2]	Fang Donghui,Wang Junying. Characterizations of Approximate Solution and Approximate Duality for Quasiconvex Programming [J]. Acta mathematica scientia,Series A, 2025, 45(2): 640-652.
[3]	Nie Jialin, Long Xianjun. A Golden Ratio Primal-Dual Algorithm for a Class of Nonsmooth Saddle Point Problems [J]. Acta mathematica scientia,Series A, 2024, 44(4): 1080-1091.
[4]	Hu Shanshan, He Suxiang. Optimality Conditions for Non-Negative Group Sparse Constrained Optimization Problems [J]. Acta mathematica scientia,Series A, 2024, 44(2): 500-512.
[5]	Jiaolang Wang,Donghui Fang. Approximate Optimality Conditions and Mixed Type Duality for a Class of Non-Convex Optimization Problems [J]. Acta mathematica scientia,Series A, 2022, 42(3): 651-660.
[6]	Tingwei Pan,Suxiang He. The Greedy Simplex Algorithm for Double Sparsity Constrained Optimization Problems [J]. Acta mathematica scientia,Series A, 2022, 42(3): 920-933.
[7]	Shengxin Hua,Guolin Yu,Wenyan Han,Xiangyu Kong. Characterization of Optimality to Constrained Vector Equilibrium Problems via Approximate Subdifferential [J]. Acta mathematica scientia,Series A, 2022, 42(2): 365-378.
[8]	Lingli Hu,Liping Tian,Donghui Fang. Optimality Conditions for DC Composite Optimization Problems with Conical Constraints [J]. Acta mathematica scientia,Series A, 2021, 41(4): 1079-1087.
[9]	Dongping Ye,Donghui Fang. Lagrange Dualities for Robust Composite Optimization Problems [J]. Acta mathematica scientia,Series A, 2020, 40(4): 1095-1107.
[10]	Meng Li,Guolin Yu. Optimality of Robust Approximation Solutions for Uncertain Convex Optimization Problems [J]. Acta mathematica scientia,Series A, 2020, 40(4): 1007-1017.
[11]	Donghui Fang,Liping Tian,Xianyun Wang. Strong Fenchel-Lagrange Duality for Convex Optimization Problems with Composite Function [J]. Acta mathematica scientia,Series A, 2020, 40(1): 20-30.
[12]	Huang Zhenggang. A New Notion of Generalized Subgradients and Its Properties [J]. Acta mathematica scientia,Series A, 2015, 35(5): 927-935.
[13]	LONG Xian-Jun. Optimality Conditions for Approximate Solutions on Nonconvex Vector Equilibrium Problems in Asplund Spaces [J]. Acta mathematica scientia,Series A, 2014, 34(3): 593-602.
[14]	Wu Shi-Liang, LI Cui-Xia. Spectral Analysis on Some Discrete Systems From Maxwell Equations [J]. Acta mathematica scientia,Series A, 2014, 34(1): 109-114.
[15]	YU Li, XU Xi-Hong. Generalized Gradient of Set-valued Optimization Problems and Optimality Conditions of Strong-efficient Solutions [J]. Acta mathematica scientia,Series A, 2012, 32(4): 685-690.

Optimality Conditions for Composite Optimization Problems with Conical Constraints

RichHTML

PDF (PC)

Abstract

Cite this article

share this article

References 13

Related Articles 15

Metrics

Comments

Recommended 10