On sufficiency of the Kuhn-Tucker conditions in nondifferentiable programming

DOI10.1017/S0004972700012041zbMath0760.90078OpenAlexW1993358417MaRDI QIDQ3993927

Fuan Zhao

Publication date: 13 August 1992

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

Full work available at URL: https://doi.org/10.1017/s0004972700012041

zbMATH Keywords

dualityKuhn-Tucker conditionsgeneralized invex conditionsnondifferentiable constrained optimization

Mathematics Subject Classification ID

Nonconvex programming, global optimization (90C26) Nonlinear programming (90C30)

Related Items (13)

On sufficient optimality conditions for multiobjective control problems ⋮ Nonsmooth multiobjective optimization involving generalized univex functions ⋮ Duality for minmax \(B\)-vex programming involving \(n\)-set functions ⋮ Optimality and duality in nonsmooth multiobjective optimization involving V-type I invex functions ⋮ Generalized univex functions in nonsmooth multiobjective optimization ⋮ Optimality and duality in vector optimization involving generalized type I functions over cones ⋮ Sufficiency and duality in nonsmooth multiobjective optimization involving generalized \((F,\alpha,\rho,d)\)-type I functions ⋮ A survey of recent[1985-1995advances in generalized convexity with applications to duality theory and optimality conditions] ⋮ Generalized \((d - \rho - \eta - \theta )\)-type I univex functions in multiobjective optimization ⋮ On sufficiency and duration in nonsmooth multiobjective programming. ⋮ Duality for minmax programming involving nonsmooth v-invex functions ⋮ (Φ, ρ)-Invexity in Nonsmooth Optimization ⋮ Optimality and duality in nonsmooth multiobjective optimization involving generalized type I functions

Cites Work

• Unnamed Item
• On sufficiency of the Kuhn-Tucker conditions
• A subgradient duality theorem
• Refinements of necessary optimality conditions in nondifferentiable programming. I
• Nondifferentiable optimization by smooth approximations
• What is invexity?
• Necessary and sufficient conditions in constrained optimization
• On optimality conditions in nondifferentiable programming

This page was built for publication: On sufficiency of the Kuhn-Tucker conditions in nondifferentiable programming