Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMathematical Programming, Volume 159
Volume 159, Numbers 1-2, September 2016
- Joseph Cheriyan, Zhihan Gao, Konstantinos Georgiou, Sahil Singla:
On integrality ratios for asymmetric TSP in the Sherali-Adams hierarchy. 1-29 - Mario Leston Rey, Orlando Lee:
Stronger bounds and faster algorithms for packing in generalized kernel systems. 31-80 - Donghwan Kim
, Jeffrey A. Fessler:
Optimized first-order methods for smooth convex minimization. 81-107 - Lijie Bai, John E. Mitchell, Jong-Shi Pang:
On conic QPCCs, conic QCQPs and completely positive programs. 109-136 - Ron Shefi, Marc Teboulle:
A dual method for minimizing a nonsmooth objective over one smooth inequality constraint. 137-164 - Simge Küçükyavuz, Nilay Noyan:
Cut generation for optimization problems with multivariate risk constraints. 165-199 - Guanghui Lan:
Gradient sliding for composite optimization. 201-235 - Steffen Borgwardt, Elisabeth Finhold, Raymond Hemmecke:
Quadratic diameter bounds for dual network flow polyhedra. 237-251 - Antonin Chambolle, Thomas Pock:
On the ergodic convergence rates of a first-order primal-dual algorithm. 253-287 - Weimin Miao, Shaohua Pan, Defeng Sun:
A rank-corrected procedure for matrix completion with fixed basis coefficients. 289-338 - Gabriel A. Carrizo, Pablo A. Lotito, María Cristina Maciel:
Trust region globalization strategy for the nonconvex unconstrained multiobjective optimization problem. 339-369 - Guoyin Li, Ting Kei Pong:
Douglas-Rachford splitting for nonconvex optimization with application to nonconvex feasibility problems. 371-401 - Jingwei Liang, Jalal Fadili, Gabriel Peyré:
Convergence rates with inexact non-expansive operators. 403-434 - Richard H. Byrd, Gillian M. Chin, Jorge Nocedal, Figen Öztoprak:
A family of second-order methods for convex ℓ1-regularized optimization. 435-467 - Anders Forsgren, Philip E. Gill, Elizabeth Wong:
Primal and dual active-set methods for convex quadratic programming. 469-508 - Hideaki Iiduka:
Convergence analysis of iterative methods for nonsmooth convex optimization over fixed point sets of quasi-nonexpansive mappings. 509-538 - Xiaojun Chen, Shuhuang Xiang:
Sparse solutions of linear complementarity problems. 539-556 - Grani Adiwena Hanasusanto, Daniel Kuhn, Wolfram Wiesemann:
A comment on "computational complexity of stochastic programming problems". 557-569 - Sujeevraja Sanjeevi, Sina Masihabadi, Kiavash Kianfar:
Using cuts for mixed integer knapsack sets to generate cuts for mixed integer polyhedral conic sets. 571-583 - Fatma Kilinç-Karzan, Daniel E. Steffy:
On sublinear inequalities for mixed integer conic programs. 585-605
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-08-01 20:20 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:
