Optimality conditions for \(\epsilon \)-quasi solutions of optimization problems via \(\epsilon \)-upper convexificators with applications

DOI10.1007/s11590-018-1287-1zbMath1436.90150OpenAlexW2811008334MaRDI QIDQ2311117

Adela Elisabeta Capătă

Publication date: 10 July 2019

Published in: Optimization Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s11590-018-1287-1

zbMATH Keywords

optimality conditionspseudoconvexity\(\epsilon\)-quasi efficient\(\epsilon\)-upper convexificator

Mathematics Subject Classification ID

Multi-objective and goal programming (90C29) Nonlinear programming (90C30) Optimality conditions and duality in mathematical programming (90C46)

Related Items (2)

Unnamed Item ⋮ Approximate optimality for quasi approximate solutions in nonsmooth semi-infinite programming problems, using ε-upper semi-regular semi-convexificators

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Optimality condition for local efficient solutions of vector equilibrium problems via convexificators and applications
• On vector equilibrium problems 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
• On constraint qualifications
• Hunting for a smaller convex subdifferential
• \(\epsilon\)-duality of nondifferentiable nonconvex multiobjective programming
• Farkas-type results for vector-valued functions with applications
• Existence results for strong vector equilibrium problems and their applications
• Optimization and nonsmooth analysis
• Approximate subdifferentials and applications II
• Necessary conditions for ε-optimality
• Approximate Jacobian Matrices for Nonsmooth Continuous Maps and C¹-Optimization
• On generalised convex nonsmooth functions
• A Sharp Lagrange Multiplier Rule for Nonsmooth Mathematical Programming Problems Involving Equality Constraints
• The Linear Nonconvex Generalized Gradient and Lagrange Multipliers
• Characterizations of nonemptiness and compactness of the set of weakly efficient solutions for convex vector optimization and applications

This page was built for publication: Optimality conditions for \(\epsilon \)-quasi solutions of optimization problems via \(\epsilon \)-upper convexificators with applications