default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMathematical Programming, Volume 156
Volume 156, Numbers 1-2, March 2016
- Laurence A. Wolsey, Hande Yaman
:
Continuous knapsack sets with divisible capacities. 1-20 - Bissan Ghaddar, Juan C. Vera, Miguel F. Anjos:
A dynamic inequality generation scheme for polynomial programming. 21-57 - Saeed Ghadimi, Guanghui Lan:
Accelerated gradient methods for nonconvex nonlinear and stochastic programming. 59-99 - Oliver Stein:
Error bounds for mixed integer linear optimization problems. 101-123 - Welington de Oliveira, Mikhail V. Solodov:
A doubly stabilized bundle method for nonsmooth convex optimization. 125-159 - Sunyoung Kim, Masakazu Kojima, Kim-Chuan Toh:
A Lagrangian-DNN relaxation: a fast method for computing tight lower bounds for a class of quadratic optimization problems. 161-187 - Kimon Fountoulakis, Jacek Gondzio:
A second-order method for strongly convex ℓ 1 -regularization problems. 189-219 - Anatoli B. Juditsky, Arkadi Nemirovski:
Solving variational inequalities with monotone operators on domains given by Linear Minimization Oracles. 221-256 - Radek Cibulka, Asen L. Dontchev:
A nonsmooth Robinson's inverse function theorem in Banach spaces. 257-270 - Bart P. G. Van Parys, Paul J. Goulart, Daniel Kuhn:
Generalized Gauss inequalities via semidefinite programming. 271-302 - Manoel B. Campêlo, Alexandre S. Freire, Karla Roberta Lima, Phablo F. S. Moura, Yoshiko Wakabayashi:
The convex recoloring problem: polyhedra, facets and computational experiments. 303-330 - Michele Conforti, Kanstantsin Pashkovich:
The projected faces property and polyhedral relations. 331-342 - Steffen Rebennack:
Combining sampling-based and scenario-based nested Benders decomposition methods: application to stochastic dual dynamic programming. 343-389 - Jun-ya Gotoh, Stan Uryasev:
Two pairs of families of polyhedral norms versus ℓ p -norms: proximity and applications in optimization. 391-431 - Peter Richtárik, Martin Takác:
Parallel coordinate descent methods for big data optimization. 433-484 - Vladimir Yu. Protasov:
Spectral simplex method. 485-511 - Yong Xia, Shu Wang, Ruey-Lin Sheu:
S-lemma with equality and its applications. 513-547 - Sebastian U. Stich, Christian L. Müller, Bernd Gärtner:
Variable metric random pursuit. 549-579 - Ashwin Nayak, Jamie Sikora, Levent Tunçel:
A search for quantum coin-flipping protocols using optimization techniques. 581-613 - Shimrit Shtern, Aharon Ben-Tal:
A semi-definite programming approach for robust tracking. 615-656
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-04-03 00:24 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:
