Necessary conditions for linear convergence of iterated expansive, set-valued mappings D. Russell LukeMarc TeboulleNguyen H. Thao Full Length Paper 26 October 2018 Pages: 1 - 31
Piecewise affine parameterized value-function based bilevel non-cooperative games Tianyu HaoJong-Shi Pang Full Length Paper 10 November 2018 Pages: 33 - 73
Second-order variational analysis in second-order cone programming Nguyen T. V. HangBoris S. MordukhovichM. Ebrahim Sarabi Full Length Paper 03 November 2018 Pages: 75 - 116
Network strength games: the core and the nucleolus Mourad BaïouFrancisco Barahona Full Length Paper 09 November 2018 Pages: 117 - 136
Convergence rate of inertial Forward–Backward algorithm beyond Nesterov’s rule Vassilis ApidopoulosJean-François AujolCharles Dossal Full Length Paper 12 November 2018 Pages: 137 - 156
A simplex-type algorithm for continuous linear programs with constant coefficients Evgeny ShindinGideon Weiss Full Length Paper 03 December 2018 Pages: 157 - 201
Optimality conditions and global convergence for nonlinear semidefinite programming Roberto AndreaniGabriel HaeserDaiana S. Viana Full Length Paper 07 December 2018 Pages: 203 - 235
Communication-efficient algorithms for decentralized and stochastic optimization Guanghui LanSoomin LeeYi Zhou Full Length Paper 07 December 2018 Pages: 237 - 284
Using regularization and second order information in outer approximation for convex MINLP Jan KronqvistDavid E. BernalIgnacio E. Grossmann Full Length Paper 18 December 2018 Pages: 285 - 310
Balas formulation for the union of polytopes is optimal Michele ConfortiMarco Di SummaYuri Faenza Full Length Paper 19 January 2019 Pages: 311 - 326
Varying confidence levels for CVaR risk measures and minimax limits Edward AndersonHuifu XuDali Zhang Full Length Paper 22 January 2019 Pages: 327 - 370
New analysis of linear convergence of gradient-type methods via unifying error bound conditions Hui Zhang Full Length Paper 04 January 2019 Pages: 371 - 416
Faster subgradient methods for functions with Hölderian growth Patrick R. JohnstonePierre Moulin Full Length Paper 07 January 2019 Pages: 417 - 450
A Newton-CG algorithm with complexity guarantees for smooth unconstrained optimization Clément W. RoyerMichael O’NeillStephen J. Wright Full Length Paper 19 January 2019 Pages: 451 - 488
Chordal decomposition in operator-splitting methods for sparse semidefinite programs Yang ZhengGiovanni FantuzziAndrew Wynn Full Length Paper Open access 20 February 2019 Pages: 489 - 532