Necessary and sufficient conditions for efficiency via convexificators
From MaRDI portal
Publication:2251552
DOI10.1007/s10957-013-0377-6zbMath1314.90075OpenAlexW1982522297MaRDI QIDQ2251552
Publication date: 14 July 2014
Published in: Journal of Optimization Theory and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10957-013-0377-6
quasiconvex functionsnecessary and sufficient conditions for weak Pareto minimumupper and lower convexificatorsupper regular convexificators
Related Items (17)
Optimality conditions and duality for interval-valued optimization problems using convexifactors ⋮ Contingent derivatives and necessary efficiency conditions for vector equilibrium problems with constraints ⋮ Optimality condition for local efficient solutions of vector equilibrium problems via convexificators and applications ⋮ Optimality conditions in optimization problems with convex feasible set using convexificators ⋮ New second-order optimality conditions for vector equilibrium problems with constraints in terms of contingent derivatives ⋮ Second-order necessary efficiency conditions for nonsmooth vector equilibrium problems ⋮ Optimality and duality in constrained interval-valued optimization ⋮ Characterization of (weakly/properly/robust) efficient solutions in nonsmooth semi-infinite multiobjective optimization using convexificators ⋮ Multiobjective Problems: Enhanced Necessary Conditions and New Constraint Qualifications through Convexificators ⋮ Studniarski's derivatives and efficiency conditions for constrained vector equilibrium problems with applications ⋮ Efficiency conditions for multiobjective bilevel programming problems via convexificators ⋮ Optimality conditions and duality in terms of convexificators for multiobjective bilevel programming problem with equilibrium constraints ⋮ Unnamed Item ⋮ Optimality conditions in terms of contingent epiderivatives for strict local Pareto minima in vector optimization problems with constraints ⋮ Necessary and sufficient optimality conditions for constrained vector equilibrium problems using contingent hypoderivatives ⋮ Necessary efficiency conditions for vector equilibrium problems with general inequality constraints via convexificators ⋮ Optimality conditions for the efficient solutions of vector equilibrium problems with constraints in terms of directional derivatives and applications
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Optimality conditions for optimistic bilevel programming problem using convexifactors
- Optimality and duality results for bilevel programming problem using convexifactors
- Convexifactors, generalized convexity, and optimality conditions
- Nonsmooth calculus, minimality, and monotonicity of convexificators
- Hunting for a smaller convex subdifferential
- A finite dimensional extension of Lyusternik theorem with applications to multiobjective optimization
- Necessary conditions for efficiency in terms of the Michel–Penot subdifferentials
- Optimization and nonsmooth analysis
- Approximate Jacobian Matrices for Nonsmooth Continuous Maps and C1-Optimization
- Convexifactors, generalized convexity and vector optimization
- A Multiplier Rule for Multiobjective Programming Problems with Continuous Data
- Continuous generalized convex functions and their characterizations
- Convexificators and necessary conditions for efficiency
- Convex Analysis
- Set-valued analysis
This page was built for publication: Necessary and sufficient conditions for efficiency via convexificators
