The DTC (difference of tangentially convex functions) programming: optimality conditions
DOI10.1007/S11750-021-00615-ZzbMATH Open1489.90139OpenAlexW3190840922MaRDI QIDQ2146366FDOQ2146366
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
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
nonconvex optimizationnonsmooth optimizationoptimality conditionstangential subdifferentialdifference of tangentially convex functions
Optimality conditions and duality in mathematical programming (90C46) Nonconvex programming, global optimization (90C26) Nonlinear programming (90C30) Nonsmooth analysis (49J52)
Cites Work
- DC programming: overview.
- Title not available (Why is that?)
- First-Order Methods in Optimization
- Functional Analysis, Calculus of Variations and Optimal Control
- Semismooth and Semiconvex Functions in Constrained Optimization
- Title not available (Why is that?)
- Portfolio optimization with linear and fixed transaction costs
- Necessary and Sufficient Conditions for Isolated Local Minima of Nonsmooth Functions
- Nonlinear Programming
- The DC (Difference of convex functions) programming and DCA revisited with DC models of real world nonconvex optimization problems
- Duality in D. C. programming: The case of several D. C. constraints
- Portfolio Optimization and Performance Analysis
- A production-transportation problem with stochastic demand and concave production costs
- Title not available (Why is that?)
- Title not available (Why is that?)
- Margin maximization in spherical separation
- Solution of the multisource Weber and conditional Weber problems by d. -c. programming
- Nonsmooth DC programming approach to the minimum sum-of-squares clustering problems
- Shape analysis via oriented distance functions
- A heuristic algorithm for solving the minimum sum-of-squares clustering problems
- Optimality conditions in convex optimization revisited
- On representations of the feasible set in convex optimization
- Duality for nonconvex approximation and optimization.
- On the minimization of difference functions
- An introduction to the theory of nonsmooth optimization
- Computing B-Stationary Points of Nonsmooth DC Programs
- Optimality Conditions for Nonconvex Constrained Optimization Problems
- DC programming and DCA: thirty years of developments
- Optimality conditions for pseudoconvex minimization over convex sets defined by tangentially convex constraints
- Double Bundle Method for finding Clarke Stationary Points in Nonsmooth DC Programming
- A study of the difference-of-convex approach for solving linear programs with complementarity constraints
- An optimization-diversification approach to portfolio selection
- Difference-of-Convex Learning: Directional Stationarity, Optimality, and Sparsity
- Nonsmooth DC programming approach to clusterwise linear regression: optimality conditions and algorithms
Cited In (1)
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)
