Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMathematical Programming, Volume 165
Volume 165, Number 1, September 2017
- Preface. 1-3
- Ibrahim Abada, Gauthier de Maere d'Aertrycke, Yves Smeers:
On the multiplicity of solutions in generation capacity investment models with incomplete markets: a risk-averse stochastic equilibrium approach. 5-69 - Xiaojun Chen, Ting Kei Pong
, Roger J.-B. Wets:
Two-stage stochastic variational inequalities: an ERM-solution procedure. 71-111 - Yunmei Chen, Guanghui Lan, Yuyuan Ouyang:
Accelerated schemes for a class of variational inequalities. 113-149 - Michael Lamm, Shu Lu, Amarjit Budhiraja:
Individual confidence intervals for solutions to expected value formulations of stochastic variational inequalities. 151-196 - Gui-Hua Lin, Mei-Ju Luo, Dali Zhang, Jin Zhang:
Stochastic second-order-cone complementarity problems: expected residual minimization formulation and its applications. 197-233 - Jong-Shi Pang, Suvrajeet Sen, Uday V. Shanbhag:
Two-stage non-cooperative games with risk-averse players. 235-290 - Uma Ravat, Uday V. Shanbhag:
On the existence of solutions to stochastic quasi-variational inequality and complementarity problems. 291-330 - R. Tyrrell Rockafellar, Roger J.-B. Wets:
Stochastic variational inequalities: single-stage to multistage. 331-360 - Hailin Sun, Che-Lin Su, Xiaojun Chen:
SAA-regularized methods for multiproduct price optimization under the pure characteristics demand model. 361-389 - Farzad Yousefian, Angelia Nedic, Uday V. Shanbhag:
On smoothing, regularization, and averaging in stochastic approximation methods for stochastic variational inequality problems. 391-431 - Jie Zhang, Huifu Xu, Liwei Zhang:
Quantitative stability analysis of stochastic quasi-variational inequality problems and applications. 433-470
Volume 165, Number 2, October 2017
- Jérôme Bolte, Trong Phong Nguyen, Juan Peypouquet, Bruce W. Suter:
From error bounds to the complexity of first-order descent methods for convex functions. 471-507 - Julia Eaton, Sara Grundel, Mert Gürbüzbalaban, Michael L. Overton:
Polynomial root radius optimization with affine constraints. 509-528 - Sunil Chopra, Bartosz Filipecki, Kangbok Lee, Minseok Ryu, Sangho Shim, Mathieu Van Vyve:
An extended formulation of the convex recoloring problem on a tree. 529-548 - Chen Chen, Alper Atamtürk, Shmuel S. Oren:
A spatial branch-and-cut method for nonconvex QCQP with bounded complex variables. 549-577 - Justo Puerto, Antonio M. Rodríguez-Chía, Arie Tamir:
Revisiting k-sum optimization. 579-604 - Takayuki Iguchi, Dustin G. Mixon, Jesse Peterson, Soledad Villar:
Probably certifiably correct k-means clustering. 605-642 - Gábor Braun, Jonah Brown-Cohen, Arefin Huq, Sebastian Pokutta, Prasad Raghavendra, Aurko Roy, Benjamin Weitz, Daniel Zink:
The matching problem has no small symmetric SDP. 643-662 - Jean-Philippe Labbé, Thibault Manneville, Francisco Santos:
Hirsch polytopes with exponentially long combinatorial segments. 663-688 - Zirui Zhou, Anthony Man-Cho So:
A unified approach to error bounds for structured convex optimization problems. 689-728
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-15 21:38 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:
