Detecting optimality and extracting solutions in polynomial optimization with the truncated GNS construction María López Quijorna OriginalPaper Open access 19 March 2021 Pages: 559 - 598
An objective penalty function method for biconvex programming Zhiqing MengMin JiangChuangyin Dang OriginalPaper 03 September 2021 Pages: 599 - 620
Exclusion regions for parameter-dependent systems of equations Bettina PonleitnerHermann Schichl OriginalPaper Open access 20 September 2021 Pages: 621 - 644
A modified simplex partition algorithm to test copositivity Mohammadreza SafiSeyed Saeed NabaviRichard J. Caron OriginalPaper Open access 24 September 2021 Pages: 645 - 658
An exact separation algorithm for unsplittable flow capacitated network design arc-set polyhedron Liang ChenWei-Kun ChenYu-Hong Dai OriginalPaper 04 January 2021 Pages: 659 - 689
A dual approach to multi-dimensional assignment problems Jingqun LiThia KirubarajanKrishna R. Pattipati OriginalPaper 18 January 2021 Pages: 691 - 716
Nonconvex and Nonsmooth Sparse Optimization via Adaptively Iterative Reweighted Methods Hao WangFan ZhangYaohua Hu OriginalPaper 05 October 2021 Pages: 717 - 748
Dual-density-based reweighted \(\ell _{1}\)-algorithms for a class of \(\ell _{0}\)-minimization problems Jialiang XuYun-Bin Zhao OriginalPaper Open access 19 April 2021 Pages: 749 - 772
Improved interval methods for solving circle packing problems in the unit square Mihály Csaba Markót OriginalPaper Open access 29 September 2021 Pages: 773 - 803
A branch-cut-and-price algorithm for optimal decoding in digital communication systems Banu KabakulakZ. Caner TaşkınAli Emre Pusane OriginalPaper 14 September 2021 Pages: 805 - 834