Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMathematical Programming, Volume 151
Volume 151, Number 1, June 2015
- Gérard Cornuéjols, Andrew Schaefer
:
Special issue of Mathematical Programming, Series B, dedicated to the international symposium on mathematical programming, Pittsburgh, July 2015. 1-2 - Stephen J. Wright:
Coordinate descent algorithms. 3-34 - Grani Adiwena Hanasusanto, Vladimir Roitch, Daniel Kuhn, Wolfram Wiesemann:
A distributionally robust perspective on uncertainty quantification and chance constrained programming. 35-62 - Mert Pilanci, Martin J. Wainwright, Laurent El Ghaoui:
Sparse learning via Boolean relaxations. 63-87 - Samuel Burer:
A gentle, geometric introduction to copositive optimization. 89-116 - Roberto Cominetti:
Equilibrium routing under uncertainty. 117-151 - Amitabh Basu, Michele Conforti, Marco Di Summa:
A geometric approach to cut-generating functions. 153-189 - Pierre Bonami, Andrea Lodi, Andrea Tramontani, Sven Wiese:
On mathematical programming with indicator constraints. 191-223 - Tamara G. Kolda:
Numerical optimization for symmetric tensor decomposition. 225-248 - Ya-Xiang Yuan:
Recent advances in trust region algorithms. 249-281 - Mert Gürbüzbalaban, Asuman E. Ozdaglar, Pablo A. Parrilo:
A globally convergent incremental Newton method. 283-313 - Hernan Leövey, Werner Römisch:
Quasi-Monte Carlo methods for linear two-stage stochastic programming problems. 315-345 - Pascal Van Hentenryck, Carleton Coffrin:
Transmission system repair and restoration. 347-373
Volume 151, Number 2, July 2015
- Adam N. Letchford, Jean B. Lasserre, Pablo A. Parrilo, David Steurer:
The 2013 Newton Institute Programme on polynomial optimization. 375-377 - Edwin R. van Dam, Renata Sotirov:
Semidefinite programming and eigenvalue bounds for the graph partition problem. 379-404 - Javier Peña, Juan Carlos Vera, Luis Fernando Zuluaga:
Completely positive reformulations for polynomial optimization. 405-431 - Etienne de Klerk, Monique Laurent, Zhao Sun:
An alternative proof of a PTAS for fixed-degree polynomial optimization over the simplex. 433-457 - Immanuel M. Bomze, Michael L. Overton:
Narrowing the difficulty gap for the Celis-Dennis-Tapia problem. 459-476 - Victor Magron, Xavier Allamigeon, Stéphane Gaubert, Benjamin Werner:
Certification of real inequalities: templates and sums of squares. 477-506 - Jean B. Lasserre:
Tractable approximations of sets defined with quantifiers. 507-527 - David de Laat, Frank Vallentin:
A semidefinite programming hierarchy for packing problems in discrete geometry. 529-553 - Jiawang Nie:
The hierarchy of local minimums in polynomial optimization. 555-583 - John Christian Ottem, Kristian Ranestad, Bernd Sturmfels, Cynthia Vinzant:
Quartic spectrahedra. 585-612 - João Gouveia, Pablo A. Parrilo, Rekha R. Thomas:
Approximate cone factorizations and lifts of polytopes. 613-637 - Franklin Djeumou Fomeni, Konstantinos Kaparis, Adam N. Letchford:
Cutting planes for RLT relaxations of mixed 0-1 polynomial programs. 639-658 - Cristian Dobre, Juan Vera:
Exploiting symmetry in copositive programs via semidefinite hierarchies. 659-680
a service of 
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.
last updated on 2024-05-10 19:50 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
