Optimality results for nondifferentiable vector optimization problems with vanishing constraints

DOI10.11948/20220465MaRDI QIDQ6613315

Tadeusz Antczak

Publication date: 2 October 2024

Published in: Journal of Applied Analysis and Computation (Search for Journal in Brave)

zbMATH Keywords

convex functionsubdifferentialKarush-Kuhn-Tucker necessary optimality conditionsnondifferentiable vector optimization with vanishing constraintsVC-Cottle constraint qualification

Mathematics Subject Classification ID

Convex programming (90C25) Multi-objective and goal programming (90C29) Nonlinear programming (90C30) Optimality conditions and duality in mathematical programming (90C46) Nonsmooth analysis (49J52)

Cites Work

• Unnamed Item
• On duality for mathematical programs with vanishing constraints
• Mathematical programs with vanishing constraints: critical point theory
• Mathematical programs with vanishing constraints: optimality conditions and constraint qualifications
• First- and second-order optimality conditions for mathematical programs with vanishing constraints.
• Mathematical programs with vanishing constraints: Optimality conditions, sensitivity, and a relaxation method
• Constraint qualifications and stationary conditions for mathematical programming with non-differentiable vanishing constraints
• On strong KKT type sufficient optimality conditions for multiobjective semi-infinite programming problems with vanishing constraints
• Duality theorems for nondifferentiable semi-infinite interval-valued optimization problems with vanishing constraints
• Karush-Kuhn-Tucker optimality conditions and duality for multiobjective semi-infinite programming with vanishing constraints
• Optimality conditions and Mond-Weir duality for a class of differentiable semi-infinite multiobjective programming problems with vanishing constraints
• New dualities for mathematical programs with vanishing constraints
• Stationary conditions for mathematical programs with vanishing constraints using weak constraint qualifications
• A smoothing-regularization approach to mathematical programs with vanishing constraints
• Enhanced Fritz John stationarity, new constraint qualifications and local error bound for mathematical programs with vanishing constraints
• Optimality conditions and duality theorems for nonsmooth semi-infinite interval-valued mathematical programs with vanishing constraints
• Mathematical programs with vanishing constraints: a new regularization approach with strong convergence properties
• Metric Regularity and Optimality Conditions in Nonsmooth Optimization
• On Constraint Qualifications for Multiobjective Optimization Problems with Vanishing Constraints
• On the Abadie and Guignard constraint qualifications for Mathematical Programmes with Vanishing Constraints
• Optimization and nonsmooth analysis
• Mathematical programs with vanishing constraints: constraint qualifications, their applications, and a new regularization method
• Stationarity Condition for Nonsmooth MPVCs with Constraint Set
• On Perspective Functions and Vanishing Constraints in Mixed-Integer Nonlinear Optimal Control
• Convex Analysis

This page was built for publication: Optimality results for nondifferentiable vector optimization problems with vanishing constraints