Non-differentiable pseudo-convex functions and duality for minimax programming problems

DOI10.1080/02331939508844142zbMath0839.90105OpenAlexW2034952506MaRDI QIDQ4859831

No author found.

Publication date: 23 June 1996

Published in: Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/02331939508844142

zbMATH Keywords

minimax programmingDini derivativesnon-differentiable pseudo-convexity

Mathematics Subject Classification ID

Nonlinear programming (90C30) Nonsmooth analysis (49J52) Optimality conditions for minimax problems (49K35)

Related Items

A fifth bibliography of fractional programming^* ⋮ Nonsmooth minimax programming under locally Lipschitz \((\Phi , \rho )\)-invexity ⋮ What is quasiconvex analysis?

Cites Work

• Generalized fractional programming duality: A parametric approach
• Optimality and duality for multiobjective nonsmooth programming
• Foundations of optimization
• Duality in generalized linear fractional programming
• A duality theorem for non-linear programming