Nonsmooth semi-infinite minmax programming involving generalized (,)-invexity

DOI10.1007/S11424-015-2096-6zbMATH Open1327.90344OpenAlexW2023245436MaRDI QIDQ498079FDOQ498079

Publication date: 25 September 2015

Published in: Journal of Systems Science and Complexity (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s11424-015-2096-6

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

zbMATH Keywords

duality locally Lipschitz functions programming semi-infinite generalized invexity minmax programming

Mathematics Subject Classification ID

Semi-infinite programming (90C34)

Cites Work

Title not available (Why is that?)
Strong and Weak Convexity of Sets and Functions
On sufficiency of the Kuhn-Tucker conditions
On efficiency and duality for multiobjective programs
Semi-Infinite Programming: Theory, Methods, and Applications
Encyclopedia of Optimization
Invex functions and constrained local minima
Further Generalizations of Convexity in Mathematical Programming
Nonlinear Programming
Semi-infinite programming
The Theory of Max-Min, with Applications
Nonsmooth semi-infinite programming problems with mixed constraints
Optimality conditions for non-smooth semi-infinite programming
Generalized semi-infinite programming: Theory and methods
First order optimality conditions for generalized semi-infinite programming problems
On semi-infinite minmax programming with generalized invexity
\((\Phi , \rho )\)-invexity in nonsmooth optimization
Duality for nonsmooth semi-infinite programming problems
Semi-infinite programming, duality, discretization and optimality conditions†
Necessary conditions and sufficient conditions for static minmax problems
Nonsmooth minimax programming under locally Lipschitz \((\Phi , \rho )\)-invexity
Generalised convexity and duality in multiple objective programming
Duality for a class of nondifferentiable mathematical programming problems
Title not available (Why is that?)
On duality theory of convex semi-infinite programming
Optimality conditions and duality in multiobjective programming with \((\Phi,\rho)\)-invexity
The Lagrange Multiplier Theorem for Max-Min with Several Constraints
Linear Programming Solutions to Ratio Games
Best Rational Approximation and Strict Quasi-Convexity
A characterization of strict local minimizers of order one for nonsmooth static minmax problems

Cited In (10)

On nonsmooth semi-infinite minimax programming problem with \((\Phi, \rho)\)-invexity
On semi-infinite minmax programming with generalized invexity
On Frèchet normal cone for nonsmooth mathematical programming problems with switching constraints
Optimality conditions for nondifferentiable minimax programs and vector optimization problems
Optimal value functions of generalized semi-infinite min-max programming on a noncompact set
On the sufficiency and the duality of solutions for nonsmooth \((h,\varphi)\)-semi-infinite programming
Optimality and duality in nondifferentiable minimax programming problems involving \(\epsilon\)-quasi solutions
\((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

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)