default search action
Search dblp for Publications
export results for "toc:db/journals/mp/mp185.bht:"
@article{DBLP:journals/mp/BartzBPW21, author = {Sedi Bartz and Heinz H. Bauschke and Hung M. Phan and Xianfu Wang}, title = {Multi-marginal maximal monotonicity and convex analysis}, journal = {Math. Program.}, volume = {185}, number = {1-2}, pages = {385--408}, year = {2021}, url = {https://doi.org/10.1007/s10107-019-01433-9}, doi = {10.1007/S10107-019-01433-9}, timestamp = {Fri, 09 Apr 2021 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/mp/BartzBPW21.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/mp/BasuRS21, author = {Amitabh Basu and Christopher Thomas Ryan and Sriram Sankaranarayanan}, title = {Mixed-integer bilevel representability}, journal = {Math. Program.}, volume = {185}, number = {1-2}, pages = {163--197}, year = {2021}, url = {https://doi.org/10.1007/s10107-019-01424-w}, doi = {10.1007/S10107-019-01424-W}, timestamp = {Sun, 12 Nov 2023 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/mp/BasuRS21.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/mp/CarmonDHS21, author = {Yair Carmon and John C. Duchi and Oliver Hinder and Aaron Sidford}, title = {Lower bounds for finding stationary points {II:} first-order methods}, journal = {Math. Program.}, volume = {185}, number = {1-2}, pages = {315--355}, year = {2021}, url = {https://doi.org/10.1007/s10107-019-01431-x}, doi = {10.1007/S10107-019-01431-X}, timestamp = {Tue, 26 Jan 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/mp/CarmonDHS21.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/mp/ChenD21, author = {Yin Chen and Chuangyin Dang}, title = {A differentiable homotopy method to compute perfect equilibria}, journal = {Math. Program.}, volume = {185}, number = {1-2}, pages = {77--109}, year = {2021}, url = {https://doi.org/10.1007/s10107-019-01422-y}, doi = {10.1007/S10107-019-01422-Y}, timestamp = {Sun, 04 Aug 2024 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/mp/ChenD21.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/mp/ChenLST21, author = {Liang Chen and Xudong Li and Defeng Sun and Kim{-}Chuan Toh}, title = {On the equivalence of inexact proximal {ALM} and {ADMM} for a class of convex composite programming}, journal = {Math. Program.}, volume = {185}, number = {1-2}, pages = {111--161}, year = {2021}, url = {https://doi.org/10.1007/s10107-019-01423-x}, doi = {10.1007/S10107-019-01423-X}, timestamp = {Tue, 26 Jan 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/mp/ChenLST21.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/mp/DrusvyatskiyIL21, author = {Dmitriy Drusvyatskiy and Alexander D. Ioffe and Adrian S. Lewis}, title = {Nonsmooth optimization using Taylor-like models: error bounds, convergence, and termination criteria}, journal = {Math. Program.}, volume = {185}, number = {1-2}, pages = {357--383}, year = {2021}, url = {https://doi.org/10.1007/s10107-019-01432-w}, doi = {10.1007/S10107-019-01432-W}, timestamp = {Tue, 26 Jan 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/mp/DrusvyatskiyIL21.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/mp/GuoC21, author = {Lei Guo and Xiaojun Chen}, title = {Mathematical programs with complementarity constraints and a non-Lipschitz objective: optimality and approximation}, journal = {Math. Program.}, volume = {185}, number = {1-2}, pages = {455--485}, year = {2021}, url = {https://doi.org/10.1007/s10107-019-01435-7}, doi = {10.1007/S10107-019-01435-7}, timestamp = {Wed, 29 Jun 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/mp/GuoC21.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/mp/HaddadanNR21, author = {Arash Haddadan and Alantha Newman and R. Ravi}, title = {Shorter tours and longer detours: uniform covers and a bit beyond}, journal = {Math. Program.}, volume = {185}, number = {1-2}, pages = {245--273}, year = {2021}, url = {https://doi.org/10.1007/s10107-019-01426-8}, doi = {10.1007/S10107-019-01426-8}, timestamp = {Mon, 25 Jan 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/mp/HaddadanNR21.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/mp/LasserreW21, author = {Jean B. Lasserre and Tillmann Wei{\ss}er}, title = {Distributionally robust polynomial chance-constraints under mixture ambiguity sets}, journal = {Math. Program.}, volume = {185}, number = {1-2}, pages = {409--453}, year = {2021}, url = {https://doi.org/10.1007/s10107-019-01434-8}, doi = {10.1007/S10107-019-01434-8}, timestamp = {Tue, 26 Jan 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/mp/LasserreW21.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/mp/LetchfordV21, author = {Adam N. Letchford and Anh N. Vu}, title = {Facets from gadgets}, journal = {Math. Program.}, volume = {185}, number = {1-2}, pages = {297--314}, year = {2021}, url = {https://doi.org/10.1007/s10107-019-01430-y}, doi = {10.1007/S10107-019-01430-Y}, timestamp = {Tue, 26 Jan 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/mp/LetchfordV21.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/mp/OuyangX21, author = {Yuyuan Ouyang and Yangyang Xu}, title = {Lower complexity bounds of first-order methods for convex-concave bilinear saddle-point problems}, journal = {Math. Program.}, volume = {185}, number = {1-2}, pages = {1--35}, year = {2021}, url = {https://doi.org/10.1007/s10107-019-01420-0}, doi = {10.1007/S10107-019-01420-0}, timestamp = {Tue, 26 Jan 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/mp/OuyangX21.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/mp/SunY21, author = {Ruoyu Sun and Yinyu Ye}, title = {Worst-case complexity of cyclic coordinate descent: O(n\({}^{\mbox{2)}}\) gap with randomized version}, journal = {Math. Program.}, volume = {185}, number = {1-2}, pages = {487--520}, year = {2021}, url = {https://doi.org/10.1007/s10107-019-01437-5}, doi = {10.1007/S10107-019-01437-5}, timestamp = {Sun, 18 Dec 2022 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/mp/SunY21.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/mp/Szeszler21, author = {D{\'{a}}vid Szeszl{\'{e}}r}, title = {New polyhedral and algorithmic results on greedoids}, journal = {Math. Program.}, volume = {185}, number = {1-2}, pages = {275--296}, year = {2021}, url = {https://doi.org/10.1007/s10107-019-01427-7}, doi = {10.1007/S10107-019-01427-7}, timestamp = {Fri, 14 May 2021 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/mp/Szeszler21.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/mp/Xu21, author = {Yangyang Xu}, title = {Iteration complexity of inexact augmented Lagrangian methods for constrained convex programming}, journal = {Math. Program.}, volume = {185}, number = {1-2}, pages = {199--244}, year = {2021}, url = {https://doi.org/10.1007/s10107-019-01425-9}, doi = {10.1007/S10107-019-01425-9}, timestamp = {Tue, 26 Jan 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/mp/Xu21.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/mp/YuA21, author = {Jing Yu and Mihai Anitescu}, title = {Multidimensional sum-up rounding for integer programming in optimal experimental design}, journal = {Math. Program.}, volume = {185}, number = {1-2}, pages = {37--76}, year = {2021}, url = {https://doi.org/10.1007/s10107-019-01421-z}, doi = {10.1007/S10107-019-01421-Z}, timestamp = {Tue, 26 Jan 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/mp/YuA21.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
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.