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

DOI10.1007/s11750-021-00615-zzbMath1489.90139OpenAlexW3190840922MaRDI QIDQ2146366

Nooshin Movahedian, F. Mashkoorzadeh, Soghra Nobakhtian

Publication date: 16 June 2022

Published in: Top (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s11750-021-00615-z

zbMATH Keywords

nonsmooth optimizationoptimality conditionsnonconvex optimizationtangential subdifferentialdifference of tangentially convex functions

Mathematics Subject Classification ID

Nonconvex programming, global optimization (90C26) Nonlinear programming (90C30) Optimality conditions and duality in mathematical programming (90C46) Nonsmooth analysis (49J52)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On representations of the feasible set in convex optimization
• On the minimization of difference functions
• A production-transportation problem with stochastic demand and concave production costs
• Duality in D. C. programming: The case of several D. C. constraints
• Shape analysis via oriented distance functions
• DC programming and DCA: thirty years of developments
• A study of the difference-of-convex approach for solving linear programs with complementarity constraints
• The DC (Difference of convex functions) programming and DCA revisited with DC models of real world nonconvex optimization problems
• Margin maximization in spherical separation
• Optimality conditions in convex optimization revisited
• DC programming: overview.
• A heuristic algorithm for solving the minimum sum-of-squares clustering problems
• An optimization-diversification approach to portfolio selection
• Optimality conditions for pseudoconvex minimization over convex sets defined by tangentially convex constraints
• Nonsmooth DC programming approach to the minimum sum-of-squares clustering problems
• Portfolio optimization with linear and fixed transaction costs
• Duality for nonconvex approximation and optimization.
• Solution of the Multisource Weber and Conditional Weber Problems by D.-C. Programming
• Computing B-Stationary Points of Nonsmooth DC Programs
• Functional Analysis, Calculus of Variations and Optimal Control
• Portfolio Optimization and Performance Analysis
• Necessary and Sufficient Conditions for Isolated Local Minima of Nonsmooth Functions
• Semismooth and Semiconvex Functions in Constrained Optimization
• Double Bundle Method for finding Clarke Stationary Points in Nonsmooth DC Programming
• First-Order Methods in Optimization
• Nonsmooth DC programming approach to clusterwise linear regression: optimality conditions and algorithms
• An introduction to the theory of nonsmooth optimization
• Optimality Conditions for Nonconvex Constrained Optimization Problems
• Difference-of-Convex Learning: Directional Stationarity, Optimality, and Sparsity
• Nonlinear Programming

This page was built for publication: The DTC (difference of tangentially convex functions) programming: optimality conditions