A linearized approach for solving differentiable vector optimization problems with vanishing constraints

DOI10.1002/mma.9752zbMATH Open1539.90114MaRDI QIDQ6543200

Tadeusz Antczak

Publication date: 24 May 2024

Published in: Mathematical Methods in the Applied Sciences (Search for Journal in Brave)

zbMATH Keywords

convex functionKarush-Kuhn-Tucker necessary optimality conditionslinearized approachdifferentiable vector optimization problem with vanishing constraints

Mathematics Subject Classification ID

Nonconvex programming, global optimization (90C26) Multi-objective and goal programming (90C29) Nonlinear programming (90C30) Optimality conditions and duality in mathematical programming (90C46) Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming) (90C33)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On duality for mathematical programs with vanishing constraints
• Mathematical programs with vanishing constraints: critical point theory
• Multiobjective optimization problems with modified objective functions and cone constraints and applications
• Mathematical programs with vanishing constraints: optimality conditions and constraint qualifications
• Linear and nonlinear programming.
• First- and second-order optimality conditions for mathematical programs with vanishing constraints.
• Mathematical programs with vanishing constraints: Optimality conditions, sensitivity, and a relaxation method
• The linearization method: Principal concepts and perspective directions
• On strong KKT type sufficient optimality conditions for multiobjective semi-infinite programming problems with vanishing constraints
• An algorithm for nonlinear optimization using linear programming and equality constrained subproblems
• Optimality conditions and Mond-Weir duality for a class of differentiable semi-infinite multiobjective programming problems 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
• Approximation methods in multiobjective programming
• Mathematical programs with vanishing constraints involving strongly invex functions
• Mathematical programs with vanishing constraints: a new regularization approach with strong convergence properties
• On Constraint Qualifications for Multiobjective Optimization Problems with Vanishing Constraints
• On the Abadie and Guignard constraint qualifications for Mathematical Programmes with Vanishing Constraints
• Finding all efficient extreme points for multiple objective linear programs
• Mathematical programs with vanishing constraints: constraint qualifications, their applications, and a new regularization method

This page was built for publication: A linearized approach for solving differentiable vector optimization problems with vanishing constraints