[1] Yang X M, Li D, Wang S Y. Near-subconvexlikeness in vector optimization with set-valued functions [J]. Journal of Optimization Theory and Applications, 2001, 110: 413-427.
[2] Zhao K Q, Yang X M. Characterizations of efficient and weakly efficient points in nonconvex vector optimization [J]. Journal of Global Optimization, 2014, Doi: 10.1007/s10898-014-0191-1.
[3] Rong W D, Wu Y N. \varepsilon-weak minimal solutions of vector optimization problems with set-valued maps [J]. Journal of Optimization Theory and Applications, 2000, 106: 569-579.
[4] Guti\'{e}rrez C, Jimnez B, Novo V. A unified approach and optimality conditions for approximate solutions of vector optimization problems [J]. SIAM Journal on Optimization, 2006, 17: 688-710.
[5] Limber M A, Goodrich R K. Quasi interiors, lagrange multipliers, and L^p spectral estimation with lattice bounds [J]. Journal of Optimization Theory and Applications, 1993, 78: 143-161.
[6] Borwein J M, Lewis A S. Partially finite convex programming, Part I: quasi relative interiors and duality theory [J]. Mathematical Programming, 1992, 57: 15-48.
[7] Bo\c{t} R I, Csetnek E R, Wanka G. Regularity conditions via quasi-relative interior in convex programming [J]. SIAM Journal on Optimization, 2008, 19: 217-233.
[8] Bao T Q, Mordukhovich B S. Relative Pareto minimizers for multiobjective problems: Existence and optimality conditions [J]. Mathematical Programming, 2010, 122: 301-347.
[9] Zhou Z A, Yang X M. Optimality conditions of generalized subconvexlike set-valued optimization problems based on the quasi-relative interior [J]. Journal of Optimization Theory and Applications, 2011, 150: 327-340.
[10] Guti\'{e}rrez C, Huerga L, Novo V. Scalarization and saddle points of approximate proper solutions in nearly subconvexlike vector optimization problems [J]. Journal of Mathematical Analysis and Applications, 2012, 389: 1046-1058. |