Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMathematical Programming, Volume 155
Volume 155, Numbers 1-2, January 2016
- Hiroshi Hirai:
Discrete convexity and polynomial solvability in minimum 0-extension problems. 1-55 - Caihua Chen, Bingsheng He, Yinyu Ye, Xiaoming Yuan:
The direct extension of ADMM for multi-block convex minimization problems is not necessarily convergent. 57-79 - Robert Mansel Gower
, Artur L. Gower:
Higher-order reverse automatic differentiation with emphasis on the third-order. 81-103 - Shai Shalev-Shwartz, Tong Zhang:
Accelerated proximal stochastic dual coordinate ascent for regularized loss minimization. 105-145 - Daniel Porumbel:
Ray projection for optimizing polytopes with prohibitively many constraints in set-covering column generation. 147-197 - Robert M. Freund, Paul Grigas:
New analysis and results for the Frank-Wolfe method. 199-230 - Wenzhuo Yang, Huan Xu:
Distributionally robust chance constraints for non-linear uncertainties. 231-265 - Saeed Ghadimi, Guanghui Lan, Hongchao Zhang:
Mini-batch stochastic approximation methods for nonconvex stochastic composite optimization. 267-305 - Mahdi Dodangeh, Luís Nunes Vicente:
Worst case complexity of direct search under convexity. 307-332 - Xudong Li, Defeng Sun, Kim-Chuan Toh:
A Schur complement based semi-proximal ADMM for convex quadratic conic programming and extensions. 333-373 - Ferenc Domes, Arnold Neumaier:
Constraint aggregation for rigorous global optimization. 375-401 - Alberto Seeger, Mounir Torki:
Conic version of Loewner-John ellipsoid theorem. 403-433 - Caihua Chen, Yong-Jin Liu, Defeng Sun, Kim-Chuan Toh:
A semismooth Newton-CG based dual PPA for matrix spectral norm approximation problems. 435-470 - Sanjeeb Dash, Oktay Günlük, Laurence A. Wolsey:
The continuous knapsack set. 471-496 - Javier Peña, Negar Soheili:
A deterministic rescaled perceptron algorithm. 497-510 - Guanghui Lan, Renato D. C. Monteiro:
Iteration-complexity of first-order augmented Lagrangian methods for convex programming. 511-547 - Deanna Needell, Nathan Srebro, Rachel A. Ward:
Stochastic gradient descent, weighted sampling, and the randomized Kaczmarz algorithm. 549-573 - Sina Modaresi, Mustafa R. Kilinç, Juan Pablo Vielma:
Intersection cuts for nonlinear integer programming: convexification techniques for structured sets. 575-611 - Maicon Marques Alves, Benar Fux Svaiter:
A note on Fejér-monotone sequences in product spaces and its applications to the dual convergence of augmented Lagrangian methods. 613-616 - Alexander Kogan, Miguel A. Lejeune, James R. Luedtke:
Erratum to: Threshold Boolean form for joint probabilistic constraints with random technology matrix. 617-620
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-06-26 21:27 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:
