Lagrange Duality and Saddle Point Optimality Conditions for Multiobjective Semi-Infinite Programming with Vanishing Constraints

DOI10.1080/01630563.2024.2305347OpenAlexW4391477384WikidataQ128748093 ScholiaQ128748093MaRDI QIDQ6198473

Unnamed Author, Le Thanh Tung, Unnamed Author

Publication date: 23 February 2024

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

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

zbMATH Keywords

vanishing constraintssaddle point optimality conditionsmultiobjective semi-infinite programmingscalarized Lagrange dual problemsvector Lagrange dual problems

Mathematics Subject Classification ID

Mathematical programming (90Cxx)

Cites Work

• Unnamed Item
• Isolated and proper efficiencies in semi-infinite vector optimization problems
• Mathematical programs with vanishing constraints: optimality conditions and constraint qualifications
• First- and second-order optimality conditions for mathematical programs with vanishing constraints.
• Theory of multiobjective optimization
• Lagrange multipliers and saddle points in multiobjective programming
• Normal regularity for the feasible set of semi-infinite multiobjective optimization problems with applications
• 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
• Saddle point optimality criteria for mathematical programming problems with equilibrium constraints
• Characterization results of solutions in interval-valued optimization problems with mixed constraints
• Karush-Kuhn-Tucker optimality conditions and duality for multiobjective semi-infinite programming with vanishing constraints
• A perturbation approach to vector optimization problems: Lagrange and Fenchel-Lagrange duality
• Optimality conditions and Mond-Weir duality for a class of differentiable semi-infinite multiobjective programming problems with vanishing constraints
• On a modified optimal control problem with first-order PDE constraints and the associated saddle-point optimality criterion
• Optimality conditions for nonsmooth semi-infinite multiobjective programming
• Duality in Vector Optimization
• Scalarization and lagrange duality in multiobjective optimization
• THE SIMULTANEOUS APPROXIMATION OF MAGNITUDE AND PHASE BY FIR DIGITAL FILTERS. I: A NEW APPROACH
• Numerical solution of optimal control problems with explicit and implicit switches
• Characterization of (weakly/properly/robust) efficient solutions in nonsmooth semi-infinite multiobjective optimization using convexificators
• Saddle-point optimality criteria involving (p, b, d)-invexity and (p, b, d)-pseudoinvexity in interval-valued optimisation problems
• Karush-Kuhn-Tucker optimality conditions and duality for semi-infinite programming problems with vanishing constraints
• A Cutting Surface Algorithm for Semi-Infinite Convex Programming with an Application to Moment Robust Optimization
• Multicriteria Optimization
• Convex Analysis
• Set-valued analysis
• New representations of epigraphs of conjugate mappings and Lagrange, Fenchel–Lagrange duality for vector optimization problems

This page was built for publication: Lagrange Duality and Saddle Point Optimality Conditions for Multiobjective Semi-Infinite Programming with Vanishing Constraints