On the problem of minimizing a difference of polyhedral convex functions under linear constraints

DOI10.1007/S10957-015-0769-XzbMath1349.49019OpenAlexW2124024943MaRDI QIDQ346824

Nguyen Thi Van Hang, Nguyen Dong Yen

Publication date: 30 November 2016

Published in: Journal of Optimization Theory and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10957-015-0769-x

zbMATH Keywords

extreme pointoptimality conditionssubdifferentialdensitystationary pointactive index setd.p. programming

Mathematics Subject Classification ID

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

Related Items (3)

The cone condition and nonsmoothness in linear generalized Nash games ⋮ Qualitative properties of the minimum sum-of-squares clustering problem ⋮ Sufficient conditions for error bounds of difference functions and applications

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On global unconstrained minimization of the difference of polyhedral functions
• An aggregate subgradient method for nonsmooth and nonconvex minimization
• Convex analysis approach to d. c. programming: Theory, algorithms and applications
• Fréchet subdifferential calculus and optimality conditions in nondifferentiable programming
• Mordukhovich subdifferential of pointwise minimum of approximate convex functions
• Minimizing Nonconvex Nonsmooth Functions via Cutting Planes and Proximity Control
• Convex Analysis
• Gobally convergent variable metric method for nonconvex nondifferentiable unconstrained minimization

This page was built for publication: On the problem of minimizing a difference of polyhedral convex functions under linear constraints