1. Combinatorial optimal control of semilinear elliptic PDEs

   • Christoph Buchheim
   • Renke Kuhlmann
   • Christian Meyer

   OriginalPaper 02 March 2018 Pages: 641 - 675

   

2. Optimal control of a class of reaction–diffusion systems

   • Eduardo Casas
   • Christopher Ryll
   • Fredi Tröltzsch

   OriginalPaper 21 February 2018 Pages: 677 - 707

   

3. Proximal algorithms and temporal difference methods for solving fixed point problems

   • Dimitri P. Bertsekas

   OriginalPaper 02 March 2018 Pages: 709 - 736

   

4. A generalized projection-based scheme for solving convex constrained optimization problems

   • Aviv Gibali
   • Karl-Heinz Küfer
   • Philipp Süss

   OriginalPaper 02 March 2018 Pages: 737 - 762

   

5. Complexity of the relaxed Peaceman–Rachford splitting method for the sum of two maximal strongly monotone operators

   • Renato D. C. Monteiro
   • Chee-Khian Sim

   OriginalPaper Open access 20 March 2018 Pages: 763 - 790

   

6. A class of ADMM-based algorithms for three-block separable convex programming

   • Bingsheng He
   • Xiaoming Yuan

   OriginalPaper 06 March 2018 Pages: 791 - 826

   

7. The generalized proximal point algorithm with step size 2 is not necessarily convergent

   • Min Tao
   • Xiaoming Yuan

   OriginalPaper 03 March 2018 Pages: 827 - 839

8. A convergent relaxation of the Douglas–Rachford algorithm

   • Nguyen Hieu Thao

   OriginalPaper Open access 06 March 2018 Pages: 841 - 863

   

9. On efficient matheuristic algorithms for multi-period stochastic facility location-assignment problems

   • Laureano F. Escudero
   • María Araceli Garín
   • Aitziber Unzueta

   OriginalPaper 08 March 2018 Pages: 865 - 888

10. A multi-criteria approach to approximate solution of multiple-choice knapsack problem

    • Ewa M. Bednarczuk
    • Janusz Miroforidis
    • Przemysław Pyzel

    OriginalPaper Open access 01 March 2018 Pages: 889 - 910