An algorithm for solving general D. C. programming problems

DOI10.1016/0167-6377(94)90002-7zbMath0810.90121OpenAlexW2087713257MaRDI QIDQ1332952

Thai Quynh Phong

Publication date: 10 October 1994

Published in: Operations Research Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0167-6377(94)90002-7

zbMATH Keywords

difference of two convex functionsD.C. programmingd.c. constraints

Mathematics Subject Classification ID

Nonlinear programming (90C30) Nonsmooth analysis (49J52)

Related Items (1)

Oscillations in mixed-feedback systems

Cites Work

• Constrained global optimization: algorithms and applications
• On finding new vertices and redundant constraints in cutting plane algorithms for global optimization
• On solving a d.c. programming problem by a sequence of linear programs
• A method for solving d.c. programming problems. Application to fuel mixture nonconvex optimization problem
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: An algorithm for solving general D. C. programming problems