Approximate solutions for multi-objective optimization problems via scalarizing and nonscalarizing methods

DOI10.37193/CJM.2026.02.14MaRDI QIDQ6845836zbMATH OpenFDO

Authors T. Q. Son, Hua Khac Bao, Narin Petrot

Publication date 12 March 2026

Published in Carpathian Journal of Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.37193/CJM.2026.02.14

zbMATH Keywords

\( \varepsilon \)-quasi normal set\( \varepsilon \)-quasi subdifferentialalmost \(\varepsilon\) Pareto solutionsalmost weakly \(\varepsilon \)-Pareto solutions

Mathematics Subject Classification ID

Abstract approximation theory (approximation in normed linear spaces and other abstract spaces) (41A65) Nonconvex programming, global optimization (90C26) Optimality conditions and duality in mathematical programming (90C46)

Cites work

• _∊-gradients pour les ponctions localements lipschitziennes et applications
• -optimal solutions in nonconvex semi-infinite programs with support functions
• \(\epsilon\)-duality of nondifferentiable nonconvex multiobjective programming
• \(\varepsilon \)-mixed type duality for nonconvex multiobjective programs with an infinite number of constraints
• \(\varepsilon \)-optimality and \(\varepsilon \)-Lagrangian duality for a nonconvex programming problem with an infinite number of constraints
• Adaptive subgradient method for the split quasi-convex feasibility problems
• Almost -quasi solutions for nonconvex semi-infinite optimization problems
• An approach to -duality theorems for nonconvex semi-infinite multiobjective optimization problems
• An approach to characterizing \(\epsilon\)-solution sets of convex programs
• An easy path to convex analysis and applications
• Approximate optimality conditions for nonsmooth optimization problems
• Approximate quasi efficient solutions in multiobjective optimization
• Approximate saddle-point theorems in vector optimization
• Approximate solutions of multiobjective optimization problems
• Concepts for approximate solutions of vector optimization problems with variable order structures
• Constructing a perfect duality in infinite programming
• Convergence of solutions to set optimization problems with the set less order relation
• Epsilon approximate solutions for multiobjective programming problems
• Epsilon efficiency
• Generalized -quasi-solutions in multiobjective optimization problems: existence results and optimality conditions
• scientific article; zbMATH DE number 4010155 (Why is no real title available?)
• scientific article; zbMATH DE number 3737398 (Why is no real title available?)
• scientific article; zbMATH DE number 1070896 (Why is no real title available?)
• Multicriteria Optimization
• Necessary conditions for ε-optimality
• Necessary optimality conditions and saddle points for approximate optimization in Banach space
• Nonsmooth analysis
• On AKKT optimality conditions for cone-constrained vector optimization problems
• On approximate solutions in vector optimization problems via scalarization
• Optimality conditions for approximate Pareto solutions of a nonsmooth vector optimization problem with an infinite number of constraints
• Optimization and nonsmooth analysis
• Proper Efficiency in Nonconvex Multicriteria Programming
• Scalarizations for approximate quasi efficient solutions in multiobjective optimization problems
• ε-Optimal solutions in nondifferentiable convex programming and some related questions
• ε-Optimality Conditions for Vector Optimization Problems with Set-Valued Maps
• ε-Subdifferential and ε-monotonicity

This page was built for publication: Approximate solutions for multi-objective optimization problems via scalarizing and nonscalarizing methods

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6845836)