A redistributed cutting plane bundle-type algorithm for multiobjective nonsmooth optimization
I construct a new cutting-plane model for approximating nonsmooth nonconvex functions in multiobjective optimization and propose a new bundle-type method with the help of an improvement function. The presented bundle method possesses three features. Firstly, the objective and constraint functions ar...
Main Author: | Jia-Tong Li |
---|---|
Format: | Article |
Language: | English |
Published: |
AIMS Press
2022-05-01
|
Series: | AIMS Mathematics |
Subjects: | |
Online Access: | https://www.aimspress.com/article/doi/10.3934/math.2022710?viewType=HTML |
Similar Items
-
Bundle Enrichment Method for Nonsmooth Difference of Convex Programming Problems
by: Manlio Gaudioso, et al.
Published: (2023-08-01) -
Optimality and duality for nonsmooth semi-infinite multiobjective programming with support functions
by: Singh Yadvendra, et al.
Published: (2017-01-01) -
Efficiency and duality in nonsmooth multiobjective fractional programming involving η-pseudolinear functions
by: Mishra S.K., et al.
Published: (2012-01-01) -
Stationary Condition for Borwein Proper Efficient Solutions of Nonsmooth Multiobjective Problems with Vanishing Constraints
by: Hui Huang, et al.
Published: (2022-12-01) -
Sufficient optimality conditions and duality for nonsmooth multiobjective optimization problems via higher order strong convexity
by: Upadhyay Balendu B., et al.
Published: (2017-01-01)