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

DOI10.1080/02331939508844142MaRDI QIDQ4859831zbMATH OpenOpenAlexFDO

Authors

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

Dini derivativesminimax programmingnon-differentiable pseudo-convexity

Mathematics Subject Classification ID

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

Recommendations

• Optimality and duality for nondifferentiable minimax fractional programming with generalized convexity
• Duality in nondifferentiable minimax fractional programming with generalized convexity
• Optimality conditions and duality in nondifferentiable minimax fractional programming with generalized convexity
• Nondifferentiable minimax programming problems with applications
• scientific article; zbMATH DE number 20895

Cites work

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

Cited in

(11)

• Duality for nondifferentiable nonlinear programming problems: A feasible direction approach
• scientific article; zbMATH DE number 3856845 (Why is no real title available?)
• scientific article; zbMATH DE number 3918106 (Why is no real title available?)
• scientific article; zbMATH DE number 4062008 (Why is no real title available?)
• scientific article; zbMATH DE number 20895 (Why is no real title available?)
• A fifth bibliography of fractional programming^*
• scientific article; zbMATH DE number 823390 (Why is no real title available?)
• What is quasiconvex analysis?
• scientific article; zbMATH DE number 222438 (Why is no real title available?)
• On optimality conditions for pseudoconvex programming in terms of Dini subdifferentials
• Nonsmooth minimax programming under locally Lipschitz \((\Phi , \rho )\)-invexity

This page was built for publication: Non-differentiable pseudo-convex functions and duality for minimax programming problems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4859831)