Optimality and duality for nonsmooth minimax programming problems using convexifactor
DOI10.2298/FIL1714555AOpenAlexW2568007455WikidataQ130086309 ScholiaQ130086309MaRDI QIDQ5020437FDOQ5020437
Authors: I. 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
Recommendations
- scientific article; zbMATH DE number 1159218
- Optimality and duality in nonsmooth conic vector optimization
- Duality for a class of nonsmooth multiobjective programming problems using convexificators
- Optimality and duality for a class of nonsmooth optimization problems
- Duality for nonsmooth optimization problems with equilibrium constraints, using convexificators
- Optimality conditions for nonsmooth convex programming problems
- Optimality and duality in nondifferentiable programming over cone domain
- Duality for minmax programming involving nonsmooth v-invex functions
- Optimality conditions and duality for nonsmooth minimax programming problems under generalized invexity
- Optimality and duality for multiobjective nonsmooth programming
sufficiencydualityoptimality conditionsnonsmooth minimax programmingconvexifactordirectional Dini-derivatives
Fractional programming (90C32) Minimax problems in mathematical programming (90C47) Convexity of real functions in one variable, generalizations (26A51) Existence of solutions for minimax problems (49J35)
Cites Work
- Optimization and nonsmooth analysis
- Title not available (Why is that?)
- Title not available (Why is that?)
- A generalized derivative for calm and stable functions
- Nonsmooth calculus, minimality, and monotonicity of convexificators
- Hunting for a smaller convex subdifferential
- Necessary optimality conditions in terms of convexificators in Lipschitz optimization
- Convexifactors, generalized convexity and vector optimization
- The Linear Nonconvex Generalized Gradient and Lagrange Multipliers
- Title not available (Why is that?)
- Optimality conditions for efficiency on nonsmooth multiobjective programming problems
- Convexifactors, generalized convexity, and optimality conditions
- An algorithm for generalized fractional programs
- Necessary conditions and sufficient conditions for static minmax problems
- Necessary and sufficient conditions for minimax fractional programming
- Duality in nondifferentiable minimax fractional programming with \(B-(p, r)\)-invexity
- Nonsmooth minimax programming under locally Lipschitz \((\Phi , \rho )\)-invexity
- On minimax fractional optimality and duality with generalized convexity
- Minimax programming under \((p,r)\)-invexity
- Duality in nondifferentiable minimax fractional programming with generalized convexity
- Stronger Kuhn-Tucker type conditions in nonsmooth multiobjective optimization: Locally Lipschitz case
- Wolfe-type duality involving \((B,\eta)\)-index functions for a minimax programming problem
- Parametric Saddle Point Criteria in Semi-Infinite Minimax Fractional Programming Problems Under (p,r)-Invexity
Cited In (5)
- Convexifactors, generalized convexity and vector optimization
- Approximate optimality for quasi approximate solutions in nonsmooth semi-infinite programming problems, using \(\varepsilon\)-upper semi-regular semi-convexificators
- Necessary and sufficient optimality conditions using convexifactors for mathematical programs with equilibrium constraints
- Sufficient optimality, duality and saddle point analysis in terms of convexificators for nonsmooth robust fractional interval-valued optimization problems
- Sufficient optimality conditions using convexifactors for optimistic bilevel programming problem
This page was built for publication: Optimality and duality for nonsmooth minimax programming problems using convexifactor
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5020437)
