1. An algorithm for the minimization of nonsmooth nonconvex functions using inexact evaluations and its worst-case complexity

   • S. Gratton
   • E. Simon
   • Ph. L. Toint

   Full Length Paper 21 January 2020 Pages: 1 - 24

   

2. A simplex algorithm for rational cp-factorization

   • Mathieu Dutour Sikirić
   • Achill Schürmann
   • Frank Vallentin

   Full Length Paper Open access 28 January 2020 Pages: 25 - 45

   

3. High-order evaluation complexity for convexly-constrained optimization with non-Lipschitzian group sparsity terms

   • X. Chen
   • Ph. L. Toint

   Full Length Paper 28 January 2020 Pages: 47 - 78

   

4. New characterizations of Hoffman constants for systems of linear constraints

   • Javier Peña
   • Juan C. Vera
   • Luis F. Zuluaga

   Full Length Paper 10 February 2020 Pages: 79 - 109

   

5. Outer approximation for integer nonlinear programs via decision diagrams

   • Danial Davarnia
   • Willem-Jan van Hoeve

   Full Length Paper 13 February 2020 Pages: 111 - 150

   

6. Convergence rates of an inertial gradient descent algorithm under growth and flatness conditions

   • Vassilis Apidopoulos
   • Jean-François Aujol
   • Aude Rondepierre

   Full Length Paper 19 February 2020 Pages: 151 - 193

   

7. Facets, weak facets, and extreme functions of the Gomory–Johnson infinite group problem

   • Matthias Köppe
   • Yuan Zhou

   Full Length Paper 28 February 2020 Pages: 195 - 252

   

8. Dual-based methods for solving infinite-horizon nonstationary deterministic dynamic programs

   • Christopher Thomas Ryan
   • Robert L. Smith

   Full Length Paper 17 February 2020 Pages: 253 - 285

   

9. Chebyshev center of the intersection of balls: complexity, relaxation and approximation

   • Yong Xia
   • Meijia Yang
   • Shu Wang

   Full Length Paper 17 February 2020 Pages: 287 - 315

10. Generalized stochastic Frank–Wolfe algorithm with stochastic “substitute” gradient for structured convex optimization

    • Haihao Lu
    • Robert M. Freund

    Full Length Paper 04 March 2020 Pages: 317 - 349

    

11. Convex hull results for generalizations of the constant capacity single node flow set

    • Laurence A. Wolsey
    • Hande Yaman

    Full Length Paper 24 February 2020 Pages: 351 - 382

    

12. Analysis of biased stochastic gradient descent using sequential semidefinite programs

    • Bin Hu
    • Peter Seiler
    • Laurent Lessard

    Full Length Paper 23 March 2020 Pages: 383 - 408

13. Distributed stochastic gradient tracking methods

    • Shi Pu
    • Angelia Nedić

    Full Length Paper 17 March 2020 Pages: 409 - 457

    

14. A sequential homotopy method for mathematical programming problems

    • Andreas Potschka
    • Hans Georg Bock

    Full Length Paper Open access 23 March 2020 Pages: 459 - 486

    

15. Dynamic stochastic approximation for multi-stage stochastic optimization

    • Guanghui Lan
    • Zhiqiang Zhou

    Full Length Paper 20 March 2020 Pages: 487 - 532

    

16. Inexact stochastic mirror descent for two-stage nonlinear stochastic programs

    • Vincent Guigues

    Full Length Paper 02 April 2020 Pages: 533 - 577

    

17. Regional complexity analysis of algorithms for nonconvex smooth optimization

    • Frank E. Curtis
    • Daniel P. Robinson

    Full Length Paper 01 April 2020 Pages: 579 - 615

    

18. Convergent upper bounds in global minimization with nonlinear equality constraints

    • Christian Füllner
    • Peter Kirst
    • Oliver Stein

    Full Length Paper Open access 06 April 2020 Pages: 617 - 651

    

19. Revenue maximization in Stackelberg Pricing Games: beyond the combinatorial setting

    • Toni Böhnlein
    • Stefan Kratsch
    • Oliver Schaudt

    Full Length Paper Open access 18 April 2020 Pages: 653 - 695

    

20. Unit stepsize for the Newton method close to critical solutions

    • A. Fischer
    • A. F. Izmailov
    • M. V. Solodov

    Full Length Paper 07 April 2020 Pages: 697 - 721