Journal: Optimization Letters

Volume 18, Issue 7

1541 -- 1559Matthew K. Tam. Frugal and decentralised resolvent splittings defined by nonexpansive operators
1561 -- 1578Michael Zabarankin, Bogdan Grechuk, Dawei Hao. Benchmark-based deviation and drawdown measures in portfolio optimization
1579 -- 1591Jani Jokela. Mixed lattice structures and cone projections
1593 -- 1618Ren-Xia Chen, Shi-sheng Li. Two-machine job shop scheduling with optional job rejection
1619 -- 1645Thuy Nguyen Thi Thu, Tran Thanh Tung. A self adaptive inertial algorithm for solving variational inequalities over the solution set of the split variational inequality problem
1647 -- 1671Mounir El Maghri, Youssef Elboulqe. A reduced Jacobian method with full convergence property
1673 -- 1688Han Wang, Yunhai Xiao. Linear convergence rate analysis of proximal generalized ADMM for convex composite programming
1689 -- 1710Maxim V. Dolgopolik. Subdifferentials of convex matrix-valued functions
1711 -- 1726Sonali Sharma, K. Palpandi. A criterion for Q-tensors
1727 -- 1746Thu Trang Thi Du, Toan Minh Ho, Phi-Dung Hoang. Representation of positive polynomials on a generalized strip and its application to polynomial optimization
1747 -- 1754Bo Hou, Hongye Zheng, Wen Liu 0009, Weili Wu, Ding-Zhu Du, Suogang Gao. Improved approximation algorithm for the parallel-machine customer order scheduling with delivery time and submodular rejection penalties
1755 -- 0Prateek Jaiswal, Jeffrey Larson 0001. Correction: Multistart algorithm for identifying all optima of nonconvex stochastic functions