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

DOI10.1007/S11750-021-00615-ZMaRDI QIDQ2146366zbMATH OpenOpenAlexFDO

Authors Feryal Mashkoorzadeh, N. Movahedian, S. 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

nonconvex optimizationnonsmooth optimizationoptimality conditionstangential subdifferentialdifference of tangentially convex functions

Mathematics Subject Classification ID

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

Recommendations

• Optimality Conditions for Nonconvex Constrained Optimization Problems
• Conditions characterizing minima of the difference of functions
• Optimality conditions in the problem of maximization of the difference of two convex functions
• KKT optimality conditions in non-smooth, non-convex optimization
• A difference of convex and polyhedral convex functions programming problem

Cites work

• scientific article; zbMATH DE number 3950216 (Why is no real title available?)
• scientific article; zbMATH DE number 47153 (Why is no real title available?)
• scientific article; zbMATH DE number 1113627 (Why is no real title available?)
• scientific article; zbMATH DE number 3336546 (Why is no real title available?)
• A heuristic algorithm for solving the minimum sum-of-squares clustering problems
• A production-transportation problem with stochastic demand and concave production costs
• A study of the difference-of-convex approach for solving linear programs with complementarity constraints
• An introduction to the theory of nonsmooth optimization
• An optimization-diversification approach to portfolio selection
• Computing B-stationary points of nonsmooth DC programs
• DC programming and DCA: thirty years of developments
• DC programming: overview.
• Difference-of-convex learning: directional stationarity, optimality, and sparsity
• Double bundle method for finding Clarke stationary points in nonsmooth DC programming
• Duality for nonconvex approximation and optimization.
• Duality in D. C. programming: The case of several D. C. constraints
• First-order methods in optimization
• Functional analysis, calculus of variations and optimal control
• Margin maximization in spherical separation
• Necessary and Sufficient Conditions for Isolated Local Minima of Nonsmooth Functions
• Nonlinear Programming
• Nonsmooth DC programming approach to clusterwise linear regression: optimality conditions and algorithms
• Nonsmooth DC programming approach to the minimum sum-of-squares clustering problems
• On representations of the feasible set in convex optimization
• On the minimization of difference functions
• Optimality Conditions for Nonconvex Constrained Optimization Problems
• Optimality conditions for pseudoconvex minimization over convex sets defined by tangentially convex constraints
• Optimality conditions in convex optimization revisited
• Portfolio Optimization and Performance Analysis
• Portfolio optimization with linear and fixed transaction costs
• Semismooth and Semiconvex Functions in Constrained Optimization
• Shape analysis via oriented distance functions
• Solution of the multisource Weber and conditional Weber problems by d. -c. programming
• The DC (Difference of convex functions) programming and DCA revisited with DC models of real world nonconvex optimization problems

Cited in

(2)

• Optimality Conditions for Nonconvex Constrained Optimization Problems
• DP optimization: optimality conditions and numerical methods

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2146366)