A generalized proximal linearized algorithm for DC functions with application to the optimal size of the firm problem - Aix-Marseille Université Access content directly
Journal Articles Annals of Operations Research Year : 2020

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.
Fichier principal
Vignette du fichier
Joao Carlos Opt size of the firm.pdf (353.91 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

hal-01985336 , version 1 (19-02-2021)

Identifiers

Cite

J. Cruz Neto, P. Oliveira, Antoine Soubeyran, J. Souza. A generalized proximal linearized algorithm for DC functions with application to the optimal size of the firm problem. Annals of Operations Research, 2020, 289 (2), pp.313-339. ⟨10.1007/s10479-018-3104-8⟩. ⟨hal-01985336⟩
95 View
139 Download

Altmetric

Share

Gmail Facebook Twitter LinkedIn More