Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMathematical Programming, Volume 162
Volume 162, Numbers 1-2, March 2017
- Frank E. Curtis
, Daniel P. Robinson, Mohammadreza Samadi:
A trust region algorithm with a worst-case iteration complexity of O(ϵ -3/2) for nonconvex optimization. 1-32 - Jane J. Ye, Jinchuan Zhou:
Exact formulas for the proximal/regular/limiting normal cone of the second-order cone complementarity set. 33-50 - Shabbir Ahmed, James R. Luedtke, Yongjia Song, Weijun Xie:
Nonanticipative duality, relaxations, and formulations for chance-constrained stochastic programs. 51-81 - Mark Schmidt, Nicolas Le Roux, Francis R. Bach:
Minimizing finite sums with the stochastic average gradient. 83-112 - Mark Schmidt, Nicolas Le Roux, Francis R. Bach:
Erratum to: Minimizing finite sums with the stochastic average gradient. 113 - Martin Anthony, Endre Boros, Yves Crama, Aritanan Gruber:
Quadratic reformulations of nonlinear binary optimization problems. 115-144 - Jiajin Yu, Shabbir Ahmed:
Maximizing a class of submodular utility functions with constraints. 145-164 - Mingyi Hong, Zhi-Quan Luo:
On the linear convergence of the alternating direction method of multipliers. 165-199 - Silvia M. Bianchi, Mariana S. Escalante, Graciela L. Nasini, Levent Tunçel:
Lovász-Schrijver SDP-operator, near-perfect graphs and near-bipartite graphs. 201-223 - Alberto Del Pia, Santanu S. Dey, Marco Molinaro:
Mixed-integer quadratic programming is in NP. 225-240 - Stefanie Jegelka, Jeff A. Bilmes:
Graph cuts with interacting edge weights: examples, approximations, and algorithms. 241-282 - Marcel Kenji de Carli Silva, Levent Tunçel:
An axiomatic duality framework for the theta body and related convex corners. 283-323 - Yuji Nakatsukasa, Tasuku Soma, André Uschmajew:
Finding a low-rank basis in a matrix subspace. 325-361 - Etienne de Klerk, Monique Laurent, Zhao Sun:
Convergence analysis for Lasserre's measure-based hierarchy of upper bounds for polynomial optimization. 363-392 - Samuel Burer, Fatma Kilinç-Karzan:
How to convexify the intersection of a second order cone and a nonconvex quadratic. 393-429 - Jamie Sikora, Antonios Varvitsiotis:
Linear conic formulations for two-party correlations and values of nonlocal games. 431-463 - Sangho Shim, Sunil Chopra, Wenwei Cao:
The worst case analysis of strong knapsack facets. 465-493 - Troy Lee, Zhaohui Wei, Ronald de Wolf:
Some upper and lower bounds on PSD-rank. 495-521 - Natashia Boland, Santanu S. Dey, Thomas Kalinowski, Marco Molinaro, Fabian Rigterink:
Bounding the gap between the McCormick relaxation and the convex hull for bilinear functions. 523-535 - Dmitriy Drusvyatskiy, Guoyin Li, Henry Wolkowicz:
A note on alternating projections for ill-posed semidefinite feasibility problems. 537-548
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-04-24 23:22 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:
