Invex nonsmooth alternative theorem and applications*
From MaRDI portal
Publication:4512755
DOI10.1080/02331930008844504zbMath0960.90082OpenAlexW2008688745MaRDI QIDQ4512755
Marko A. Rojas-Medar, Adilson J. V. Brandão, Geraldo Nunes Silva
Publication date: 5 November 2000
Published in: Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/02331930008844504
dualitymultiobjective optimizationGordan's alternative theoreminvex constrained nonsmooth optimizationvector saddlepoint theorem
Multi-objective and goal programming (90C29) Nonlinear programming (90C30) Nonsmooth analysis (49J52)
Related Items (8)
Efficiency and generalised convexity in vector optimisation problems ⋮ New optimality conditions for nonsmooth control problems ⋮ \(L\)-invex-infine functions and applications ⋮ Some relations between variational-like inequalities and efficient solutions of certain nonsmooth optimization problems ⋮ Optimality and duality for multiple-objective optimization under generalized type I univexity ⋮ Necessary and sufficient conditions for weak efficiency in non-smooth vectorial optimization problems ⋮ Generalized ( ,α, ρ, θ)–d–V–univex functions and non-smooth alternative theorems ⋮ Optimality and duality in nonsmooth semi-infinite optimization, using a weak constraint qualification
Cites Work
- Pre-invex functions in multiple objective optimization
- On sufficiency of the Kuhn-Tucker conditions
- Perfect duality for convexlike programs
- Strict lower semicontinuity of the level sets and invexity of a locally Lipschitz function
- Proper efficiency and the theory of vector maximization
- Invexity and generalized convexity
- Nonsmooth invexity
- Convexlike alternative theorems and mathematical programming
- Nondifferentiable optimization by smooth approximations
- What is invexity?
- Invex functions and constrained local minima
- Duality in Nonlinear Programming: A Simplified Applications-Oriented Development
This page was built for publication: Invex nonsmooth alternative theorem and applications*