Journal: Optimization Letters

Volume 17, Issue 1

1 -- 26Temitayo Ajayi, Taewoo Lee, Andrew J. Schaefer. A note on the implications of approximate submodularity in discrete optimization
27 -- 44Pascal Heid. A link between the steepest descent method and fixed-point iterations
45 -- 74Burla E. Ondes, Susan R. Hunter. An upper bound on the Hausdorff distance between a Pareto set and its discretization in bi-objective convex quadratic optimization
75 -- 87Xinyi Zuo, Yi Jiang. Solution methodologies for minimizing a sum of pointwise minima of two functions
89 -- 105Shuhan Kou, Bruce L. Golden, Stefan Poikonen. Optimal TSP tour length estimation using Sammon maps
107 -- 120Olga I. Kostyukova, Tatiana V. Tchemisova. An exact explicit dual for the linear copositive programming problem
121 -- 141Hui Ouyang. Bregman circumcenters: monotonicity and forward weak convergence
143 -- 162Shujun Bi, Zhen Yin, Yihong Weng. A low-rank spectral method for learning Markov models
163 -- 175Debdatta Sinha Roy, Bruce L. Golden, Adriano Masone, Edward A. Wasil. Using regression models to understand the impact of route-length variability in practical vehicle routing
177 -- 190Sholom Schechtman. Stochastic proximal subgradient descent oscillates in the vicinity of its accumulation set
191 -- 210Jing Yang, Xueyu Shi, Oleg A. Prokopyev. Exact solution approaches for a class of bilevel fractional programs
211 -- 218Milan Hladík, Hossein Moosaei. Some notes on the solvability conditions for absolute value equations