DC programming : a variant of DCA via decomposition

Cites work

A DC programming approach for a class of bilevel programming problems and its application in portfolio selection
An extended Fenchel-Lagrange duality approach and optimality conditions for strong bilevel programming problems
Convergence and restart in branch-and-bound algorithms for global optimization. Application to concave minimization and d.c. optimization problems
Convex Analysis
Convex analysis approach to d. c. programming: Theory, algorithms and applications
Convex programs with an additional reverse convex constraint
DC programming and DCA for general DC programs
DC programming and DCA: thirty years of developments
DC programming: overview.
Duality for multiobjective optimization problems with convex objective functions and D.C. constraints
Duality in D. C. programming: The case of several D. C. constraints
Global minimization of a difference of two convex functions
scientific article; zbMATH DE number 439380 (Why is no real title available?)
scientific article; zbMATH DE number 4011808 (Why is no real title available?)
scientific article; zbMATH DE number 4032473 (Why is no real title available?)
scientific article; zbMATH DE number 1148264 (Why is no real title available?)
scientific article; zbMATH DE number 757676 (Why is no real title available?)
On solving a d.c. programming problem by a sequence of linear programs
Open issues and recent advances in DC programming and DCA
Reverse convex programs: stability and global optimality
The ABC of DC programming
The boosted DC algorithm for linearly constrained DC programming

This page was built for publication: DC programming : a variant of DCA via decomposition

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7227247)