1. Numerically tractable optimistic bilevel problems

   • Lorenzo Lampariello
   • Simone Sagratella

   OriginalPaper 15 February 2020 Pages: 277 - 303

   

2. An efficient adaptive accelerated inexact proximal point method for solving linearly constrained nonconvex composite problems

   • Weiwei Kong
   • Jefferson G. Melo
   • Renato D. C. Monteiro

   OriginalPaper 25 April 2020 Pages: 305 - 346

   

3. Accelerating incremental gradient optimization with curvature information

   • Hoi-To Wai
   • Wei Shi
   • Anna Scaglione

   OriginalPaper 07 March 2020 Pages: 347 - 380

   

4. Inexact first-order primal–dual algorithms

   • Julian Rasch
   • Antonin Chambolle

   Manuscript Open access 30 March 2020 Pages: 381 - 430

   

5. Quantitative analysis for a class of two-stage stochastic linear variational inequality problems

   • Jie Jiang
   • Xiaojun Chen
   • Zhiping Chen

   OriginalPaper 21 March 2020 Pages: 431 - 460

   

6. Algorithms for stochastic optimization with function or expectation constraints

   • Guanghui Lan
   • Zhiqiang Zhou

   OriginalPaper 18 February 2020 Pages: 461 - 498

   

7. The Pontryagin maximum principle for solving Fokker–Planck optimal control problems

   • Tim Breitenbach
   • Alfio Borzì

   OriginalPaper Open access 29 April 2020 Pages: 499 - 533

   

8. Feasibility and a fast algorithm for Euclidean distance matrix optimization with ordinal constraints

   • Si-Tong Lu
   • Miao Zhang
   • Qing-Na Li

   OriginalPaper 27 April 2020 Pages: 535 - 569

   

9. A differentiable path-following algorithm for computing perfect stationary points

   • Yang Zhan
   • Peixuan Li
   • Chuangyin Dang

   OriginalPaper 19 February 2020 Pages: 571 - 588

   

10. A computationally useful algebraic representation of nonlinear disjunctive convex sets using the perspective function

    • Kevin C. Furman
    • Nicolas W. Sawaya
    • Ignacio E. Grossmann

    OriginalPaper 12 March 2020 Pages: 589 - 614