Optimality analysis for \(\epsilon\)-quasi solutions of optimization problems via \(\epsilon\)-upper convexificators: a dual approach

Cites Work

Title not available (Why is that?)
Title not available (Why is that?)
Title not available (Why is that?)
Title not available (Why is that?)
Optimality condition for local efficient solutions of vector equilibrium problems via convexificators and applications
On approximate efficiency in multiobjective programming
\(\epsilon\)-solutions in vector minimization problems
Epsilon efficiency
A generalized derivative for calm and stable functions
Nonsmooth calculus, minimality, and monotonicity of convexificators
Constraint qualifications and Lagrange multipliers in nondifferentiable programming problems
Hunting for a smaller convex subdifferential
Second-order necessary efficiency conditions for nonsmooth vector equilibrium problems
Optimality and duality in constrained interval-valued optimization
Necessary conditions for weak minima and for strict minima of order two in nonsmooth constrained multiobjective optimization
Necessary and sufficient conditions for efficiency via convexificators
Necessary conditions for weak efficiency for nonsmooth degenerate multiobjective optimization problems
\(\epsilon\)-duality of nondifferentiable nonconvex multiobjective programming
Optimality conditions for \(\epsilon \)-quasi solutions of optimization problems via \(\epsilon \)-upper convexificators with applications
Necessary efficiency conditions for vector equilibrium problems with general inequality constraints via convexificators
Optimality and duality for nonsmooth mathematical programming problems with equilibrium constraints
Optimality conditions and duality for nonsmooth vector equilibrium problems with constraints
Necessary conditions for efficiency in terms of the Michel–Penot subdifferentials
Optimization and nonsmooth analysis
A duality theorem for non-linear programming
Necessary conditions for ε-optimality
Approximate Jacobian Matrices for Nonsmooth Continuous Maps and C¹-Optimization
Optimality conditions for mildly nonsmooth constrained optimization
First-order necessary conditions in locally Lipschitz multiobjective optimization
The Linear Nonconvex Generalized Gradient and Lagrange Multipliers
Approximations and Metric Regularity in Mathematical Programming in Banach Space
Convex Analysis
Characterizations of nonemptiness and compactness of the set of weakly efficient solutions for convex vector optimization and applications
Optimality and duality for robust multiobjective optimization problems
Robust optimality conditions and duality for nonsmooth multiobjective fractional semi-infinite programming problems with uncertain data

This page was built for publication: Optimality analysis for \(\epsilon\)-quasi solutions of optimization problems via \(\epsilon\)-upper convexificators: a dual approach

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