A generalized proximal linearized algorithm for DC functions with application to the optimal size of the firm problem.
João Xavier da Cruz NetoPaolo Roberto OliveiraAntoine SoubeyranJoao Carlos de Oliveira SouzaPublished in: Ann. Oper. Res. (2020)
Keyphrases
- dynamic programming
- computational complexity
- optimal solution
- detection algorithm
- learning algorithm
- worst case
- computational cost
- space complexity
- high accuracy
- memory requirements
- times faster
- significant improvement
- dc programming
- information technology
- matching algorithm
- path planning
- closed form
- preprocessing
- exhaustive search
- fixed size
- cost function
- k means
- objective function
- convergence rate
- similarity measure
- globally optimal
- optimal parameters
- convex functions
- clustering algorithm