Nonsmooth minimax programming under locally Lipschitz \((\Phi , \rho )\)-invexity
From MaRDI portal
Publication:555353
DOI10.1016/j.amc.2011.04.037zbMath1245.90143OpenAlexW2055493794MaRDI QIDQ555353
Publication date: 22 July 2011
Published in: Applied Mathematics and Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.amc.2011.04.037
Minimax problems in mathematical programming (90C47) Optimality conditions and duality in mathematical programming (90C46)
Related Items (9)
Generalized minimax programming with nondifferentiable \((G, \beta)\)-invexity ⋮ \(G\)-semipreinvexity and its applications ⋮ Nondifferentiable minimax programming problems with applications ⋮ On nonsmooth semi-infinite minimax programming problem with \((\Phi, \rho)\)-invexity ⋮ The optimality conditions for generalized minimax programming ⋮ Nonsmooth semi-infinite minmax programming involving generalized \((\varPhi,\rho)\)-invexity ⋮ \(E\)-differentiable minimax programming under \(E\)-convexity ⋮ Proper efficiency conditions and duality results for nonsmooth vector optimization in Banach spaces under \((\varPhi, \rho)\)-invexity ⋮ Optimality and duality for nonsmooth minimax programming problems using convexifactor
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- An algorithm for generalized fractional programs
- New optimality conditions and duality results of \(G\) type in differentiable mathematical programming
- Equivalence of saddle-points and optima, and duality for a class of non- smooth non-convex problems
- Nondifferentiable mathematical programming and convex-concave functions
- On sufficiency of the Kuhn-Tucker conditions
- Necessary conditions and sufficient conditions for static minmax problems
- On minimax fractional optimality conditions with \((F,\rho)\)-convexity
- Optimality and duality for minmax problems involving arcwise connected and generalized arcwise connected functions
- Lipschitz B-vex functions and nonsmooth programming
- Minimax programming under \((p,r)\)-invexity
- Wolfe-type duality involving \((B,\eta)\)-index functions for a minimax programming problem
- Minimax programming under generalized \((p, r)\)-invexity
- Strong and Weak Convexity of Sets and Functions
- (Φ, ρ)-Invexity in Nonsmooth Optimization
- LIPSCHITZr-INVEX FUNCTIONS AND NONSMOOTH PROGRAMMING
- Nonsmooth invexity
- Optimization and nonsmooth analysis
- Further Generalizations of Convexity in Mathematical Programming
- GeneralizedF-convexity and its classification
- Duality for minmax programming involvingV-invex functions
- Non-differentiable pseudo-convex functions and duality for minimax programming problems
- The Lagrange Multiplier Theorem for Max-Min with Several Constraints
This page was built for publication: Nonsmooth minimax programming under locally Lipschitz \((\Phi , \rho )\)-invexity
