Direct search based on probabilistic feasible descent for bound and linearly constrained problems S. GrattonC. W. RoyerZ. Zhang OriginalPaper 22 January 2019 Pages: 525 - 559
Efficient calculation of regular simplex gradients Ian CoopeRachael Tappenden OriginalPaper 30 January 2019 Pages: 561 - 588
An algorithm for binary linear chance-constrained problems using IIS Gianpiero CanessaJulian A. GallegoBernardo K. Pagnoncelli OriginalPaper 02 January 2019 Pages: 589 - 608
Accelerating block coordinate descent methods with identification strategies R. LopesS. A. SantosP. J. S. Silva OriginalPaper 02 January 2019 Pages: 609 - 640
Inexact Successive quadratic approximation for regularized optimization Ching-pei LeeStephen J. Wright OriginalPaper 25 January 2019 Pages: 641 - 674
A framework for parallel second order incremental optimization algorithms for solving partially separable problems Kamer KayaFigen ÖztoprakM. Kaan Öztürk OriginalPaper 02 January 2019 Pages: 675 - 705
A random block-coordinate Douglas–Rachford splitting method with low computational complexity for binary logistic regression Luis M. Briceño-AriasGiovanni ChierchiaJean-Christophe Pesquet OriginalPaper 17 January 2019 Pages: 707 - 726
A constraint-reduced MPC algorithm for convex quadratic programming, with a modified active set identification scheme M. Paul LaiuAndré L. Tits OriginalPaper 09 March 2019 Pages: 727 - 768
Long-step path-following algorithm for solving symmetric programming problems with nonlinear objective functions Leonid FaybusovichCunlu Zhou OriginalPaper 15 December 2018 Pages: 769 - 795
Optimal control in first-order Sobolev spaces with inequality constraints Yu DengPatrick MehlitzUwe Prüfert OriginalPaper 01 January 2019 Pages: 797 - 826
Two-phase semi-Lagrangian relaxation for solving the uncapacitated distribution centers location problem for B2C E-commerce Huizhen ZhangCesar Beltran-RoyoZiying Zhang OriginalPaper 24 January 2019 Pages: 827 - 848
