Journal: Optimization Letters

Volume 18, Issue 5

1095 -- 1110Queenie Yingkun Huang, Vaithilingam Jeyakumar. A distributional Farkas' lemma and moment optimization problems with no-gap dual semi-definite programs
1111 -- 1130Emilie Chouzenoux, Jean-Baptiste Fest. Convergence analysis of block majorize-minimize subspace approach
1131 -- 1149Lu Yang, Zhouwang Yang. A sequential reduction algorithm for the large-scale fixed-charge network flow problems
1151 -- 1171Xionghui Zheng, Yong Wang, Zheng-Hai Huang. A linearized method for solving tensor complementarity problems with implicit Z-tensors
1173 -- 1200Hongwu Li, Haibin Zhang, Yunhai Xiao, Peili Li. Convergence analysis of generalized ADMM with majorization for linearly constrained composite convex optimization
1201 -- 1215Arezu Zare. Minimizing a complex quadratic fractional optimization problem with two second-order cone constraints
1217 -- 1235Yifu Feng, Xin-Na Geng, Dan-Yang Lv, Ji-Bo Wang. Scheduling jobs with general linear deterioration to minimize total weighted number of late jobs
1237 -- 1252Xianfu Wang, Ziyuan Wang. Every proximal mapping is a resolvent of level proximal subdifferential
1253 -- 1271Zhichun Yang, Fu-quan Xia, Kai Tu. Variance reduced moving balls approximation method for smooth constrained minimization problems
1273 -- 1283Kirill V. Kaymakov, Dmitry S. Malyshev. On efficient algorithms for bottleneck path problems with many sources
1285 -- 1301Maryam Bagherian. Tensor denoising via dual Schatten norms
1303 -- 1311Christian Biefel, Martin Schmidt 0003. On the relation between affinely adjustable robust linear complementarity and mixed-integer linear feasibility problems