Nonsmooth semi-infinite minmax programming involving generalized (,)-invexity
From MaRDI portal
Publication:498079
Recommendations
- On nonsmooth semi-infinite minimax programming problem with \((\Phi, \rho)\)-invexity
- Nonsmooth minimax programming under locally Lipschitz \((\Phi , \rho )\)-invexity
- Optimality conditions and duality for nonsmooth minimax programming problems under generalized invexity
- \((\Phi , \rho )\)-invexity in nonsmooth optimization
- Nonsmooth minimax programming problems with \(V\)-\(r\)-invex functions
Cites work
- scientific article; zbMATH DE number 3904354 (Why is no real title available?)
- scientific article; zbMATH DE number 46303 (Why is no real title available?)
- A characterization of strict local minimizers of order one for nonsmooth static minmax problems
- Best Rational Approximation and Strict Quasi-Convexity
- Duality for a class of nondifferentiable mathematical programming problems
- Duality for nonsmooth semi-infinite programming problems
- Encyclopedia of Optimization
- First order optimality conditions for generalized semi-infinite programming problems
- Further Generalizations of Convexity in Mathematical Programming
- Generalised convexity and duality in multiple objective programming
- Generalized semi-infinite programming: Theory and methods
- Invex functions and constrained local minima
- Linear Programming Solutions to Ratio Games
- Necessary conditions and sufficient conditions for static minmax problems
- Nonlinear Programming
- Nonsmooth minimax programming under locally Lipschitz \((\Phi , \rho )\)-invexity
- Nonsmooth semi-infinite programming problems with mixed constraints
- On duality theory of convex semi-infinite programming
- On efficiency and duality for multiobjective programs
- On semi-infinite minmax programming with generalized invexity
- On sufficiency of the Kuhn-Tucker conditions
- Optimality conditions and duality in multiobjective programming with \((\Phi,\rho)\)-invexity
- Optimality conditions for non-smooth semi-infinite programming
- Semi-Infinite Programming: Theory, Methods, and Applications
- Semi-infinite programming
- Semi-infinite programming, duality, discretization and optimality conditions†
- Strong and Weak Convexity of Sets and Functions
- The Lagrange Multiplier Theorem for Max-Min with Several Constraints
- The Theory of Max-Min, with Applications
- \((\Phi , \rho )\)-invexity in nonsmooth optimization
Cited in
(10)- Optimality conditions for nondifferentiable minimax programs and vector optimization problems
- Optimality and duality in nondifferentiable minimax programming problems involving \(\epsilon\)-quasi solutions
- On semi-infinite minmax programming with generalized invexity
- \((G, V)\)-invexity nondifferentiable generalized minimax fractional programming
- Optimality conditions and duality for nonsmooth minimax programming problems under generalized invexity
- Second-order optimality conditions and duality for multiobjective semi-infinite programming problems on Hadamard manifolds
- On nonsmooth semi-infinite minimax programming problem with \((\Phi, \rho)\)-invexity
- On Frèchet normal cone for nonsmooth mathematical programming problems with switching constraints
- On the sufficiency and the duality of solutions for nonsmooth \((h,\varphi)\)-semi-infinite programming
- Optimal value functions of generalized semi-infinite min-max programming on a noncompact set
This page was built for publication: Nonsmooth semi-infinite minmax programming involving generalized \((\varPhi,\rho)\)-invexity
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q498079)
