First and second-order optimality conditions for convex composite multiobjective optimization
From MaRDI portal
Publication:1372550
DOI10.1023/A:1022695714596zbMATH Open0890.90162OpenAlexW1781163045MaRDI QIDQ1372550FDOQ1372550
Authors: Xiao Qi Yang, V. 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
Recommendations
- scientific article; zbMATH DE number 1779924
- On second-order optimality conditions in constrained multiobjective optimization
- Second-order optimality conditions for \(C^1\) multiobjective programming problems
- Second-order optimality conditions for multiobjective optimization problems with constraints
- Second-order optimality conditions in multiobjective optimization problems
- On sufficient second order optimality conditions in multiobjective optimization
- Second-order optimality conditions for multiobjective optimization whose order induced by second-order cone
- First-order optimality conditions and duality results for multi-objective optimisation problems
- scientific article; zbMATH DE number 2121544
- Second-order optimality conditions for cone constrained multi-objective optimization
Cites Work
- Convex Analysis
- Theory of multiobjective optimization
- Optimization and nonsmooth analysis
- Generalized convex functions and vector variational inequalities
- Proper efficiency and the theory of vector maximization
- A Generalized Second-Order Derivative in Nonsmooth Optimization
- Necessary and sufficient optimality conditions for a class of nonsmooth minimization problems
- Convex composite multi-objective nonsmooth programming
- Composite Nonsmooth Programming with Gâteaux Differentiability
- Title not available (Why is that?)
- Convex composite minimization with \(C^{1,1}\) functions
- Generalized Quasiconvex Mappings and Vector Optimization
- Pshenichnyi's theorem for vector minimization
Cited In (14)
- First-order optimality conditions and duality results for multi-objective optimisation problems
- Second-order optimality conditions for nondominated solutions of multiobjective programming with \(C^{1,1}\) data
- Title not available (Why is that?)
- Conjugate duality for multiobjective composed optimization problems
- Optimality conditions for weak efficiency to vector optimization problems with composed convex functions
- Unified approaches for solvable and unsolvable linear complementarity problems
- The Fermat rule for multifunctions on Banach spaces
- Lagrange multiplier rules for weak approximate Pareto solutions of constrained vector optimization problems in Hilbert spaces
- Necessary and sufficient conditions for (weakly) efficient of non-differentiable multi-objective semi-infinite programming problems
- Convergence analysis of a class of nonlinear penalization methods for constrained optimization via first-order necessary optimality conditions
- Asymptotic analysis in convex composite multiobjective optimization problems
- Title not available (Why is that?)
- First order rejection tests for multiple-objective optimization
- Farkas-type results for inequality systems with composed convex functions via conjugate duality
This page was built for publication: First and second-order optimality conditions for convex composite multiobjective optimization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1372550)
