LAUSR.org creates dashboard-style pages of related content for over 1.5 million academic articles. Sign Up to like articles & get recommendations!

The DTC (difference of tangentially convex functions) programming: optimality conditions

Photo from wikipedia

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… Click to show full 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.

Keywords: optimality conditions; optimality; convex functions; tangentially convex; dtc difference

Journal Title: TOP
Year Published: 2021

Link to full text (if available)


Share on Social Media:                               Sign Up to like & get
recommendations!

Related content

More Information              News              Social Media              Video              Recommended



                Click one of the above tabs to view related content.