@article{mashkoorzadeh_dtc_2021,
	title = {The {DTC} ({Difference} of {Tangentially} {Convex} {Functions}) {Programming}: {Optimality} {Conditions}},
	issn = {1134-5764, 1863-8279},
	shorttitle = {The {Dtc} (difference of {Tangentially} {Convex} {Functions}) {Programming}},
	url = {https://link.springer.com/10.1007/s11750-021-00615-z},
	doi = {10/gpx7k7},
	abstract = {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.},
	language = {en},
	urldate = {2022-04-22},
	journal = {TOP},
	author = {Mashkoorzadeh, F. and Movahedian, N. and Nobakhtian, S.},
	month = aug,
	year = {2021},
	keywords = {/unread},
}

{"_id":"fzF9k4EKPvWcApX9i","bibbaseid":"mashkoorzadeh-movahedian-nobakhtian-thedtcdifferenceoftangentiallyconvexfunctionsprogrammingoptimalityconditions-2021","author_short":["Mashkoorzadeh, F.","Movahedian, N.","Nobakhtian, S."],"bibdata":{"bibtype":"article","type":"article","title":"The DTC (Difference of Tangentially Convex Functions) Programming: Optimality Conditions","issn":"1134-5764, 1863-8279","shorttitle":"The Dtc (difference of Tangentially Convex Functions) Programming","url":"https://link.springer.com/10.1007/s11750-021-00615-z","doi":"10/gpx7k7","abstract":"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.","language":"en","urldate":"2022-04-22","journal":"TOP","author":[{"propositions":[],"lastnames":["Mashkoorzadeh"],"firstnames":["F."],"suffixes":[]},{"propositions":[],"lastnames":["Movahedian"],"firstnames":["N."],"suffixes":[]},{"propositions":[],"lastnames":["Nobakhtian"],"firstnames":["S."],"suffixes":[]}],"month":"August","year":"2021","keywords":"/unread","bibtex":"@article{mashkoorzadeh_dtc_2021,\n\ttitle = {The {DTC} ({Difference} of {Tangentially} {Convex} {Functions}) {Programming}: {Optimality} {Conditions}},\n\tissn = {1134-5764, 1863-8279},\n\tshorttitle = {The {Dtc} (difference of {Tangentially} {Convex} {Functions}) {Programming}},\n\turl = {https://link.springer.com/10.1007/s11750-021-00615-z},\n\tdoi = {10/gpx7k7},\n\tabstract = {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.},\n\tlanguage = {en},\n\turldate = {2022-04-22},\n\tjournal = {TOP},\n\tauthor = {Mashkoorzadeh, F. and Movahedian, N. and Nobakhtian, S.},\n\tmonth = aug,\n\tyear = {2021},\n\tkeywords = {/unread},\n}\n\n","author_short":["Mashkoorzadeh, F.","Movahedian, N.","Nobakhtian, S."],"key":"mashkoorzadeh_dtc_2021","id":"mashkoorzadeh_dtc_2021","bibbaseid":"mashkoorzadeh-movahedian-nobakhtian-thedtcdifferenceoftangentiallyconvexfunctionsprogrammingoptimalityconditions-2021","role":"author","urls":{"Paper":"https://link.springer.com/10.1007/s11750-021-00615-z"},"keyword":["/unread"],"metadata":{"authorlinks":{}},"html":""},"bibtype":"article","biburl":"https://bibbase.org/zotero/victorjhu","dataSources":["CmHEoydhafhbkXXt5"],"keywords":["/unread"],"search_terms":["dtc","difference","tangentially","convex","functions","programming","optimality","conditions","mashkoorzadeh","movahedian","nobakhtian"],"title":"The DTC (Difference of Tangentially Convex Functions) Programming: Optimality Conditions","year":2021}