Optimality and invexity in optimization problems in Banach algebras (spaces)
From MaRDI portal
Publication:732584
DOI10.1016/J.NA.2009.04.046zbMATH Open1176.90578OpenAlexW2006900596MaRDI QIDQ732584FDOQ732584
Authors: Majid Soleimani-Damaneh
Publication date: 9 October 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.04.046
Recommendations
- scientific article; zbMATH DE number 6307865
- Duality for optimization problems in Banach algebras
- Optimality conditions of a class of generalized invex functions
- Optimality conditions and duality results in Banach space under \(\rho -(\eta, \theta)\)-\(B\)-invexity
- Proper efficiency conditions and duality results for nonsmooth vector optimization in Banach spaces under \((\varPhi, \rho)\)-invexity
nonsmooth optimizationgeneralized differentiationgeneralized invexityBanach algebra (space)weak\(^{*}\) topology
Cites Work
- Variational Analysis
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Variational Analysis and Generalized Differentiation I
- Title not available (Why is that?)
- Optimality criteria in mathematical programming involving generalized invexity
- On sufficiency of the Kuhn-Tucker conditions
- Invex functions and generalized convexity in multiobjective programming
- On invex sets and preinvex functions
- On generalised convex mathematical programming
- Title not available (Why is that?)
- Title not available (Why is that?)
- \((p,r)\)-invex sets and functions
- The essence of invexity
- Continuous-time optimization problems involving invex functions
- Infinite (semi-infinite) problems to characterize the optimality of nonlinear optimization problems
- Characterization of nonsmooth quasiconvex and pseudoconvex functions
- LIPSCHITZr-INVEX FUNCTIONS AND NONSMOOTH PROGRAMMING
- Generalized invexity and duality in multiobjective programming problems
- Second order symmetric duality in mathematical programming with \(F\)-convexity
- Semidefinite programming and combinatorial optimization
- Minimax programming under \((p,r)\)-invexity
- Optimality for nonsmooth fractional multiple objective programming
- Nonsmooth multiobjective optimization using limiting subdifferentials
- The gap function for optimization problems in Banach spaces
- \((p,r)\)-invexity in multiobjective programming.
- Multiple-objective programs in Banach spaces: sufficiency for (proper) optimality
- On \((p,r)\)-invexity-type nonlinear programming problems.
- Foreword to: Semidefinite programming
- An \(\epsilon\)-sensitivity analysis for semidefinite programming
- A proof for Antczak's mean value theorem in invexity analysis
- A mean value theorem in Asplund spaces
Cited In (8)
- Title not available (Why is that?)
- Optimization in Banach spaces
- Optimization methods and stability of inclusions in Banach spaces
- Multiobjective program with support functions under \((G,C,\rho)\)-convexity assumptions
- Duality for optimization problems in Banach algebras
- Infinite alternative theorems and nonsmooth constraint qualification conditions
- Title not available (Why is that?)
- Parametric Saddle Point Criteria in Semi-Infinite Minimax Fractional Programming Problems Under (p,r)-Invexity
This page was built for publication: Optimality and invexity in optimization problems in Banach algebras (spaces)
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q732584)