On the exact $$l_{1}$$ penalty function method for convex nonsmooth optimization problems with fuzzy objective function

In this paper, the convex nonsmooth optimization problem with fuzzy objective function and both inequality and equality constraints is considered. The Karush–Kuhn–Tucker necessary optimality conditions are proved for such a nonsmooth extremum problem. Further, the exact $$l_{1}$$ l 1 penalty functio...

Full description

Saved in:
Bibliographic Details
Published in:Soft computing (Berlin, Germany) Germany), 2022-11, Vol.26 (21), p.11627-11643
Main Author: Antczak, Tadeusz
Format: Article
Language:English
Citations: Items that this one cites
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:In this paper, the convex nonsmooth optimization problem with fuzzy objective function and both inequality and equality constraints is considered. The Karush–Kuhn–Tucker necessary optimality conditions are proved for such a nonsmooth extremum problem. Further, the exact $$l_{1}$$ l 1 penalty function method is used for solving the considered nonsmooth fuzzy optimization problem. Therefore, its associated fuzzy penalized optimization problem is constructed in this approach. Then, the exactness property of the exact $$l_{1}$$ l 1 penalty function method is analyzed if it is used for solving the considered nonsmooth convex fuzzy optimization problem.
ISSN:1432-7643
1433-7479
DOI:10.1007/s00500-022-07459-0