Pareto Optimizing and Kuhn–Tucker Stationary Sequences

DOI10.1080/01630560701249954zbMath1123.90057MaRDI QIDQ3444667

Mounir El Maghri, Benaissa Bernoussi

Publication date: 4 June 2007

Published in: Numerical Functional Analysis and Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/01630560701249954

zbMATH Keywords

vector optimization; variational principle; approximation; error bound; unboundedness; infeasibility; well-behavedness; Pareto infimal set

Mathematics Subject Classification ID

90C25: Convex programming

90C29: Multi-objective and goal programming

90C59: Approximation methods and heuristics in mathematical programming

90C48: Programming in abstract spaces

Cites Work

• Unnamed Item
• Unnamed Item
• Theory of multiobjective optimization
• A survey of vector optimization in infinite-dimensional spaces. II
• Semi-continuous mappings in general topology
• Approximation in multiobjective optimization
• Pareto optimizing and scalarly stationary sequences
• Approximate efficiency and scalar stationarity in unbounded nonsmooth convex vector optimization problems
• A smooth variational principle with applications to Hamilton-Jacobi equations in infinite dimensions
• A Condition Number for Differentiable Convex Inequalities
• Global Regularity Theorems
• Tangent Cones, Generalized Gradients and Mathematical Programming in Banach Spaces
• Minimizing and Stationary Sequences of Constrained Optimization Problems
• Convex Functions with Unbounded Level Sets and Applications to Duality Theory
• Extension of Hoffman’s Error Bound to Polynomial Systems
• Convex Analysis