An interior point-proximal method of multipliers for convex quadratic programming Spyridon PougkakiotisJacek Gondzio OriginalPaper Open access 09 November 2020 Pages: 307 - 351
Using partial spectral information for block diagonal preconditioning of saddle-point systems Alison RamageDaniel RuizCharlotte Tannier OriginalPaper 04 January 2021 Pages: 353 - 375
Globalized inexact proximal Newton-type methods for nonconvex composite functions Christian KanzowTheresa Lechner OriginalPaper Open access 16 November 2020 Pages: 377 - 410
Nonconvex robust programming via value-function optimization Ying CuiZiyu HeJong-Shi Pang OriginalPaper 19 November 2020 Pages: 411 - 450
A bundle method for nonsmooth DC programming with application to chance-constrained problems W. van AckooijS. DemasseyB. Swaminathan OriginalPaper 19 November 2020 Pages: 451 - 490
Finding multi-objective supported efficient spanning trees Pedro CorreiaLuís PaqueteJosé Rui Figueira OriginalPaper Open access 25 January 2021 Pages: 491 - 528
The Gauss–Seidel method for generalized Nash equilibrium problems of polynomials Jiawang NieXindong TangLingling Xu OriginalPaper 12 November 2020 Pages: 529 - 557
Tensor Z-eigenvalue complementarity problems Meilan Zeng OriginalPaper 03 January 2021 Pages: 559 - 573
On mixed-integer optimal control with constrained total variation of the integer control Sebastian SagerClemens Zeile OriginalPaper Open access 07 December 2020 Pages: 575 - 623
Theoretical and numerical comparison of the Karush–Kuhn–Tucker and value function reformulations in bilevel optimization Alain B. ZemkohoShenglong Zhou OriginalPaper 02 January 2021 Pages: 625 - 674