Optimality and invexity in optimization problems in Banach algebras (spaces)

DOI10.1016/j.na.2009.04.046zbMath1176.90578OpenAlexW2006900596MaRDI QIDQ732584

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

zbMATH Keywords

nonsmooth optimizationgeneralized invexitygeneralized differentiationBanach algebra (space)weak\(^{*}\) topology

Mathematics Subject Classification ID

Nonlinear programming (90C30)

Related Items (3)

Infinite alternative theorems and nonsmooth constraint qualification conditions ⋮ Multiobjective program with support functions under \((G,C,\rho)\)-convexity assumptions ⋮ Parametric Saddle Point Criteria in Semi-Infinite Minimax Fractional Programming Problems Under (p,r)-Invexity

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• The essence of invexity
• Continuous-time optimization problems involving invex functions
• Nonsmooth multiobjective optimization using limiting subdifferentials
• Characterization of nonsmooth quasiconvex and pseudoconvex functions
• Multiple-objective programs in Banach spaces: sufficiency for (proper) optimality
• The gap function for optimization problems in Banach spaces
• Optimality criteria in mathematical programming involving generalized invexity
• On sufficiency of the Kuhn-Tucker conditions
• Invex functions and generalized convexity in multiobjective programming
• Foreword to: Semidefinite programming
• \((p,r)\)-invexity in multiobjective programming.
• Minimax programming under \((p,r)\)-invexity
• Second order symmetric duality in mathematical programming with \(F\)-convexity
• On invex sets and preinvex functions
• An \(\epsilon\)-sensitivity analysis for semidefinite programming
• Infinite (semi-infinite) problems to characterize the optimality of nonlinear optimization problems
• A proof for Antczak's mean value theorem in invexity analysis
• Optimality for nonsmooth fractional multiple objective programming
• A mean value theorem in Asplund spaces
• LIPSCHITZr-INVEX FUNCTIONS AND NONSMOOTH PROGRAMMING
• On generalised convex mathematical programming
• Variational Analysis
• Variational Analysis and Generalized Differentiation I
• Semidefinite programming and combinatorial optimization
• Generalized invexity and duality in multiobjective programming problems
• \((p,r)\)-invex sets and functions
• On \((p,r)\)-invexity-type nonlinear programming problems.

This page was built for publication: Optimality and invexity in optimization problems in Banach algebras (spaces)