Asymptotic cones and efficiency conditions in multi-objective optimization problems
Summary
No summary yet. VIRAT can read this paper and write a plain-language summary of its aim, methods, key findings and limitations.
Summarise with VIRAT Free to try with your Science Catalogs account.Abstract
In this paper, we mainly investigate the (proper) efficiency in nonconvex multi-objective optimization. We observe that the asymptotic cone of a set is closely linked to both the existence and boundedness of the efficient points of the set. First, we introduce several new concepts: (C-) asymptotically regular sets and (C-) asymptotically convex sets, which generalize the regularity and convexity, respectively. Secondly, we demonstrate that if a closed set is C-asymptotically regular (convex), then the existence of (properly) efficient points, domination property, C-boundedness, C-semicompactness and C-compactness of the set are equivalent. Furthermore, by analyzing the relations between the asymptotic cone of a set and the ordering cone, we establish the boundedness (or unboundedness) of the efficient point set. Finally, we apply these results to the piecewise convex multi-objective optimization problem.
Fields of Study & Subjects
Optimization and Variational Analysis
Advanced Multi-Objective Optimization Algorithms
Advanced Optimization Algorithms Research
Publication details
- Journal / source
- Optimization
- Volume
- 75
- Issue
- 14
- Pages
- 3835–3853
- Publication date
- 31 March 2026
- Language
- EN