1. “Active-set complexity” of proximal gradient: How long does it take to find the sparsity pattern?

   • Julie Nutini
   • Mark Schmidt
   • Warren Hare

   Original Paper 18 September 2018 Pages: 645 - 655

2. Partial sample average approximation method for chance constrained problems

   • Jianqiang Cheng
   • Céline Gicquel
   • Abdel Lisser

   Original Paper 23 July 2018 Pages: 657 - 672

3. Strengthening the sequential convex MINLP technique by perspective reformulations

   • Claudia D’Ambrosio
   • Antonio Frangioni
   • Claudio Gentile

   Original Paper 23 November 2018 Pages: 673 - 684

   

4. An equivalent tensor equation to the tensor complementarity problem with positive semi-definite Z-tensor

   • Hong-Ru Xu
   • Dong-Hui Li
   • Shui-Lian Xie

   Original Paper 02 May 2018 Pages: 685 - 694

5. Optimal K-node disruption on a node-capacitated network

   • Gokhan Karakose
   • Ronald G. McGarvey

   Original Paper 03 May 2018 Pages: 695 - 715

   

6. A note on the forward-Douglas–Rachford splitting for monotone inclusion and convex optimization

   • Hugo Raguet

   Original Paper 21 May 2018 Pages: 717 - 740

   

7. Sequential parametric convex approximation algorithm for bilinear matrix inequality problem

   • Donghwan Lee
   • Jianghai Hu

   Original Paper 18 May 2018 Pages: 741 - 759

   

8. A filled function which has the same local minimizer of the objective function

   • Hongwei Lin
   • Yuelin Gao
   • Shoubao Su

   Original Paper 22 May 2018 Pages: 761 - 776

9. A proximal point algorithm with asymmetric linear term

   • Xingju Cai

   Original Paper 26 May 2018 Pages: 777 - 793

   

10. Limits of maximal monotone operators driven by their representative functions

    • Yboon García
    • Marc Lassonde

    Original Paper 05 June 2018 Pages: 795 - 803

11. The modified second APG method for DC optimization problems

    • Daoling Lin
    • Chunguang Liu

    Original Paper 11 June 2018 Pages: 805 - 824

12. A branch and cut algorithm for the capacitated star–star telecommunication network problem

    • Hüseyin Güden
    • Ertan Yakıcı

    Original Paper 11 June 2018 Pages: 825 - 836

    

13. Semidefinite approximation bound for a class of nonhomogeneous nonconvex quadratically constrained quadratic programming problem

    • Zi Xu
    • Siqi Tao
    • Kaiyao Lou

    Original Paper 11 June 2018 Pages: 837 - 845

14. Proper initialization is crucial for the Nelder–Mead simplex search

    • Simon Wessing

    Original Paper 25 June 2018 Pages: 847 - 856

    

15. Optimality conditions for \({\varvec{\epsilon }}\)-quasi solutions of optimization problems via \({\varvec{\epsilon }}\)-upper convexificators with applications

    • Adela Capătă

    Original Paper 27 June 2018 Pages: 857 - 873

16. Testing weak optimality of a given solution in interval linear programming revisited: NP-hardness proof, algorithm and some polynomially-solvable cases

    • Miroslav Rada
    • Milan Hladík
    • Elif Garajová

    Original Paper 28 June 2018 Pages: 875 - 890

    

17. On approximate solutions of nondifferentiable vector optimization problems with cone-convex objectives

    • Zhe Hong
    • Guang-Ri Piao
    • Do Sang Kim

    Original Paper 04 July 2018 Pages: 891 - 906

18. An approximation algorithm for multi-agent scheduling on two uniform parallel machines

    • Manzhan Gu
    • Xiwen Lu
    • Jinwei Gu

    Original Paper 25 July 2018 Pages: 907 - 933

    

19. Distributionally robust \(L_1\)-estimation in multiple linear regression

    • Zhaohua Gong
    • Chongyang Liu
    • Kok Lay Teo

    Original Paper 24 July 2018 Pages: 935 - 947

    

20. Improved price of anarchy for machine scheduling games with coordination mechanisms

    • Long Zhang
    • Yuzhong Zhang
    • Qingguo Bai

    Short Communication 16 June 2018 Pages: 949 - 959