Optimality and duality for nonsmooth minimax programming problems using convexifactor
From MaRDI portal
Publication:5020437
DOI10.2298/FIL1714555AOpenAlexW2568007455WikidataQ130086309 ScholiaQ130086309MaRDI QIDQ5020437
Izhar Ahmad, Krishna Kummari, Anurag Jayswal, Vivek Kumar Singh
Publication date: 5 January 2022
Published in: Filomat (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.2298/fil1714555a
optimality conditionsdualitysufficiencynonsmooth minimax programmingconvexifactordirectional Dini-derivatives
Minimax problems in mathematical programming (90C47) Fractional programming (90C32) Existence of solutions for minimax problems (49J35) Convexity of real functions in one variable, generalizations (26A51)
Related Items
Sufficient optimality conditions using convexifactors for optimistic bilevel programming problem ⋮ Necessary and sufficient optimality conditions using convexifactors for mathematical programs with equilibrium constraints ⋮ Approximate optimality for quasi approximate solutions in nonsmooth semi-infinite programming problems, using ε-upper semi-regular semi-convexificators
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Duality in nondifferentiable minimax fractional programming with \(B-(p, r)\)-invexity
- Optimality conditions for efficiency on nonsmooth multiobjective programming problems
- Nonsmooth minimax programming under locally Lipschitz \((\Phi , \rho )\)-invexity
- Convexifactors, generalized convexity, and optimality conditions
- An algorithm for generalized fractional programs
- Stronger Kuhn-Tucker type conditions in nonsmooth multiobjective optimization: Locally Lipschitz case
- A generalized derivative for calm and stable functions
- Necessary conditions and sufficient conditions for static minmax problems
- Necessary and sufficient conditions for minimax fractional programming
- Nonsmooth calculus, minimality, and monotonicity of convexificators
- Hunting for a smaller convex subdifferential
- On minimax fractional optimality and duality with generalized convexity
- Minimax programming under \((p,r)\)-invexity
- Wolfe-type duality involving \((B,\eta)\)-index functions for a minimax programming problem
- Necessary optimality conditions in terms of convexificators in Lipschitz optimization
- Duality in nondifferentiable minimax fractional programming with generalized convexity
- Optimization and nonsmooth analysis
- Convexifactors, generalized convexity and vector optimization
- The Linear Nonconvex Generalized Gradient and Lagrange Multipliers
- Parametric Saddle Point Criteria in Semi-Infinite Minimax Fractional Programming Problems Under (p,r)-Invexity
