On global unconstrained minimization of the difference of polyhedral functions
From MaRDI portal
Publication:540713
DOI10.1007/s10898-010-9589-6zbMath1242.90180MaRDI QIDQ540713
Publication date: 3 June 2011
Published in: Journal of Global Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10898-010-9589-6
difference of convex functions; global optimization; conjugate function; hypodifferential; polyhedral functions
90C26: Nonconvex programming, global optimization
Related Items
Cites Work
- On functions representable as a difference of convex functions
- Global optimality conditions for nonconvex optimization
- Duality in D. C. programming: The case of several D. C. constraints
- Convex analysis approach to d. c. programming: Theory, algorithms and applications
- Recent developments and trends in global optimization
- Global minimization of a difference of two convex functions
- A modified version of Tuy's method for solving d.c. programing problem
- Convex Analysis
- Introduction to global optimization.
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item