Skip to Main content Skip to Navigation
Journal articles

A generalized proximal linearized algorithm for DC functions with application to the optimal size of the firm problem

Abstract : The purpose of this paper is twofold. First, we examine convergence properties of an inexact proximal point method with a quasi distance as a regularization term in order to find a critical point (in the sense of Toland) of a DC function (difference of two convex functions). Global convergence of the sequence and some convergence rates are obtained with additional assumptions. Second, as an application and its inspiration, we study in a dynamic setting, the very important and difficult problem of the limit of the firm and the time it takes to reach it (maturation time), when increasing returns matter in the short run. Both the formalization of the critical size of the firm in term of a recent variational rationality approach of human dynamics and the speed of convergence results are new in Behavioral Sciences.
Document type :
Journal articles
Complete list of metadatas

https://hal-amu.archives-ouvertes.fr/hal-01985336
Contributor : Elisabeth Lhuillier <>
Submitted on : Thursday, January 17, 2019 - 7:49:14 PM
Last modification on : Thursday, February 20, 2020 - 1:03:47 AM

Identifiers

  • HAL Id : hal-01985336, version 1

Collections

Citation

J. Cruz Neto, P. Oliveira, J. Souza, Antoine Soubeyran. A generalized proximal linearized algorithm for DC functions with application to the optimal size of the firm problem. Annals of Operations Research, Springer Verlag, In press. ⟨hal-01985336⟩

Share

Metrics

Record views

81