Invexity at a point: generalisations and classification

DOI10.1017/S0004972700015525zbMath0792.49014MaRDI QIDQ3142056

Stefan Mititelu, Ioan M. Stancu-Minasian

Publication date: 6 December 1993

Published in: Bulletin of the Australian Mathematical Society (Search for Journal in Brave)

zbMATH Keywords

invexitypseudoinvexityquasiinvexityClarke's generalized derivatives

Mathematics Subject Classification ID

Nonlinear programming (90C30) Nonsmooth analysis (49J52)

Related Items (16)

Some sufficient efficiency conditions in semiinfinite multiobjective fractional programming based on exponential type invexities ⋮ Generalized \((\eta,\rho)\)-invex functions and global semiparametric sufficient efficiency conditions for multiobjective fractional programming problems containing arbitrary norms ⋮ Generalized \((\eta,\rho)\)-invex functions and semiparametric duality models for multiobjective fractional programming problems containing arbitrary norms ⋮ Global parametric sufficient optimality conditions for discrete minmax fractional programming problems containing generalized \((\theta,\eta,\rho)\)-V-invex functions and arbitrary norms ⋮ Efficiency for variational control problems on Riemann manifolds with geodesic quasiinvex curvilinear integral functionals ⋮ Global parametric sufficient efficiency conditions for semiinfinite multiobjective fractional programming problems containing generalized \((\alpha,\eta,\rho)\)-V-invex functions ⋮ A survey of recent[1985-1995advances in generalized convexity with applications to duality theory and optimality conditions] ⋮ Duality theorems for a new class of multitime multiobjective variational problems ⋮ GeneralizedF-convexity and its classification ⋮ Generalized (F,β,Φ,ρ,θ) -univex functions and optimality conditions in semiinfinite fractional programming ⋮ Semiparametric sufficient efficiency conditions for multiobjective fractional programming problems containing arbitrary norms ⋮ Minimization of vectors of curvilinear functionals on the second-order jet bundle ⋮ Hanson's duality theorem in nonsmooth programming ⋮ Global parametric sufficient optimality conditions for semi-infinite discrete minmax fractional programming problems involving generalized \((\eta ,\rho )\)-invex functions ⋮ Global Nonparametric Sufficient Optimality Conditions for Semi-Infinite Discrete Minmax Fractional Programming Problems Involving Generalized (η, ρ)-Invex Functions ⋮ Semiinfinite multiobjective fractional programming, Part I: Sufficient efficiency conditions

Cites Work

• Optimality criteria in nonlinear programming involving nonconvex functions
• On sufficiency of the Kuhn-Tucker conditions
• Strong and Weak Convexity of Sets and Functions
• Nondifferentiable optimization by smooth approximations
• A New Approach to Lagrange Multipliers

This page was built for publication: Invexity at a point: generalisations and classification