Optimality conditions for a class of composite multiobjective nonsmooth optimization problems
From MaRDI portal
Publication:377729
DOI10.1007/s10898-012-9957-5zbMath1274.90282MaRDI QIDQ377729
Publication date: 7 November 2013
Published in: Journal of Global Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10898-012-9957-5
\(\eta \)-generalized null space condition; \(K\)-generalized invexity; composite multiobjective nonsmooth optimization problems; Pareto minimum; weak minimum
90C26: Nonconvex programming, global optimization
90C29: Multi-objective and goal programming
90C30: Nonlinear programming
90C46: Optimality conditions and duality in mathematical programming
Related Items
A new approach to strong duality for composite vector optimization problems, Optimality and duality in nonsmooth composite vector optimization and applications, A theorem of the alternative with an arbitrary number of inequalities and quadratic programming, Higher-order generalized tangent epiderivatives and applications to set-valued optimization
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Convex composite multi-objective nonsmooth programming
- On sufficiency of the Kuhn-Tucker conditions
- Composite nonsmooth multiobjective programs with \(V\)-\(\rho\)-invexity
- Symmetric duality in multiobjective programming involving generalized cone-invex functions
- Multicriteria optimization in engineering and in the sciences
- Generalized nonsmooth invexity over cones in vector optimization
- Lagrange multipliers saddle points and scalarizations in composite multiobjective nonsmooth programming
- Necessary and Sufficient Conditions for a Local Minimum. 2: Conditions of Levitin–Miljutin–Osmolovskii Type
- Descent methods for composite nondifferentiable optimization problems
- On optimality conditions in nonsmooth inequality constrained minimization
- A class of nonconvex functions and mathematical programming
- Nonsmooth multiobjective programming
- First- and Second-Order Epi-Differentiability in Nonlinear Programming
- Invex functions and constrained local minima
- Necessary and sufficient optimality conditions for a class of nonsmooth minimization problems
- Composite Nonsmooth Programming with Gâteaux Differentiability
- Generalized convex composite multi-objective nonsmooth programming and conditional proper efficiency
- On locally Lipschitz vector-valued invex functions
- Nonlinear Programming
