Vector critical points and efficiency in vector optimization with Lipschitz functions
The authors extend the concept of pseudoinvexity (see [\textit{R. Osuna-Gómez} et al., J. Optim. Theory Appl. 98, No. 3, 651--661 (1998; Zbl 0921.90133)]) for locally Lipschitz vector functions in a finite dimensional space by using Clarke's generalized Jacobian. The main result of the paper states that a locally Lipschitz vector function is pseudoinvex if and only if every critical point is a weakly efficient point. Moreover, when the objective function of an unconstrained vector problem is pseudoinvex, a feasible solution is weakly efficient if and only if it is critical.
- Efficiency through variational-like inequalities with Lipschitz functions
- Vector critical points and cone efficiency in nonsmooth vector optimization
- A characterization of pseudoinvexity in multiobjective programming
- Generalized convexity and nonsmooth problems of vector optimization
- Vector optimization problem and generalized convexity
- A characterization of pseudoinvexity in multiobjective programming
- Convex Analysis
- Efficiency through variational-like inequalities with Lipschitz functions
- Generalized convexity in multiobjective programming
- Invex functions and generalized convexity in multiobjective programming
- Optimality conditions for \(C^{1,1}\) vector optimization problems
- Optimization and nonsmooth analysis
- Relationships between vector variational-like inequality and optimization problems
- Some relations between variational-like inequality problems and vectorial optimization problems in Banach spaces
- Strict lower semicontinuity of the level sets and invexity of a locally Lipschitz function
- The essence of invexity
- Vector variational-like inequalities and non-smooth vector optimization problems
- What is invexity with respect to the same \(\eta\)?
- What is invexity?
- Critical points index for vector functions and vector optimization
- Derivatives of the efficient point multifunction in parametric vector optimization problems
- Vector critical points and cone efficiency in nonsmooth vector optimization
- Vector critical points and generalized quasi-efficient solutions in nonsmooth multi-objective programming
- On local quasi efficient solutions for nonsmooth vector optimization problems
- Higher order strict global minimizers in non-differentiable multiobjective optimization involving higher order invexity and variational inequality
This page was built for publication: Vector critical points and efficiency in vector optimization with Lipschitz functions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5963690)
