First and second-order optimality conditions for convex composite multiobjective optimization

DOI10.1023/A:1022695714596zbMath0890.90162MaRDI QIDQ1372550

Xiao Qi Yang, Vaithilingam Jeyakumar

Publication date: 22 June 1998

Published in: Journal of Optimization Theory and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1023/a:1022695714596

zbMATH Keywords

nonsmooth analysis; multiobjective optimization; convex analysis; sufficient optimality condition

Mathematics Subject Classification ID

90C29: Multi-objective and goal programming

Related Items

Lagrange multiplier rules for weak approximate Pareto solutions of constrained vector optimization problems in Hilbert spaces, Second-order optimality conditions for nondominated solutions of multiobjective programming with \(C^{1,1}\) data, Optimality conditions for weak efficiency to vector optimization problems with composed convex functions, Convergence analysis of a class of nonlinear penalization methods for constrained optimization via first-order necessary optimality conditions, Necessary and sufficient conditions for (weakly) efficient of non-differentiable multi-objective semi-infinite programming problems, Unified approaches for solvable and unsolvable linear complementarity problems, Asymptotic analysis in convex composite multiobjective optimization problems, Conjugate duality for multiobjective composed optimization problems, Farkas-type results for inequality systems with composed convex functions via conjugate duality, The Fermat rule for multifunctions on Banach spaces

Cites Work

• Unnamed Item
• Unnamed Item
• Convex composite multi-objective nonsmooth programming
• Theory of multiobjective optimization
• Pshenichnyi's theorem for vector minimization
• Generalized convex functions and vector variational inequalities
• Convex composite minimization with \(C^{1,1}\) functions
• Proper efficiency and the theory of vector maximization
• A Generalized Second-Order Derivative in Nonsmooth Optimization
• Generalized Quasiconvex Mappings and Vector Optimization
• Necessary and sufficient optimality conditions for a class of nonsmooth minimization problems
• Composite Nonsmooth Programming with Gâteaux Differentiability
• Convex Analysis