Nonsmooth multiple-objective optimization in separable Hilbert spaces
From MaRDI portal
Publication:838051
DOI10.1016/j.na.2009.03.013zbMath1167.49308OpenAlexW2019244066WikidataQ60199402 ScholiaQ60199402MaRDI QIDQ838051
Majid Soleimani-damaneh, Juan. J. Nieto
Publication date: 21 August 2009
Published in: Nonlinear Analysis. Theory, Methods \& Applications. Series A: Theory and Methods (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.na.2009.03.013
separable Hilbert spacegeneralized differentiationlimiting subdifferentialmultiple-objective optimization
Related Items
Duality in nondifferentiable minimax fractional programming with \(B-(p, r)\)-invexity, Sensitivity analysis for generalized nonlinear parametric \((A,\eta ,m)\)-maximal monotone operator inclusion systems with relaxed cocoercive type operators, A new filled function method for an unconstrained nonlinear equation, Optimality conditions and duality in nonsmooth multiobjective optimization problems
Cites Work
- Some nondifferentiable multiobjective programming problems
- Nonsmooth multiobjective optimization using limiting subdifferentials
- Multiple-objective programs in Banach spaces: sufficiency for (proper) optimality
- Optimality criteria in mathematical programming involving generalized invexity
- On sufficiency of the Kuhn-Tucker conditions
- Maximum principle in the problem of time optimal response with nonsmooth constraints
- On multiple-objective optimization with generalized univexity
- Optimality criteria and duality in multiple-objective optimization involving generalized invexity
- A class of \(B\)-(\(p\),\(r\))-invex functions and mathematical programming.
- Recent contributions to linear semi-infinite optimization
- Preinvex functions and weak efficient solutions for some vectorial optimization problem in Banach spaces
- Higher-order generalized convexity and duality in nondifferentiable multiobjective mathematical programming
- Nondifferentiable multiobjective programming under generalized \(d\)-univexity
- On invex sets and preinvex functions
- Sufficiency and duality in nondifferentiable multiobjective programming involving generalized type I functions
- Necessary and sufficient conditions in constrained optimization
- On generalised convex mathematical programming
- Generalized invexity and duality in multiobjective programming problems
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
