![](https://dblp1.uni-trier.de/img/logo.ua.320x120.png)
![](https://dblp1.uni-trier.de/img/dropdown.dark.16x16.png)
![](https://dblp1.uni-trier.de/img/peace.dark.16x16.png)
Остановите войну!
for scientists:
![search dblp search dblp](https://dblp1.uni-trier.de/img/search.dark.16x16.png)
![search dblp](https://dblp1.uni-trier.de/img/search.dark.16x16.png)
default search action
Search dblp for Publications
export results for "toc:db/journals/mp/mp151.bht:"
@article{DBLP:journals/mp/BasuCS15, author = {Amitabh Basu and Michele Conforti and Marco Di Summa}, title = {A geometric approach to cut-generating functions}, journal = {Math. Program.}, volume = {151}, number = {1}, pages = {153--189}, year = {2015}, url = {https://doi.org/10.1007/s10107-015-0890-5}, doi = {10.1007/S10107-015-0890-5}, timestamp = {Sun, 12 Nov 2023 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/mp/BasuCS15.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/mp/BomzeO15, author = {Immanuel M. Bomze and Michael L. Overton}, title = {Narrowing the difficulty gap for the Celis-Dennis-Tapia problem}, journal = {Math. Program.}, volume = {151}, number = {2}, pages = {459--476}, year = {2015}, url = {https://doi.org/10.1007/s10107-014-0836-3}, doi = {10.1007/S10107-014-0836-3}, timestamp = {Sat, 05 Sep 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/mp/BomzeO15.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/mp/BonamiLTW15, author = {Pierre Bonami and Andrea Lodi and Andrea Tramontani and Sven Wiese}, title = {On mathematical programming with indicator constraints}, journal = {Math. Program.}, volume = {151}, number = {1}, pages = {191--223}, year = {2015}, url = {https://doi.org/10.1007/s10107-015-0891-4}, doi = {10.1007/S10107-015-0891-4}, timestamp = {Thu, 08 Jun 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/mp/BonamiLTW15.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/mp/Burer15, author = {Samuel Burer}, title = {A gentle, geometric introduction to copositive optimization}, journal = {Math. Program.}, volume = {151}, number = {1}, pages = {89--116}, year = {2015}, url = {https://doi.org/10.1007/s10107-015-0888-z}, doi = {10.1007/S10107-015-0888-Z}, timestamp = {Sat, 27 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/mp/Burer15.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/mp/Cominetti15, author = {Roberto Cominetti}, title = {Equilibrium routing under uncertainty}, journal = {Math. Program.}, volume = {151}, number = {1}, pages = {117--151}, year = {2015}, url = {https://doi.org/10.1007/s10107-015-0889-y}, doi = {10.1007/S10107-015-0889-Y}, timestamp = {Mon, 26 Jun 2023 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/mp/Cominetti15.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/mp/CornuejolsS15, author = {G{\'{e}}rard Cornu{\'{e}}jols and Andrew Schaefer}, title = {Special issue of Mathematical Programming, Series B, dedicated to the international symposium on mathematical programming, Pittsburgh, July 2015}, journal = {Math. Program.}, volume = {151}, number = {1}, pages = {1--2}, year = {2015}, url = {https://doi.org/10.1007/s10107-015-0904-3}, doi = {10.1007/S10107-015-0904-3}, timestamp = {Sun, 12 Nov 2023 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/mp/CornuejolsS15.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/mp/DamS15, author = {Edwin R. van Dam and Renata Sotirov}, title = {Semidefinite programming and eigenvalue bounds for the graph partition problem}, journal = {Math. Program.}, volume = {151}, number = {2}, pages = {379--404}, year = {2015}, url = {https://doi.org/10.1007/s10107-014-0817-6}, doi = {10.1007/S10107-014-0817-6}, timestamp = {Wed, 07 Dec 2022 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/mp/DamS15.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/mp/DobreV15, author = {Cristian Dobre and Juan Vera}, title = {Exploiting symmetry in copositive programs via semidefinite hierarchies}, journal = {Math. Program.}, volume = {151}, number = {2}, pages = {659--680}, year = {2015}, url = {https://doi.org/10.1007/s10107-015-0879-0}, doi = {10.1007/S10107-015-0879-0}, timestamp = {Sat, 30 Sep 2023 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/mp/DobreV15.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/mp/FomeniKL15, author = {Franklin Djeumou Fomeni and Konstantinos Kaparis and Adam N. Letchford}, title = {Cutting planes for {RLT} relaxations of mixed 0-1 polynomial programs}, journal = {Math. Program.}, volume = {151}, number = {2}, pages = {639--658}, year = {2015}, url = {https://doi.org/10.1007/s10107-015-0863-8}, doi = {10.1007/S10107-015-0863-8}, timestamp = {Wed, 14 Nov 2018 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/mp/FomeniKL15.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/mp/GouveiaPT15, author = {Jo{\~{a}}o Gouveia and Pablo A. Parrilo and Rekha R. Thomas}, title = {Approximate cone factorizations and lifts of polytopes}, journal = {Math. Program.}, volume = {151}, number = {2}, pages = {613--637}, year = {2015}, url = {https://doi.org/10.1007/s10107-014-0848-z}, doi = {10.1007/S10107-014-0848-Z}, timestamp = {Fri, 25 Dec 2020 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/mp/GouveiaPT15.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/mp/GurbuzbalabanOP15, author = {Mert G{\"{u}}rb{\"{u}}zbalaban and Asuman E. Ozdaglar and Pablo A. Parrilo}, title = {A globally convergent incremental Newton method}, journal = {Math. Program.}, volume = {151}, number = {1}, pages = {283--313}, year = {2015}, url = {https://doi.org/10.1007/s10107-015-0897-y}, doi = {10.1007/S10107-015-0897-Y}, timestamp = {Fri, 30 Nov 2018 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/mp/GurbuzbalabanOP15.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/mp/HanasusantoRKW15, author = {Grani Adiwena Hanasusanto and Vladimir Roitch and Daniel Kuhn and Wolfram Wiesemann}, title = {A distributionally robust perspective on uncertainty quantification and chance constrained programming}, journal = {Math. Program.}, volume = {151}, number = {1}, pages = {35--62}, year = {2015}, url = {https://doi.org/10.1007/s10107-015-0896-z}, doi = {10.1007/S10107-015-0896-Z}, timestamp = {Sun, 03 Dec 2023 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/mp/HanasusantoRKW15.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/mp/HentenryckC15, author = {Pascal Van Hentenryck and Carleton Coffrin}, title = {Transmission system repair and restoration}, journal = {Math. Program.}, volume = {151}, number = {1}, pages = {347--373}, year = {2015}, url = {https://doi.org/10.1007/s10107-015-0887-0}, doi = {10.1007/S10107-015-0887-0}, timestamp = {Tue, 16 Aug 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/mp/HentenryckC15.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/mp/KlerkLS15, author = {Etienne de Klerk and Monique Laurent and Zhao Sun}, title = {An alternative proof of a {PTAS} for fixed-degree polynomial optimization over the simplex}, journal = {Math. Program.}, volume = {151}, number = {2}, pages = {433--457}, year = {2015}, url = {https://doi.org/10.1007/s10107-014-0825-6}, doi = {10.1007/S10107-014-0825-6}, timestamp = {Wed, 07 Dec 2022 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/mp/KlerkLS15.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/mp/Kolda15, author = {Tamara G. Kolda}, title = {Numerical optimization for symmetric tensor decomposition}, journal = {Math. Program.}, volume = {151}, number = {1}, pages = {225--248}, year = {2015}, url = {https://doi.org/10.1007/s10107-015-0895-0}, doi = {10.1007/S10107-015-0895-0}, timestamp = {Fri, 30 Nov 2018 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/mp/Kolda15.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/mp/LaatV15, author = {David de Laat and Frank Vallentin}, title = {A semidefinite programming hierarchy for packing problems in discrete geometry}, journal = {Math. Program.}, volume = {151}, number = {2}, pages = {529--553}, year = {2015}, url = {https://doi.org/10.1007/s10107-014-0843-4}, doi = {10.1007/S10107-014-0843-4}, timestamp = {Sat, 27 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/mp/LaatV15.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/mp/Lasserre15, author = {Jean B. Lasserre}, title = {Tractable approximations of sets defined with quantifiers}, journal = {Math. Program.}, volume = {151}, number = {2}, pages = {507--527}, year = {2015}, url = {https://doi.org/10.1007/s10107-014-0838-1}, doi = {10.1007/S10107-014-0838-1}, timestamp = {Fri, 30 Nov 2018 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/mp/Lasserre15.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/mp/LeoveyR15, author = {Hernan Le{\"{o}}vey and Werner R{\"{o}}misch}, title = {Quasi-Monte Carlo methods for linear two-stage stochastic programming problems}, journal = {Math. Program.}, volume = {151}, number = {1}, pages = {315--345}, year = {2015}, url = {https://doi.org/10.1007/s10107-015-0898-x}, doi = {10.1007/S10107-015-0898-X}, timestamp = {Sat, 27 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/mp/LeoveyR15.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/mp/LetchfordLPS15, author = {Adam N. Letchford and Jean B. Lasserre and Pablo A. Parrilo and David Steurer}, title = {The 2013 Newton Institute Programme on polynomial optimization}, journal = {Math. Program.}, volume = {151}, number = {2}, pages = {375--377}, year = {2015}, url = {https://doi.org/10.1007/s10107-015-0886-1}, doi = {10.1007/S10107-015-0886-1}, timestamp = {Fri, 30 Nov 2018 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/mp/LetchfordLPS15.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/mp/MagronAGW15, author = {Victor Magron and Xavier Allamigeon and St{\'{e}}phane Gaubert and Benjamin Werner}, title = {Certification of real inequalities: templates and sums of squares}, journal = {Math. Program.}, volume = {151}, number = {2}, pages = {477--506}, year = {2015}, url = {https://doi.org/10.1007/s10107-014-0834-5}, doi = {10.1007/S10107-014-0834-5}, timestamp = {Sat, 27 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/mp/MagronAGW15.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/mp/Nie15, author = {Jiawang Nie}, title = {The hierarchy of local minimums in polynomial optimization}, journal = {Math. Program.}, volume = {151}, number = {2}, pages = {555--583}, year = {2015}, url = {https://doi.org/10.1007/s10107-014-0845-2}, doi = {10.1007/S10107-014-0845-2}, timestamp = {Sat, 27 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/mp/Nie15.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/mp/OttemRSV15, author = {John Christian Ottem and Kristian Ranestad and Bernd Sturmfels and Cynthia Vinzant}, title = {Quartic spectrahedra}, journal = {Math. Program.}, volume = {151}, number = {2}, pages = {585--612}, year = {2015}, url = {https://doi.org/10.1007/s10107-014-0844-3}, doi = {10.1007/S10107-014-0844-3}, timestamp = {Wed, 14 Nov 2018 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/mp/OttemRSV15.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/mp/PenaVZ15, author = {Javier Pe{\~{n}}a and Juan Carlos Vera and Luis Fernando Zuluaga}, title = {Completely positive reformulations for polynomial optimization}, journal = {Math. Program.}, volume = {151}, number = {2}, pages = {405--431}, year = {2015}, url = {https://doi.org/10.1007/s10107-014-0822-9}, doi = {10.1007/S10107-014-0822-9}, timestamp = {Tue, 29 Jun 2021 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/mp/PenaVZ15.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/mp/PilanciWG15, author = {Mert Pilanci and Martin J. Wainwright and Laurent El Ghaoui}, title = {Sparse learning via Boolean relaxations}, journal = {Math. Program.}, volume = {151}, number = {1}, pages = {63--87}, year = {2015}, url = {https://doi.org/10.1007/s10107-015-0894-1}, doi = {10.1007/S10107-015-0894-1}, timestamp = {Tue, 07 May 2024 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/mp/PilanciWG15.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/mp/Wright15, author = {Stephen J. Wright}, title = {Coordinate descent algorithms}, journal = {Math. Program.}, volume = {151}, number = {1}, pages = {3--34}, year = {2015}, url = {https://doi.org/10.1007/s10107-015-0892-3}, doi = {10.1007/S10107-015-0892-3}, timestamp = {Fri, 24 Mar 2023 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/mp/Wright15.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/mp/Yuan15, author = {Ya{-}Xiang Yuan}, title = {Recent advances in trust region algorithms}, journal = {Math. Program.}, volume = {151}, number = {1}, pages = {249--281}, year = {2015}, url = {https://doi.org/10.1007/s10107-015-0893-2}, doi = {10.1007/S10107-015-0893-2}, timestamp = {Sat, 27 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/mp/Yuan15.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
![](https://dblp1.uni-trier.de/img/cog.dark.24x24.png)
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.