scientific article; zbMATH DE number 4064775
[For the entire collection see Zbl 0647.00009.] We present a modified version of \textit{H. Tuy}'s method [in: Fermat days 85: Mathematics for optimization, Toulouse/France 1985, North-Holland Math. Stud. 129, 273-303 (1986; Zbl 0623.65067)] for solving a class of global optimization problems called d.c. programs, i.e. programs in which the objective function is linear and the feasible set is the intersection of a closed convex set and the complement of an open convex set. This algorithm is then applied to a convex programming problem with additional constraints of complementarity type and to a design centering problem with polyhedral structure.
- A modified version of Tuy's method for solving d.c. programing problem
- On solving a d.c. programming problem by a sequence of linear programs
- Convex analysis approach to d. c. programming: Theory, algorithms and applications
- scientific article; zbMATH DE number 4131966
- The design centering problem as a d.c. programming problem
- The design centering problem as a d.c. programming problem
- Computing a global optimal solution to a design centering problem
- Outer approximation algorithms for canonical DC problems
- scientific article; zbMATH DE number 4131966 (Why is no real title available?)
- Successive search methods for solving a canonical DC programming problem
- Outer approximation method incorporating a quadratic approximation for a DC programming problem
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3798482)