Journal: Optimization Letters

Volume 18, Issue 9

1961 -- 1962Hadi Charkhgard, Jinkyoo Park, Changhyun Kwon. Special issue on advances in computational optimization and their modern applications
1963 -- 1974Nalin Thoummala, Yuncheol Kang, Daiki Min. A deep learning-based approach to a newsvendor problem considering uncertainty and time-varying costs
1975 -- 1991Frank E. Curtis, Suyun Liu, Daniel P. Robinson. Fair machine learning through constrained stochastic optimization and an ε-constraint method
2021 -- 2032Görkem Emirhüseyinoglu, Mohsen Shahhosseini, Guiping Hu, Sarah M. Ryan. Validation of scenario generation for decision-making using machine learning prediction models
2033 -- 2050Abhijit Gosavi, Lesley H. Sneed, L. A. Spearing. Deep reinforcement learning for approximate policy iteration: convergence analysis and a post-earthquake disaster response case study
2051 -- 2078Alvaro Sierra-Altamiranda, Hadi Charkhgard, Iman Dayarian, Ali Eshragh, Sorna Javadi. Learning to project in a criterion space search algorithm: an application to multi-objective binary linear programming
2079 -- 2090Mohit Mahajan, Wen-mei Hwu, Rakesh Nagi. Determining optimal channel partition for 2:4 fine grained structured sparsity
2091 -- 2111A. S. Syed Shahul Hameed, Narendran Rajagopalan. NPROS: A Not So Pure Random Orthogonal search algorithm - A suite of random optimization algorithms driven by reinforcement learning
2113 -- 2131Yuqing Liang, Dongpo Xu, Naimin Zhang, Danilo P. Mandic. Almost sure convergence of stochastic composite objective mirror descent for non-convex non-smooth optimization
2133 -- 2148Xiao Ling, Anh Bui, Paul Brooks. 1-norm principal component analysis for denoising
2149 -- 2167Siham Tassouli, Abdel Lisser. A neurodynamic approach for joint chance constrained rectangular geometric optimization
2169 -- 2188Marc Chalé, Bruce Cox, Jeffery Weir, Nathaniel D. Bastian. Constrained optimization based adversarial example generation for transfer attacks in network intrusion detection systems
2189 -- 2202Allen Holder, Casey Garner. Comparing voting districts with uncertain data envelopment analysis
2203 -- 2219Francesco Biancalani, Giorgio Gnecco, Rodolfo Metulini, Massimo Riccaboni. 2 emissions at the country and sector levels, based on a matrix completion optimization problem
2221 -- 2234Sang Wook Lee, Hyun-jung Kim. Single machine scheduling with maintenance and position-based job eligibility constraints for battery manufacturing

Volume 18, Issue 8

1757 -- 1770Pietro Belotti. Spatial branching for a special class of convex MIQO problems
1771 -- 1789Raul Garcia, Seyedmohammadhossein Hosseinian, Mallesh M. Pai, Andrew J. Schaefer. Strategy investments in zero-sum games
1791 -- 1809Fan Yuan, Dachuan Xu, Donglei Du, Min Li 0028. Differentially private k-center problems
1811 -- 1835Sevilay Demir Saglam. Duality in the problems of optimal control described by Darboux-type differential inclusions
1837 -- 1854Luis Evaristo Caraballo, R. A. Castro, José Miguel Díaz-Báñez, Marco A. Heredia, Jorge Urrutia, Inmaculada Ventura, Francisco Javier Zaragoza Martínez. Constrained many-to-many point matching in two dimensions
1855 -- 1880Ziyi Jiang, Dan Wang, Xinwei Liu. A fast primal-dual algorithm via dynamical system with variable mass for linearly constrained convex optimization
1881 -- 1905Yuwen Zhai, Qilin Wang, Tian Tang, Maoyuan Lv. Optimality conditions for robust weakly efficient solutions in uncertain optimization
1925 -- 1947Manzhan Gu, Weitao Yang, Peihai Liu. Stochastic single-machine scheduling with workload-dependent maintenance activities
1949 -- 1960Ba-Yi Cheng, Jie Duan, Xin-Yan Shi, Mi Zhou. Integrated optimization of design and production process with personalization level of products

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

Volume 18, Issue 6

1313 -- 1333Arnold Neumaier, Morteza Kimiaei. An improvement of the Goldstein line search
1335 -- 1360Prateek Jaiswal, Jeffrey Larson 0001. Multistart algorithm for identifying all optima of nonconvex stochastic functions
1361 -- 1382Shunyu Yao, Neng Fan, Pavlo Krokhmal. Minimizing the influence spread over a network through node interception
1405 -- 1419Chun-Na Li, Jiakou Liu, Yanhui Meng, Yuan-Hai Shao 0001. Recursive universum linear discriminant analysis
1421 -- 1435Suding Liu. Approximation algorithm for solving the 1-line Steiner tree problem with minimum number of Steiner points
1457 -- 1473Shiqiang Zhang, Robert M. Lee, Behrang Shafei, David Walz, Ruth Misener. Dependence in constrained Bayesian optimization
1475 -- 1490Qilin Wang, Jing Jin, Yuwen Zhai. Higher-order optimality conditions of robust Benson proper efficient solutions in uncertain vector optimization problems
1491 -- 1510Michael J. Brusco, Douglas L. Steinley, Ashley L. Watts. A maximal-clique-based set-covering approach to overlapping community detection
1533 -- 1540A. Farajzadeh. On maximal and minimal elements for sets with respect to cones

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

Volume 18, Issue 4

873 -- 887Marco Locatelli 0001. A new approach to the multiple obnoxious facility location problem based on combinatorial and continuous tools
889 -- 907Shubham Kumar, Deepmala, Milan Hladík, Hossein Moosaei. Characterization of unique solvability of absolute value equations: an overview, extensions, and future directions
909 -- 923Jintao Xu, Chenglong Bao, Wenxun Xing. Convergence rates of training deep neural networks via alternating minimization methods
925 -- 941Seulgi Joung. A new sequential lifting of robust cover inequalities
943 -- 964Jong-Kyu Lee, You-Young Cho, Jin-Hee Jin, Gyeong-Mi Cho. *(κ )-linear Complementarity problem
965 -- 976Patrick Mehlitz. A simple proof of second-order sufficient optimality conditions in nonlinear semidefinite optimization
977 -- 989Soumitra Dey, Vellaichamy Vetrivel, Hong-Kun Xu. Well-posedness for the split equilibrium problem
991 -- 1003Mostafa Khatami, Daniel Oron, Amir Salehipour. Scheduling coupled tasks on parallel identical machines
1005 -- 1021Ping-Fan Dai, Shi-Liang Wu. A projected splitting method for vertical tensor complementarity problems
1023 -- 1052Malick M. Ndiaye, Ahmed Osman, Saïd Salhi, Batool Madani. The truck-drone routing optimization problem: mathematical model and a VNS approach
1053 -- 1069Vinícius Carvalho Soares, Marcos Costa Roboredo. On the exact solution of the multi-depot open vehicle routing problem
1071 -- 1093Xu Tian. Award scheme in productivity-based contests

Volume 18, Issue 3

663 -- 680Robert J. Baraldi, Drew P. Kouri. Local convergence analysis of an inexact trust-region method for nonsmooth optimization
681 -- 695Christopher J. Lourenco, Erick Moreno-Centeno. Exact QR factorizations of rectangular matrices
697 -- 703Shuhan Kou, Bruce L. Golden, Luca Bertazzi. An improved model for estimating optimal VRP solution values
705 -- 726Mansoureh Alavi Hejazi, Nooshin Movahedian. On constraint qualifications and optimality conditions for robust optimization problems through pseudo-differential
727 -- 749Aleksandr Beznosikov, Martin Takác 0001. Random-reshuffled SARAH does not need full gradient computations
751 -- 766Matan Atsmony, Gur Mosheiov. Single machine scheduling to minimize maximum earliness/tardiness cost with job rejection
767 -- 781Xianpeng Mao, Yuning Yang. 1-regularized sparse rank-1 approximation to higher-order tensors
783 -- 801Shaotao Hu, Yuanheng Wang, Ping Jing, Qiao-Li Dong. Strong convergence theorem for a new Bregman extragradient method with a different line-search process for solving variational inequality problems in reflexive Banach spaces
803 -- 824Qian Yan, Wang Chen, Xinmin Yang. A novel one-parameter filled function method with an application to pathological analysis
825 -- 846Greta Malaspina, Dusan Jakovetic, Natasa Krejic. Linear convergence rate analysis of a class of exact first-order distributed methods for weight-balanced time-varying networks and uncoordinated step sizes
847 -- 854Anastasia Ivanova, Roland Hildebrand. Optimal step length for the maximal decrease of a self-concordant function by the Newton method
855 -- 872Nikolaos Karagiannis-Axypolitidis, Fabrizio Panebianco, Giuliano Bonanomi, Francesco Giannino. Plants' competition under autotoxicity effect: an evolutionary game

Volume 18, Issue 2

377 -- 401Zeinab Alizadeh, Afrooz Jalilzadeh, Farzad Yousefian. Randomized Lagrangian stochastic approximation for large-scale constrained stochastic Nash games
403 -- 426Bogdan Grechuk, Michael Zabarankin, Alexander Mafusalov, Stan Uryasev. Buffered and Reduced Multidimensional Distribution Functions and Their Application in Optimization
427 -- 445Benjamin Grimmer. On optimal universal first-order methods for minimizing heterogeneous sums
447 -- 470Zhongming Wu, Ye Song, Fan Jiang. Inexact generalized ADMM with relative error criteria for linearly constrained convex optimization problems
471 -- 496Ashish Cherukuri. Sample average approximation of conditional value-at-risk based variational inequalities
497 -- 511Xue-liu Li, Tong-tong Shang, Guo-ji Tang. Lower bounds of the solution set of the polynomial complementarity problem
513 -- 528Lidia Huerga, Enrico Miglierina, Elena Molho, Vicente Novo. On proper minimality in set optimization
529 -- 543Laurentiu Leustean, Pedro Pinto 0003. Rates of asymptotic regularity for the alternating Halpern-Mann iteration
545 -- 559Stevo Rackovic, Cláudia Soares, Dusan Jakovetic, Zoranka Desnica. A majorization-minimization-based method for nonconvex inverse rig problems in facial animation: algorithm derivation
561 -- 574Binbin Zhang, Fuhong Yu. Exact separation theorem for disjoint closed sets in Hilbert spaces
575 -- 589Wei Liang, Zhao Zhang 0002, Ding-Zhu Du. A unified approach to approximate partial, prize-collecting, and budgeted sweep cover problems
591 -- 613Krishnamurthy Dvijotham, Bala Krishnamoorthy, Yunqi Luo, Benjamin Rapone. Robust feasibility of systems of quadratic equations using topological degree theory
615 -- 634Zsolt Darvay, Petra Renáta Rigó. Interior-point algorithm for symmetric cone horizontal linear complementarity problems based on a new class of algebraically equivalent transformations
635 -- 649Matteo Avolio, Antonio Fuduli. The semiproximal SVM approach for multiple instance learning: a kernel-based computational study
651 -- 661Samuel Kroger, Hamidreza Validi, Illya V. Hicks. A polytime preprocess algorithm for the maximum independent set problem

Volume 18, Issue 1

1 -- 17Rafael Cação, Lucas R. C. T. Cortez, Jackson Forner, Hamidreza Validi, Ismael R. de Farias Jr., Illya V. Hicks. The set partitioning problem in a quantum context
19 -- 31Jack Zhang, Hamidreza Validi, Austin Buchanan, Illya V. Hicks. Linear-size formulations for connected planar graph partitioning and political districting
33 -- 55Vera Roshchina, Nadezda Sukhorukova, Julien Ugon. Uniqueness of solutions in multivariate Chebyshev approximation problems
57 -- 71Manlio Gaudioso, Giampaolo Liuzzi, Stefano Lucidi. A clustering heuristic to improve a derivative-free algorithm for nonsmooth optimization
73 -- 103Dmitry V. Gribanov, I. A. Shumilov, Dmitriy S. Malyshev. Structured $(\min ,+)$-convolution and its applications for the shortest/closest vector and nonlinear knapsack problems
105 -- 133Feng Guo, Meijun Zhang. An SDP method for fractional semi-infinite programming problems with SOS-convex polynomials
135 -- 154Quentin Klopfenstein, Quentin Bertrand, Alexandre Gramfort, Joseph Salmon, Samuel Vaiter. Local linear convergence of proximal coordinate descent algorithm
195 -- 213Geovani Nunes Grapiglia. Worst-case evaluation complexity of a derivative-free quadratic regularization method
215 -- 234Yifu Chen, Christos T. Maravelias, Xiaomin Zhang. Tightening discretization-based MILP models for the pooling problem using upper bounds on bilinear terms
235 -- 255Pavel A. Borisovsky. A parallel greedy approach enhanced by genetic algorithm for the stochastic rig routing problem
257 -- 277Kai Kopperschmidt, Ruslanas Stacevicius. Pooling adjacent violators under interval constraints
279 -- 290Shiming Li, Wei Yu 0011, Zhaohui Liu 0001. A local search algorithm for the k-path partition problem
307 -- 318Pengxiang Pan, Hongtao Zhu. Approximation algorithms for the restricted k-Chinese postman problems with penalties
365 -- 375Abdennour Azerine, Mourad Boudhar, Djamal Rebaine. On the complexity of proportionate open shop and job shop problems