On nonsmooth semi-infinite minimax programming problem with \((\Phi, \rho)\)-invexity
From MaRDI portal
Publication:1723855
DOI10.1155/2014/317304zbMath1472.49031OpenAlexW2044651167WikidataQ59038177 ScholiaQ59038177MaRDI QIDQ1723855
Xiaoling Liu, Guoming Lai, De-Hui Yuan, Chuanqing Xu
Publication date: 14 February 2019
Published in: Abstract and Applied Analysis (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1155/2014/317304
Minimax problems in mathematical programming (90C47) Nonsmooth analysis (49J52) Existence of solutions for minimax problems (49J35) Duality theory (optimization) (49N15)
Cites Work
- Unnamed Item
- Unnamed Item
- Duality in nondifferentiable minimax fractional programming with \(B-(p, r)\)-invexity
- Nonsmooth minimax programming under locally Lipschitz \((\Phi , \rho )\)-invexity
- On duality theorems for a nondifferentiable minimax fractional programming
- Semi-infinite programming
- Generalized fractional minimax programming with \(B-(p,r)\)-invexity
- On sufficiency of the Kuhn-Tucker conditions
- On efficiency and duality for multiobjective programs
- Minimax programming under \((p,r)\)-invexity
- Nondifferentiable minimax fractional programming problems with \((C, \alpha, \rho, d)\)-convexity
- (Φ, ρ)-Invexity in Nonsmooth Optimization
- On semi-infinite minmax programming with generalized invexity
- Encyclopedia of Optimization
- Nonsmooth minimax programming problems withV−r-invex functions
- Semi-infinite programming, duality, discretization and optimality conditions†
- Optimization and nonsmooth analysis
- What is invexity?
- Generalized Gradients and Applications
- The Notion of V-r-Invexity in Differentiable Multiobjective Programming
- \((p,r)\)-invex sets and functions
- Optimality conditions and duality for a class of nonlinear fractional programming problems.
This page was built for publication: On nonsmooth semi-infinite minimax programming problem with \((\Phi, \rho)\)-invexity
