@Article{dao2019union,
  Title                    = {Union averaged operators with applications to proximal algorithms for min-convex functions},
  Author                   = {Dao, Minh N and Tam, Matthew K},
  Journal                  = {Journal of Optimization Theory and Applications},
  Year                     = {2019},

  Arxiv                    = {https://arxiv.org/abs/1807.05810},
  Number                   = {181},
  Pages                    = {61--94},
  Volume                   = {1},

  Abstract                 = {In this paper we introduce and study a class of structured set-valued operators which we call union averaged nonexpansive. At each point in their domain, the value of such an operator can be expressed as a finite union of single-valued averaged nonexpansive operators. We investigate various structural properties of the class and show, in particular, that is closed under taking unions, convex combinations, and compositions, and that their fixed point iterations are locally convergent around strong fixed points. We then systematically apply our results to analyze proximal algorithms in situations where union averaged nonexpansive operators naturally arise. In particular, we consider the problem of minimizing the sum two functions where the first is convex and the second can be expressed as the minimum of finitely many convex functions.},
  Doi                      = {https://doi.org/10.1007/s10957-018-1443-x},
  Timestamp                = {2018.07.17}
}

{"_id":"WkChDiLcpiXAXcodT","bibbaseid":"dao-tam-unionaveragedoperatorswithapplicationstoproximalalgorithmsforminconvexfunctions-2019","authorIDs":["5e348882fae8b9de0100017b","5e348c04fae8b9de010001d5","5e348ea0fae8b9de0100020e","5e348f3753b794de01000016"],"author_short":["Dao, M. N","Tam, M. K"],"bibdata":{"bibtype":"article","type":"article","title":"Union averaged operators with applications to proximal algorithms for min-convex functions","author":[{"propositions":[],"lastnames":["Dao"],"firstnames":["Minh","N"],"suffixes":[]},{"propositions":[],"lastnames":["Tam"],"firstnames":["Matthew","K"],"suffixes":[]}],"journal":"Journal of Optimization Theory and Applications","year":"2019","arxiv":"https://arxiv.org/abs/1807.05810","number":"181","pages":"61–94","volume":"1","abstract":"In this paper we introduce and study a class of structured set-valued operators which we call union averaged nonexpansive. At each point in their domain, the value of such an operator can be expressed as a finite union of single-valued averaged nonexpansive operators. We investigate various structural properties of the class and show, in particular, that is closed under taking unions, convex combinations, and compositions, and that their fixed point iterations are locally convergent around strong fixed points. We then systematically apply our results to analyze proximal algorithms in situations where union averaged nonexpansive operators naturally arise. In particular, we consider the problem of minimizing the sum two functions where the first is convex and the second can be expressed as the minimum of finitely many convex functions.","doi":"https://doi.org/10.1007/s10957-018-1443-x","timestamp":"2018.07.17","bibtex":"@Article{dao2019union,\n Title = {Union averaged operators with applications to proximal algorithms for min-convex functions},\n Author = {Dao, Minh N and Tam, Matthew K},\n Journal = {Journal of Optimization Theory and Applications},\n Year = {2019},\n\n Arxiv = {https://arxiv.org/abs/1807.05810},\n Number = {181},\n Pages = {61--94},\n Volume = {1},\n\n Abstract = {In this paper we introduce and study a class of structured set-valued operators which we call union averaged nonexpansive. At each point in their domain, the value of such an operator can be expressed as a finite union of single-valued averaged nonexpansive operators. We investigate various structural properties of the class and show, in particular, that is closed under taking unions, convex combinations, and compositions, and that their fixed point iterations are locally convergent around strong fixed points. We then systematically apply our results to analyze proximal algorithms in situations where union averaged nonexpansive operators naturally arise. In particular, we consider the problem of minimizing the sum two functions where the first is convex and the second can be expressed as the minimum of finitely many convex functions.},\n Doi = {https://doi.org/10.1007/s10957-018-1443-x},\n Timestamp = {2018.07.17}\n}\n\n","author_short":["Dao, M. N","Tam, M. K"],"key":"dao2019union","id":"dao2019union","bibbaseid":"dao-tam-unionaveragedoperatorswithapplicationstoproximalalgorithmsforminconvexfunctions-2019","role":"author","urls":{},"downloads":0,"html":""},"bibtype":"article","biburl":"https://matthewktam.github.io/bibliography.bib","creationDate":"2020-01-31T20:05:22.511Z","downloads":0,"keywords":[],"search_terms":["union","averaged","operators","applications","proximal","algorithms","min","convex","functions","dao","tam"],"title":"Union averaged operators with applications to proximal algorithms for min-convex functions","year":2019,"dataSources":["ggbLmEcdfFCNZKWDe"]}