Invex nonsmooth alternative theorem and applications*

DOI10.1080/02331930008844504MaRDI QIDQ4512755zbMATH OpenOpenAlexFDO

Authors Rojas-Medar Marko Antonio, 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

zbMATH Keywords

dualityGordan's alternative theoreminvex constrained nonsmooth optimizationmultiobjective optimizationvector saddlepoint theorem

Mathematics Subject Classification ID

Nonsmooth analysis (49J52) Multi-objective and goal programming (90C29) Nonlinear programming (90C30)

Review text

An invex constrained nonsmooth optimization problem is considered, including an abstract constraint. Necessary conditions and sufficient conditions for optimality are obtained, and duality results are proved. An invex version of Gordan's alternative theorem is proved. A vector saddlepoint theorem is deduced for multiobjective optimization.

Recommendations

• Nonsmooth invex functions and sufficient optimality conditions
• Nonsmooth vector-valued invex functions and applications
• Invexity: an updated survey and new results for nonsmooth functions
• Invex sets and nonsmooth invex functions
• Infine functions, nonsmooth alternative theorems and vector optimization problems
• Generalized invexity of nonsmooth functions
• Generalized Nonsmooth Invexity
• Nonsmooth invexities, invariant monotonicities and nonsmooth vector variational-like inequalities with applications to vector optimization
• Various types of nonsmooth invex functions

Cites work

• Convexlike alternative theorems and mathematical programming
• Duality in Nonlinear Programming: A Simplified Applications-Oriented Development
• Invex functions and constrained local minima
• Invexity and generalized convexity
• Nondifferentiable optimization by smooth approximations
• Nonsmooth invexity
• On sufficiency of the Kuhn-Tucker conditions
• Perfect duality for convexlike programs
• Pre-invex functions in multiple objective optimization
• Proper efficiency and the theory of vector maximization
• Strict lower semicontinuity of the level sets and invexity of a locally Lipschitz function
• What is invexity?

Cited in

(13)

• Infine functions, nonsmooth alternative theorems and vector optimization problems
• Optimality and duality for multiple-objective optimization under generalized type I univexity
• Optimality and duality in nonsmooth semi-infinite optimization, using a weak constraint qualification
• Some relations between variational-like inequalities and efficient solutions of certain nonsmooth optimization problems
• Inversion theorem for nonconvex multifunctions
• Necessary and sufficient conditions for weak efficiency in non-smooth vectorial optimization problems
• New optimality conditions for nonsmooth control problems
• \(L\)-invex-infine functions and applications
• scientific article; zbMATH DE number 1996059 (Why is no real title available?)
• scientific article; zbMATH DE number 1996063 (Why is no real title available?)
• Efficiency and generalised convexity in vector optimisation problems
• On a theorem of the alternative and saddle-point conditions in nonsmooth optimization
• Generalized ( F, , , )-d-V-univex functions and non-smooth alternative theorems

This page was built for publication: Invex nonsmooth alternative theorem and applications^*

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4512755)