1. An inexact Riemannian proximal gradient method

   • Wen Huang
   • Ke Wei

   OriginalPaper 16 January 2023 Pages: 1 - 32

   

2. A limited memory Quasi-Newton approach for multi-objective optimization

   • Matteo Lapucci
   • Pierluigi Mansueto

   OriginalPaper Open access 02 March 2023 Pages: 33 - 73

   

3. A harmonic framework for stepsize selection in gradient methods

   • Giulia Ferrandi
   • Michiel E. Hochstenbach
   • Nataša Krejić

   OriginalPaper Open access 15 February 2023 Pages: 75 - 106

   

4. An efficient implementable inexact entropic proximal point algorithm for a class of linear programming problems

   • Hong T. M. Chu
   • Ling Liang
   • Lei Yang

   OriginalPaper 25 February 2023 Pages: 107 - 146

   

5. A split Levenberg-Marquardt method for large-scale sparse problems

   • Nataša Krejić
   • Greta Malaspina
   • Lense Swaenen

   OriginalPaper Open access 15 February 2023 Pages: 147 - 179

   

6. Integer set reduction for stochastic mixed-integer programming

   • Saravanan Venkatachalam
   • Lewis Ntaimo

   OriginalPaper 09 February 2023 Pages: 181 - 211

   

7. Simple approximative algorithms for free-support Wasserstein barycenters

   • Johannes von Lindheim

   OriginalPaper Open access 01 March 2023 Pages: 213 - 246

   

8. A simultaneous diagonalization based SOCP relaxation for portfolio optimization with an orthogonality constraint

   • Zhijun Xu
   • Jing Zhou

   OriginalPaper 03 February 2023 Pages: 247 - 261

   

9. An alternative extrapolation scheme of PDHGM for saddle point problem with nonlinear function

   • Ying Gao
   • Wenxing Zhang

   OriginalPaper 07 February 2023 Pages: 263 - 291

   

10. A two-time-level model for mission and flight planning of an inhomogeneous fleet of unmanned aerial vehicles

    • Johannes Schmidt
    • Armin Fügenschuh

    OriginalPaper Open access 22 February 2023 Pages: 293 - 335