default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMathematical Programming, Volume 152
Volume 152, Numbers 1-2, August 2015
- Grani Adiwena Hanasusanto, Daniel Kuhn, Stein W. Wallace, Steve Zymler:
Distributionally robust multi-item newsvendor problems with multimodal demand distributions. 1-32 - Alexey F. Izmailov
, Evgeniy I. Uskov:
Attraction of Newton method to critical Lagrange multipliers: fully quadratic case. 33-73 - Zaïd Harchaoui, Anatoli B. Juditsky, Arkadi Nemirovski:
Conditional gradient algorithms for norm-regularized smooth convex optimization. 75-112 - Jacek Gondzio, Pablo González-Brevis:
A new warmstarting strategy for the primal-dual column generation method. 113-146 - Anupam Gupta, Jochen Könemann, Stefano Leonardi, R. Ravi, Guido Schäfer:
Efficient cost-sharing mechanisms for prize-collecting problems. 147-188 - Ashwin Arulselvan:
On the geometric rank of matching polytope. 189-200 - Frank E. Curtis, Hao Jiang, Daniel P. Robinson:
An adaptive augmented Lagrangian method for large-scale constrained optimization. 201-245 - Alberto Marchetti-Spaccamela, Cyriel Rutten, Suzanne van der Ster, Andreas Wiese:
Assigning sporadic tasks to unrelated machines. 247-274 - Václav Kozmík, David P. Morton:
Evaluating policies in risk-averse multi-stage stochastic programming. 275-300 - Angelos Georghiou, Wolfram Wiesemann, Daniel Kuhn:
Generalized decision rule approximations for stochastic programming via liftings. 301-338 - Yair Censor, Daniel Reem:
Zero-convex functions, perturbation resilience, and subgradient projections for feasibility-seeking methods. 339-380 - Yurii E. Nesterov:
Universal gradient methods for convex optimization problems. 381-404 - Nikolaos Chatzipanagiotis, Darinka Dentcheva, Michael M. Zavlanos:
An augmented Lagrangian method for distributed optimization. 405-434 - Takanori Maehara, Kazuo Murota:
A framework of discrete DC programming by discrete convex analysis. 435-466 - Youssef Diouane, Serge Gratton, Luís Nunes Vicente:
Globally convergent evolution strategies. 467-490 - Geovani Nunes Grapiglia, Jin Yun Yuan, Ya-Xiang Yuan:
On the convergence and worst-case complexity of trust-region and regularization methods for unconstrained optimization. 491-520 - Dmitriy Drusvyatskiy, Stephen A. Vavasis, Henry Wolkowicz:
Extreme point inequalities and geometry of the rank sparsity ball. 521-544 - Ehud Lehrer, Roee Teper:
Sandwich games. 545-557 - Jean B. Lasserre:
A generalization of Löwner-John's ellipsoid theorem. 559-591 - Jiming Peng, Tao Zhu:
A nonlinear semidefinite optimization relaxation for the worst-case linear optimization under uncertainties. 593-614 - Zhaosong Lu, Lin Xiao:
On the complexity analysis of randomized block-coordinate descent methods. 615-642 - Gérard Cornuéjols, Laurence A. Wolsey, Sercan Yildiz:
Sufficiency of cut-generating functions. 643-651
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 2025-12-12 22:54 CET 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:
