IDEAS home Printed from https://ideas.repec.org/f/pbo498.html
   My authors  Follow this author

Jérôme Bolte

Personal Details

First Name:Jérôme
Middle Name:
Last Name:Bolte
Suffix:
RePEc Short-ID:pbo498

Affiliation

Groupe de Recherche en Économie Mathématique et Quantitative (GREMAQ)
Toulouse School of Economics (TSE)

Toulouse, France
http://www-gremaq.univ-tlse1.fr/

: 05.61.62.85.56
05 61 22 55 63
Manufacture des Tabacs - Bâtiment F, 21 Alléee de Brienne, 31000 TOULOUSE
RePEc:edi:getlsfr (more details at EDIRC)

Research output

as
Jump to: Working papers Articles

Working papers

  1. Blanchet, Adrien & Bolte, Jérôme, 2017. "A family of functional inequalities: lojasiewicz inequalities and displacement convex functions," IAST Working Papers 17-66, Institute for Advanced Study in Toulouse (IAST).
  2. Bobtcheff, Catherine & Bolte, Jérôme & Mariotti, Thomas, 2015. "Researcher's Dilemma," CEPR Discussion Papers 10858, C.E.P.R. Discussion Papers.

Articles

  1. Jérôme Bolte & Edouard Pauwels, 2016. "Majorization-Minimization Procedures and Convergence of SQP Methods for Semi-Algebraic and Tame Programs," Mathematics of Operations Research, INFORMS, vol. 41(2), pages 442-465, May.
  2. Jérôme Bolte & Stéphane Gaubert & Guillaume Vigeral, 2015. "Definable Zero-Sum Stochastic Games," Mathematics of Operations Research, INFORMS, vol. 40(1), pages 171-191, February.
  3. Jérôme Bolte & Aris Daniilidis & Adrian S. Lewis, 2011. "Generic Optimality Conditions for Semialgebraic Convex Programs," Mathematics of Operations Research, INFORMS, vol. 36(1), pages 55-70, February.
  4. Hédy Attouch & Jérôme Bolte & Patrick Redont & Antoine Soubeyran, 2010. "Proximal Alternating Minimization and Projection Methods for Nonconvex Problems: An Approach Based on the Kurdyka-Łojasiewicz Inequality," Mathematics of Operations Research, INFORMS, vol. 35(2), pages 438-457, May.

Citations

Many of the citations below have been collected in an experimental project, CitEc, where a more detailed citation analysis can be found. These are citations from works listed in RePEc that could be analyzed mechanically. So far, only a minority of all works could be analyzed. See under "Corrections" how you can help improve the citation analysis.

Working papers

  1. Bobtcheff, Catherine & Bolte, Jérôme & Mariotti, Thomas, 2015. "Researcher's Dilemma," CEPR Discussion Papers 10858, C.E.P.R. Discussion Papers.

    Cited by:

    1. Damien Besancenot & Radu Vranceanu, 2015. "Fear Of Novelty: A Model Of Scientific Discovery With Strategic Uncertainty," Economic Inquiry, Western Economic Association International, vol. 53(2), pages 1132-1139, April.

Articles

  1. Jérôme Bolte & Edouard Pauwels, 2016. "Majorization-Minimization Procedures and Convergence of SQP Methods for Semi-Algebraic and Tame Programs," Mathematics of Operations Research, INFORMS, vol. 41(2), pages 442-465, May.

    Cited by:

    1. Peter Ochs, 2018. "Local Convergence of the Heavy-Ball Method and iPiano for Non-convex Optimization," Journal of Optimization Theory and Applications, Springer, vol. 177(1), pages 153-180, April.

  2. Jérôme Bolte & Stéphane Gaubert & Guillaume Vigeral, 2015. "Definable Zero-Sum Stochastic Games," Mathematics of Operations Research, INFORMS, vol. 40(1), pages 171-191, February.

    Cited by:

    1. Claudia Meroni & Carlos Pimienta, 2015. "The structure of Nash equilibria in Poisson games," Working Papers 25/2015, University of Verona, Department of Economics.
    2. Arias-R., Omar Fdo., 2014. "A condition for determinacy of optimal strategies in zero-sum convex polynomial games," MPRA Paper 57099, University Library of Munich, Germany.
    3. Laraki, Rida & Renault, Jérôme, 2017. "Acyclic Gambling Games," TSE Working Papers 17-768, Toulouse School of Economics (TSE).
    4. Guillaume Vigeral, 2013. "A Zero-Sum Stochastic Game with Compact Action Sets and no Asymptotic Value," Dynamic Games and Applications, Springer, vol. 3(2), pages 172-186, June.

  3. Jérôme Bolte & Aris Daniilidis & Adrian S. Lewis, 2011. "Generic Optimality Conditions for Semialgebraic Convex Programs," Mathematics of Operations Research, INFORMS, vol. 36(1), pages 55-70, February.

    Cited by:

    1. Madeleine Udell & Stephen Boyd, 2016. "Bounding duality gap for separable problems with linear constraints," Computational Optimization and Applications, Springer, vol. 64(2), pages 355-378, June.
    2. Jae Hyoung Lee & Gue Myung Lee & Tiến-Sơn Phạm, 0. "Genericity and Hölder Stability in Semi-Algebraic Variational Inequalities," Journal of Optimization Theory and Applications, Springer, vol. 0, pages 1-22.
    3. Samuel Vaiter & Charles Deledalle & Jalal Fadili & Gabriel Peyré & Charles Dossal, 2017. "The degrees of freedom of partly smooth regularizers," Annals of the Institute of Statistical Mathematics, Springer;The Institute of Statistical Mathematics, vol. 69(4), pages 791-832, August.
    4. Mirjam Dür & Bolor Jargalsaikhan & Georg Still, 2015. "First order solutions in conic programming," Mathematical Methods of Operations Research, Springer;Gesellschaft für Operations Research (GOR);Nederlands Genootschap voor Besliskunde (NGB), vol. 82(2), pages 123-142, October.
    5. Gue Myung Lee & Tiến-Sơn Phạm, 2016. "Stability and Genericity for Semi-algebraic Compact Programs," Journal of Optimization Theory and Applications, Springer, vol. 169(2), pages 473-495, May.

  4. Hédy Attouch & Jérôme Bolte & Patrick Redont & Antoine Soubeyran, 2010. "Proximal Alternating Minimization and Projection Methods for Nonconvex Problems: An Approach Based on the Kurdyka-Łojasiewicz Inequality," Mathematics of Operations Research, INFORMS, vol. 35(2), pages 438-457, May.

    Cited by:

    1. Alexander Y. Kruger & Nguyen H. Thao, 2015. "Quantitative Characterizations of Regularity Properties of Collections of Sets," Journal of Optimization Theory and Applications, Springer, vol. 164(1), pages 41-67, January.
    2. Glaydston Carvalho Bento & João Xavier Cruz Neto & Antoine Soubeyran & Valdinês Leite Sousa Júnior, 2016. "Dual Descent Methods as Tension Reduction Systems," Journal of Optimization Theory and Applications, Springer, vol. 171(1), pages 209-227, October.
    3. Peter Ochs, 2018. "Local Convergence of the Heavy-Ball Method and iPiano for Non-convex Optimization," Journal of Optimization Theory and Applications, Springer, vol. 177(1), pages 153-180, April.
    4. G. C. Bento & A. Soubeyran, 2015. "Generalized Inexact Proximal Algorithms: Routine’s Formation with Resistance to Change, Following Worthwhile Changes," Journal of Optimization Theory and Applications, Springer, vol. 166(1), pages 172-187, July.
    5. Glaydston Carvalho Bento & João Xavier Cruz Neto & Paulo Roberto Oliveira, 2016. "A New Approach to the Proximal Point Method: Convergence on General Riemannian Manifolds," Journal of Optimization Theory and Applications, Springer, vol. 168(3), pages 743-755, March.
    6. X. Wang & S. Li & X. Kou & Q. Zhang, 2015. "A new alternating direction method for linearly constrained nonconvex optimization problems," Journal of Global Optimization, Springer, vol. 62(4), pages 695-709, August.
    7. Tianxiang Liu & Ting Kei Pong, 2017. "Further properties of the forward–backward envelope with applications to difference-of-convex programming," Computational Optimization and Applications, Springer, vol. 67(3), pages 489-520, July.
    8. J. X. Cruz Neto & P. R. Oliveira & P. A. Soares & A. Soubeyran, 2014. "Proximal Point Method on Finslerian Manifolds and the “Effort–Accuracy” Trade-off," Journal of Optimization Theory and Applications, Springer, vol. 162(3), pages 873-891, September.
    9. Pierre Frankel & Guillaume Garrigos & Juan Peypouquet, 2015. "Splitting Methods with Variable Metric for Kurdyka–Łojasiewicz Functions and General Convergence Rates," Journal of Optimization Theory and Applications, Springer, vol. 165(3), pages 874-900, June.
    10. Guoyin Li & Tianxiang Liu & Ting Kei Pong, 2017. "Peaceman–Rachford splitting for a class of nonconvex optimization problems," Computational Optimization and Applications, Springer, vol. 68(2), pages 407-436, November.
    11. Perraudin, Nathanaël & Holighaus, Nicki & Søndergaard, Peter L. & Balazs, Peter, 2018. "Designing Gabor windows using convex optimization," Applied Mathematics and Computation, Elsevier, vol. 330(C), pages 266-287.
    12. Kely D. V. Villacorta & Paulo R. Oliveira & Antoine Soubeyran, 2014. "A Trust-Region Method for Unconstrained Multiobjective Problems with Applications in Satisficing Processes," Journal of Optimization Theory and Applications, Springer, vol. 160(3), pages 865-889, March.
    13. Emilie Chouzenoux & Jean-Christophe Pesquet & Audrey Repetti, 2016. "A block coordinate variable metric forward–backward algorithm," Journal of Global Optimization, Springer, vol. 66(3), pages 457-485, November.
    14. Cornelio, Anastasia & Porta, Federica & Prato, Marco, 2015. "A convergent least-squares regularized blind deconvolution approach," Applied Mathematics and Computation, Elsevier, vol. 259(C), pages 173-186.
    15. Dominikus Noll, 2014. "Convergence of Non-smooth Descent Methods Using the Kurdyka–Łojasiewicz Inequality," Journal of Optimization Theory and Applications, Springer, vol. 160(2), pages 553-572, February.
    16. D. Russell Luke & Shoham Sabach & Marc Teboulle & Kobi Zatlawey, 2017. "A simple globally convergent algorithm for the nonsmooth nonconvex single source localization problem," Journal of Global Optimization, Springer, vol. 69(4), pages 889-909, December.
    17. Lorenzo Stella & Andreas Themelis & Panagiotis Patrinos, 2017. "Forward–backward quasi-Newton methods for nonsmooth optimization problems," Computational Optimization and Applications, Springer, vol. 67(3), pages 443-487, July.
    18. Radu Ioan Boţ & Ernö Robert Csetnek & Szilárd Csaba László, 2016. "An inertial forward–backward algorithm for the minimization of the sum of two nonconvex functions," EURO Journal on Computational Optimization, Springer;EURO - The Association of European Operational Research Societies, vol. 4(1), pages 3-25, February.
    19. Radu Ioan Boţ & Ernö Robert Csetnek, 2016. "An Inertial Tseng’s Type Proximal Algorithm for Nonsmooth and Nonconvex Optimization Problems," Journal of Optimization Theory and Applications, Springer, vol. 171(2), pages 600-616, November.
    20. Tao Sun & Hao Jiang & Lizhi Cheng, 2017. "Global convergence of proximal iteratively reweighted algorithm," Journal of Global Optimization, Springer, vol. 68(4), pages 815-826, August.
    21. Bo Wen & Xiaojun Chen & Ting Kei Pong, 2018. "A proximal difference-of-convex algorithm with extrapolation," Computational Optimization and Applications, Springer, vol. 69(2), pages 297-324, March.

More information

Research fields, statistics, top rankings, if available.

Statistics

Access and download statistics for all items

Co-authorship network on CollEc

NEP Fields

NEP is an announcement service for new working papers, with a weekly report in each of many fields. This author has had 5 papers announced in NEP. These are the fields, ordered by number of announcements, along with their dates. If the author is listed in the directory of specialists for this field, a link is also provided.
  1. NEP-GTH: Game Theory (3) 2013-03-02 2013-03-09 2015-10-10. Author is listed
  2. NEP-HPE: History & Philosophy of Economics (3) 2013-03-02 2013-03-09 2015-10-10. Author is listed
  3. NEP-SOG: Sociology of Economics (3) 2013-03-02 2013-03-09 2015-10-10. Author is listed
  4. NEP-CTA: Contract Theory & Applications (2) 2013-03-02 2013-03-09. Author is listed
  5. NEP-HRM: Human Capital & Human Resource Management (2) 2013-03-02 2013-03-09. Author is listed
  6. NEP-CWA: Central & Western Asia (1) 2013-03-09
  7. NEP-INO: Innovation (1) 2015-10-10
  8. NEP-MIC: Microeconomics (1) 2015-10-10

Corrections

All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. For general information on how to correct material on RePEc, see these instructions.

To update listings or check citations waiting for approval, Jérôme Bolte should log into the RePEc Author Service.

To make corrections to the bibliographic information of a particular item, find the technical contact on the abstract page of that item. There, details are also given on how to add or correct references and citations.

To link different versions of the same work, where versions have a different title, use this form. Note that if the versions have a very similar title and are in the author's profile, the links will usually be created automatically.

Please note that most corrections can take a couple of weeks to filter through the various RePEc services.

IDEAS is a RePEc service hosted by the Research Division of the Federal Reserve Bank of St. Louis . RePEc uses bibliographic data supplied by the respective publishers.