1. Convergence rates of RLT and Lasserre-type hierarchies for the generalized moment problem over the simplex and the sphere

   • Felix Kirschner
   • Etienne de Klerk

   Original Paper Open access 01 February 2022 Pages: 2191 - 2208

2. A note on overrelaxation in the Sinkhorn algorithm

   • Tobias Lehmann
   • Max-K. von Renesse
   • André Uschmajew

   Original Paper Open access 14 December 2021 Pages: 2209 - 2220

   

3. Convex envelopes for ray-concave functions

   • Javiera Barrera
   • Eduardo Moreno
   • Gonzalo Muñoz

   Original Paper 07 February 2022 Pages: 2221 - 2240

   

4. On linear problems with complementarity constraints

   • Giandomenico Mastroeni
   • Letizia Pellegrini
   • Alberto Peretti

   Original Paper 08 January 2022 Pages: 2241 - 2260

5. Nearly tight approximation algorithm for (connected) Roman dominating set

   • Ke Li
   • Yingli Ran
   • Ding-Zhu Du

   Origina Paper 31 March 2022 Pages: 2261 - 2276

   

6. Proximal gradient method for nonconvex and nonsmooth optimization on Hadamard manifolds

   • Shuailing Feng
   • Wen Huang
   • Tieyong Zeng

   Original Paper 06 November 2021 Pages: 2277 - 2297

   

7. Chebyshev center and inscribed balls: properties and calculations

   • Maxim V. Balashov

   Original Paper 06 November 2021 Pages: 2299 - 2312

8. Efficiently solving the thief orienteering problem with a max–min ant colony optimization approach

   • Jonatas B. C. Chagas
   • Markus Wagner

   Original Paper 08 November 2021 Pages: 2313 - 2331

   

9. Variable and constraint reduction techniques for the temporal bin packing problem with fire-ups

   • John Martinovic
   • Nico Strasdat
   • Fabio Furini

   Original Paper Open access 04 December 2021 Pages: 2333 - 2358

   

10. Boundedness of the inverse of a regularized Jacobian matrix in constrained optimization and applications

    • Paul Armand
    • Ngoc Nguyen Tran

    Original Paper 20 November 2021 Pages: 2359 - 2371

11. A primal-dual approximation algorithm for the k-prize-collecting minimum power cover problem

    • Xiaofei Liu
    • Weidong Li
    • Runtao Xie

    Original Paper 20 November 2021 Pages: 2373 - 2385

    

12. A projection-like method for quasimonotone variational inequalities without Lipschitz continuity

    • Xiaoxi Jia
    • Lingling Xu

    Original Paper 30 March 2022 Pages: 2387 - 2403

    

13. A new restricted memory level bundle method for constrained convex nonsmooth optimization

    • Chunming Tang
    • Yanni Li
    • Haiyan Zheng

    Original Paper 04 January 2022 Pages: 2405 - 2434

    

14. The forward–backward splitting method for non-Lipschitz continuous minimization problems in Banach spaces

    • Wei-Bo Guan
    • Wen Song

    Original Paper 08 March 2022 Pages: 2435 - 2456

    

15. Connectedness properties of the efficient sets and the nondominated sets to vector optimization problems

    • Lam Quoc Anh
    • Pham Thanh Duoc
    • Tran Thi Thuy Duong

    Original Paper 22 January 2022 Pages: 2457 - 2468

    

16. Triply stochastic sequential assignment problem with the uncertainty in worker survival

    • Siddhartha Nambiar
    • Alexander Nikolaev
    • Eduardo Pasiliao

    Original Paper 11 November 2021 Pages: 2469 - 2482

17. Spatial price equilibrium networks with flow-dependent arc multipliers

    • Anna Nagurney
    • Deniz Besik

    Original Paper 15 March 2022 Pages: 2483 - 2500

    

18. Duality for convex infinite optimization on linear spaces

    • M. A. Goberna
    • M. Volle

    Short Communication 13 March 2022 Pages: 2501 - 2510

19. Correction to: Duality for convex infinite optimization on linear spaces

    • M. A. Goberna
    • M. Volle

    Correction Open access 30 March 2022 Pages: 2511 - 2511

20. Reinforcement learning of simplex pivot rules: a proof of concept

    • Varun Suriyanarayana
    • Onur Tavaslıoğlu
    • Andrew J. Schaefer

    Short Communication 22 April 2022 Pages: 2513 - 2525