The DTC (difference of tangentially convex functions) programming: optimality conditions
We focus on optimality conditions for an important class of nonconvex and nonsmooth optimization problems, where the objective and constraint functions are presented as a difference of two tangentially convex functions. The main contribution of this paper is to clarify several kinds of stationary so...
Saved in:
| Published in: | TOP Vol. 30; no. 2; pp. 270 - 295 |
|---|---|
| Main Authors: | , , |
| Format: | Journal Article |
| Language: | English |
| Published: |
Berlin/Heidelberg
Springer Berlin Heidelberg
01.07.2022
Springer Nature B.V |
| Subjects: | |
| ISSN: | 1134-5764, 1863-8279 |
| Online Access: | Get full text |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| Summary: | We focus on optimality conditions for an important class of nonconvex and nonsmooth optimization problems, where the objective and constraint functions are presented as a difference of two tangentially convex functions. The main contribution of this paper is to clarify several kinds of stationary solutions and their relations, and establish local optimality conditions with a nonconvex feasible set. Finally, several examples are given to illustrate the effectiveness of the obtained results. |
|---|---|
| Bibliography: | ObjectType-Article-1 SourceType-Scholarly Journals-1 ObjectType-Feature-2 content type line 14 |
| ISSN: | 1134-5764 1863-8279 |
| DOI: | 10.1007/s11750-021-00615-z |