Approximate Karush-Kuhn-Tucker condition in multiobjective optimization

DOI10.1007/s10957-016-0986-yzbMath1351.90144OpenAlexW2477824598MaRDI QIDQ727219

Bienvenido Jiménez, Giorgio Giorgi, Vicente Novo Sanjurjo

Publication date: 6 December 2016

Published in: Journal of Optimization Theory and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10957-016-0986-y

zbMATH Keywords

vector optimization problemssequential optimality conditionsenhanced Karush-Kuhn-Tucker conditionsapproximate optimality conditionsenhanced Fritz John conditions

Mathematics Subject Classification ID

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

Related Items (16)

Multiobjective approximate gradient projection method for constrained vector optimization: sequential optimality conditions without constraint qualifications ⋮ An approximate strong KKT condition for multiobjective optimization ⋮ Approximations for Pareto and proper Pareto solutions and their KKT conditions ⋮ Approximate Karush-Kuhn-Tucker condition for multi-objective optimistic bilevel programming problems ⋮ Solving Nonsmooth Bi-Objective Environmental andEconomic Dispatch Problem using Smoothing Techniques ⋮ Optimality conditions for approximate proper solutions in multiobjective optimization with polyhedral cones ⋮ Optimality conditions for nonlinear second-order cone programming and symmetric cone programming ⋮ On the behavior of Lagrange multipliers in convex and nonconvex infeasible interior point methods ⋮ A note on approximate Karush-Kuhn-Tucker conditions in locally Lipschitz multiobjective optimization ⋮ Multiobjective Problems: Enhanced Necessary Conditions and New Constraint Qualifications through Convexificators ⋮ Unnamed Item ⋮ On the sensitivity of Pareto efficiency in set-valued optimization problems ⋮ Constraint qualifications for Karush-Kuhn-Tucker conditions in multiobjective optimization ⋮ Proximity measures based on KKT points for constrained multi-objective optimization ⋮ Optimality conditions and global convergence for nonlinear semidefinite programming ⋮ On Optimality Conditions for Nonlinear Conic Programming

Cites Work

• Unnamed Item
• Unnamed Item
• On approximate KKT condition and its extension to continuous variational inequalities
• Modified Kuhn-Tucker conditions when a minimum is not attained
• On the relation between constant positive linear dependence condition and quasinormality constraint qualification
• Convergence detection for optimization algorithms: approximate-KKT stopping criterion when Lagrange multipliers are not available
• Pseudonormality and a Lagrange multiplier theory for constrained optimization
• Approximate KKT points and a proximity measure for termination
• A New Sequential Optimality Condition for Constrained Optimization and Algorithmic Consequences
• Optimization and nonsmooth analysis
• Asymptotic kuhn-tucker conditions in abstract spaces
• The Lagrange Multiplier Rule
• Extensions of Asymptotic Kuhn–Tucker Conditions in Mathematical Programming
• Asymptotic Lagrange Regularity for Pseudoconcave Programming with Weak Constraint Qualification
• The Slacked Unconstrained Minimization Technique for Convex Programming
• On sequential optimality conditions for smooth constrained optimization

This page was built for publication: Approximate Karush-Kuhn-Tucker condition in multiobjective optimization