Search dblp for Publications

export results for "toc:db/journals/mp/mp178.bht:"

 download as .bib file

@article{DBLP:journals/mp/ArjevaniSS19,
  author       = {Yossi Arjevani and
                  Ohad Shamir and
                  Ron Shiff},
  title        = {Oracle complexity of second-order methods for smooth convex optimization},
  journal      = {Math. Program.},
  volume       = {178},
  number       = {1-2},
  pages        = {327--360},
  year         = {2019},
  url          = {https://doi.org/10.1007/s10107-018-1293-1},
  doi          = {10.1007/S10107-018-1293-1},
  timestamp    = {Thu, 07 Nov 2019 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/mp/ArjevaniSS19.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/mp/BanertB19,
  author       = {Sebastian Banert and
                  Radu Ioan Bot},
  title        = {A general double-proximal gradient algorithm for d.c. programming},
  journal      = {Math. Program.},
  volume       = {178},
  number       = {1-2},
  pages        = {301--326},
  year         = {2019},
  url          = {https://doi.org/10.1007/s10107-018-1292-2},
  doi          = {10.1007/S10107-018-1292-2},
  timestamp    = {Sat, 30 May 2020 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/mp/BanertB19.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/mp/BeckH19,
  author       = {Amir Beck and
                  Nadav Hallak},
  title        = {Optimization problems involving group sparsity terms},
  journal      = {Math. Program.},
  volume       = {178},
  number       = {1-2},
  pages        = {39--67},
  year         = {2019},
  url          = {https://doi.org/10.1007/s10107-018-1277-1},
  doi          = {10.1007/S10107-018-1277-1},
  timestamp    = {Fri, 27 Dec 2019 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/mp/BeckH19.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/mp/BellaviaGP19,
  author       = {Stefania Bellavia and
                  Jacek Gondzio and
                  Margherita Porcelli},
  title        = {An inexact dual logarithmic barrier method for solving sparse semidefinite
                  programs},
  journal      = {Math. Program.},
  volume       = {178},
  number       = {1-2},
  pages        = {109--143},
  year         = {2019},
  url          = {https://doi.org/10.1007/s10107-018-1281-5},
  doi          = {10.1007/S10107-018-1281-5},
  timestamp    = {Mon, 05 Feb 2024 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/mp/BellaviaGP19.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/mp/ConfortiW19,
  author       = {Michele Conforti and
                  Laurence A. Wolsey},
  title        = {"Facet" separation with one linear program},
  journal      = {Math. Program.},
  volume       = {178},
  number       = {1-2},
  pages        = {361--380},
  year         = {2019},
  url          = {https://doi.org/10.1007/s10107-018-1299-8},
  doi          = {10.1007/S10107-018-1299-8},
  timestamp    = {Thu, 07 Nov 2019 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/mp/ConfortiW19.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/mp/CuiST19,
  author       = {Ying Cui and
                  Defeng Sun and
                  Kim{-}Chuan Toh},
  title        = {On the R-superlinear convergence of the {KKT} residuals generated
                  by the augmented Lagrangian method for convex composite conic programming},
  journal      = {Math. Program.},
  volume       = {178},
  number       = {1-2},
  pages        = {381--415},
  year         = {2019},
  url          = {https://doi.org/10.1007/s10107-018-1300-6},
  doi          = {10.1007/S10107-018-1300-6},
  timestamp    = {Fri, 27 Mar 2020 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/mp/CuiST19.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/mp/DrusvyatskiyP19,
  author       = {Dmitriy Drusvyatskiy and
                  Courtney Paquette},
  title        = {Efficiency of minimizing compositions of convex functions and smooth
                  maps},
  journal      = {Math. Program.},
  volume       = {178},
  number       = {1-2},
  pages        = {503--558},
  year         = {2019},
  url          = {https://doi.org/10.1007/s10107-018-1311-3},
  doi          = {10.1007/S10107-018-1311-3},
  timestamp    = {Thu, 07 Nov 2019 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/mp/DrusvyatskiyP19.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/mp/FujishigeSZ19,
  author       = {Satoru Fujishige and
                  Yoshio Sano and
                  Ping Zhan},
  title        = {Submodular optimization views on the random assignment problem},
  journal      = {Math. Program.},
  volume       = {178},
  number       = {1-2},
  pages        = {485--501},
  year         = {2019},
  url          = {https://doi.org/10.1007/s10107-018-1310-4},
  doi          = {10.1007/S10107-018-1310-4},
  timestamp    = {Fri, 27 Dec 2019 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/mp/FujishigeSZ19.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/mp/HaeserLY19,
  author       = {Gabriel Haeser and
                  Hongcheng Liu and
                  Yinyu Ye},
  title        = {Optimality condition and complexity analysis for linearly-constrained
                  optimization without differentiability on the boundary},
  journal      = {Math. Program.},
  volume       = {178},
  number       = {1-2},
  pages        = {263--299},
  year         = {2019},
  url          = {https://doi.org/10.1007/s10107-018-1290-4},
  doi          = {10.1007/S10107-018-1290-4},
  timestamp    = {Sun, 18 Dec 2022 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/mp/HaeserLY19.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/mp/KimTR19,
  author       = {Jinhak Kim and
                  Mohit Tawarmalani and
                  Jean{-}Philippe P. Richard},
  title        = {On cutting planes for cardinality-constrained linear programs},
  journal      = {Math. Program.},
  volume       = {178},
  number       = {1-2},
  pages        = {417--448},
  year         = {2019},
  url          = {https://doi.org/10.1007/s10107-018-1306-0},
  doi          = {10.1007/S10107-018-1306-0},
  timestamp    = {Sun, 02 Oct 2022 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/mp/KimTR19.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/mp/LiuSW19,
  author       = {Huikang Liu and
                  Anthony Man{-}Cho So and
                  Weijie Wu},
  title        = {Quadratic optimization with orthogonality constraint: explicit {\L}ojasiewicz
                  exponent and linear convergence of retraction-based line-search and
                  stochastic variance-reduced gradient methods},
  journal      = {Math. Program.},
  volume       = {178},
  number       = {1-2},
  pages        = {215--262},
  year         = {2019},
  url          = {https://doi.org/10.1007/s10107-018-1285-1},
  doi          = {10.1007/S10107-018-1285-1},
  timestamp    = {Thu, 07 Nov 2019 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/mp/LiuSW19.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/mp/LiuWYLY19,
  author       = {Hongcheng Liu and
                  Xue Wang and
                  Tao Yao and
                  Runze Li and
                  Yinyu Ye},
  title        = {Sample average approximation with sparsity-inducing penalty for high-dimensional
                  stochastic programming},
  journal      = {Math. Program.},
  volume       = {178},
  number       = {1-2},
  pages        = {69--108},
  year         = {2019},
  url          = {https://doi.org/10.1007/s10107-018-1278-0},
  doi          = {10.1007/S10107-018-1278-0},
  timestamp    = {Sun, 18 Dec 2022 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/mp/LiuWYLY19.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/mp/Nie19,
  author       = {Jiawang Nie},
  title        = {Tight relaxations for polynomial optimization and Lagrange multiplier
                  expressions},
  journal      = {Math. Program.},
  volume       = {178},
  number       = {1-2},
  pages        = {1--37},
  year         = {2019},
  url          = {https://doi.org/10.1007/s10107-018-1276-2},
  doi          = {10.1007/S10107-018-1276-2},
  timestamp    = {Tue, 29 Oct 2019 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/mp/Nie19.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/mp/SchmidtSW19,
  author       = {Martin Schmidt and
                  Mathias Sirvent and
                  Winnifried Wollner},
  title        = {A decomposition method for MINLPs with Lipschitz continuous nonlinearities},
  journal      = {Math. Program.},
  volume       = {178},
  number       = {1-2},
  pages        = {449--483},
  year         = {2019},
  url          = {https://doi.org/10.1007/s10107-018-1309-x},
  doi          = {10.1007/S10107-018-1309-X},
  timestamp    = {Fri, 27 Dec 2019 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/mp/SchmidtSW19.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/mp/SunT19,
  author       = {Tianxiao Sun and
                  Quoc Tran{-}Dinh},
  title        = {Generalized self-concordant functions: a recipe for Newton-type methods},
  journal      = {Math. Program.},
  volume       = {178},
  number       = {1-2},
  pages        = {145--213},
  year         = {2019},
  url          = {https://doi.org/10.1007/s10107-018-1282-4},
  doi          = {10.1007/S10107-018-1282-4},
  timestamp    = {Thu, 07 Nov 2019 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/mp/SunT19.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
a service of  Schloss Dagstuhl - Leibniz Center for Informatics

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.