Nonsmooth semi-infinite minmax programming involving generalized \((\varPhi,\rho)\)-invexity

DOI10.1007/s11424-015-2096-6zbMath1327.90344OpenAlexW2023245436MaRDI QIDQ498079

B. B. Upadhyay, Shashi Kant Mishra

Publication date: 25 September 2015

Published in: Journal of Systems Science and Complexity (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s11424-015-2096-6

zbMATH Keywords

dualitygeneralized invexityprogramminglocally Lipschitz functionssemi-infiniteminmax programming

Mathematics Subject Classification ID

Semi-infinite programming (90C34)

Related Items (2)

On Frèchet normal cone for nonsmooth mathematical programming problems with switching constraints ⋮ Optimality conditions for nondifferentiable minimax programs and vector optimization problems

Cites Work

• Unnamed Item
• Unnamed Item
• Nonsmooth minimax programming under locally Lipschitz \((\Phi , \rho )\)-invexity
• Duality for nonsmooth semi-infinite programming problems
• Semi-infinite programming
• First order optimality conditions for generalized semi-infinite programming problems
• Duality for a class of nondifferentiable mathematical programming problems
• On sufficiency of the Kuhn-Tucker conditions
• On efficiency and duality for multiobjective programs
• Necessary conditions and sufficient conditions for static minmax problems
• Generalized semi-infinite programming: Theory and methods
• Nonsmooth semi-infinite programming problems with mixed constraints
• Optimality conditions for non-smooth semi-infinite programming
• Strong and Weak Convexity of Sets and Functions
• (Φ, ρ)-Invexity in Nonsmooth Optimization
• Semi-Infinite Programming: Theory, Methods, and Applications
• On semi-infinite minmax programming with generalized invexity
• Encyclopedia of Optimization
• On duality theory of convex semi-infinite programming
• Semi-infinite programming, duality, discretization and optimality conditions†
• Optimality conditions and duality in multiobjective programming with invexity
• Generalised convexity and duality in multiple objective programming
• Invex functions and constrained local minima
• Further Generalizations of Convexity in Mathematical Programming
• Nonlinear Programming
• The Lagrange Multiplier Theorem for Max-Min with Several Constraints
• The Theory of Max-Min, with Applications
• Linear Programming Solutions to Ratio Games
• Best Rational Approximation and Strict Quasi-Convexity
• A characterization of strict local minimizers of order one for nonsmooth static minmax problems

This page was built for publication: Nonsmooth semi-infinite minmax programming involving generalized \((\varPhi,\rho)\)-invexity