Journal: Optimization Letters

Volume 19, Issue 9

1717 -- 1735Jan Pablo Burgard, Maria Eduarda Pinheiro, Martin Schmidt 0003. Mixed-integer linear optimization for cardinality-constrained random forests
1737 -- 1758Bahar Çavdar, Joseph Geunes, Xiaofeng Nie, Yue Wang 0095. Policies for multi-trip route planning in time-sensitive environments
1759 -- 1778Nikita Doikov. Lower complexity bounds for minimizing regularized functions
1779 -- 1800Tran Van Thang, Xuan Thanh Le, Do Thi Thuy. A monotonic optimization approach to mixed variational inequality problems
1801 -- 1829Valerian Alin Fodor, Cornel Pintea. The metric projection over a polyhedral set through the relative interiors of its faces
1831 -- 1853Wuyang Yu. Robust model for commercial complex location problem with uncertain customer thresholds
1855 -- 1870Rani Deb, Arup Kumar Das. On sparse solution of tensor complementarity problem
1871 -- 1882Alessandro Agnetis, Gur Mosheiov. A note: on the two-stage flowshop with dedicated machines to minimize total load
1883 -- 1904Alberto De Marchi. Mixed-integer linearity in nonlinear optimization: a trust region approach
1905 -- 1927Madhusudan Das, C. Nahak. Characterization of set-valued robustness via extended signed distances and separation
1929 -- 1952Canh V. Pham, Tan D. Tran, Dung T. K. Ha, Quat V. Phu. Practical algorithm for minimum cost submodular cover problem with performance guarantees
1953 -- 1977Yoshiyuki Sekiguchi, Hiroyuki Ochiai, Hayato Waki. Expansions of the characteristic polynomial of a perturbed PSD matrix and convergence analysis of alternating projections for the PSD cone and a line
1979 -- 1996Roberto Bargetto, Fabio Salassa. Branch-and-bound-and-memorize for the blocking permutation flowshop problem
1997 -- 2010Liqian Qin, Yaxuan Zhang, Qiao-Li Dong, Michael Th. Rassias. Stochastic forward-backward-half forward splitting algorithm with variance reduction
2011 -- 2025Olga I. Kostyukova, Tatiana V. Tchemisova. The singularity degree of a face of the cone of copositive matrices

Volume 19, Issue 8

1521 -- 1537Kevin Shu, Diego Cifuentes, Alejandro Toriello. A semidefinite hierarchy for the expected independence number of a random graph
1539 -- 1556Martin Ryner, Jan Kronqvist, Johan Karlsson. A cutting plane algorithm for globally solving low-dimensional k-means problems
1557 -- 1572Arthur Pratti Dadalto, Fábio Luiz Usberti, Mário César San Felice. Biased random-key genetic algorithms for the minimum subgraph diameter problem
1573 -- 1599Irene Benedetti, Nicoló Biccheri, Tiziana Cardinali. Parametric set valued equilibrium problems under K-convexity type conditions
1601 -- 1624Chenchen Liu, Yakui Huang. Stochastic Polyak stepsize for SGD with variance reduction and momentum
1625 -- 1644Xin Chen, Yan Wang. Optimal control for production inventory of uncertain random system with jump and deteriorating items
1645 -- 1663Hua Zheng, Xiaoping Lu, Seakweng Vong. Nonsmooth Newton methods for vertical linear complementarity problems
1665 -- 1690Kristóf Bérczi, Lydia Mirabel Mendoza Cadena, Kitti Varga. ∞-norm objectives
1691 -- 1698Cédric Josz, Lexiao Lai. Nonsmooth rank-one symmetric matrix factorization landscape
1699 -- 1714Kay Barshad, Yair Censor, Walaa Moursi, Tyler Weames, Henry Wolkowicz. A necessary condition for the guarantee of the superiorization method
1715 -- 1716Kay Barshad, Yair Censor, Walaa Moursi, Tyler Weames, Henry Wolkowicz. Publisher Correction: A necessary condition for the guarantee of the superiorization method

Volume 19, Issue 7

1249 -- 1313Xuxing Chen, Minhui Huang, Shiqian Ma. Decentralized bilevel optimization
1315 -- 1346Akshit Goyal, Jean-Philippe P. Richard. Globally solving a class of bilevel programs with spatial price equilibrium constraints
1347 -- 1373Carlos Corpus, José Fernando Camacho Vallejo. A study on the impact of selecting the follower's reaction in solving semi-vectorial bilevel problems
1375 -- 1397Soumya Ranjan Pathy, Hamed Rahimian. A decomposition algorithm for distributionally robust chance-constrained programs with polyhedral ambiguity set
1399 -- 1420Hanwen Liu, Qi Luo, Yongjia Song. Adaptive opening times for evacuation shelters during disasters
1421 -- 1440Tran Quoc Duy. Hausdorff continuity conditions for parametric nonconvex equilibrium problems
1441 -- 1454Kirill V. Kaymakov, Dmitry S. Malyshev. Efficient online sensitivity analysis for the injective bottleneck path problem
1455 -- 1473Javier F. Rosenblueth. A generalized condition of Clebsch under weak normality assumptions
1475 -- 1490Menglong Xue, Liping Pang. Convergence of a special partially augmented Lagrangian algorithm for sparsity-constrained optimization problems
1491 -- 1519Alexander V. Fominyh. Method for finding solution to "quasidifferentiable" differential inclusion

Volume 19, Issue 6

1053 -- 1074Steffen Borgwardt, Weston Grewe, Jon Lee 0001. On the diameter of a 2-sum of polyhedra
1075 -- 1097Koichi Fujii, Sunyoung Kim, Masakazu Kojima, Hans D. Mittelmann, Yuji Shinano. An exceptionally difficult binary quadratic optimization problem with symmetry: a challenge for the largest unsolved QAP instance Tai256c
1099 -- 1116Ademir A. Ribeiro, Tatiane C. Silva, Gislaine A. Periçaro. A new convergence rate of the steepest descent regarding the Euclidean norm
1117 -- 1123Yaoyao Zhang, Zhao Zhang 0002, Ding-Zhu Du. An approximation algorithm for the prize-collecting connected dominating set problem
1125 -- 1155Julio Huayta-Centeno, Exequiel Mallea-Zepeda, Élder J. Villamizar-Roa. An optimal control problem of a 2D-attraction-repulsion chemotaxis system
1157 -- 1169Tran Van Nghi, Nguyen Nang Tam. A Non-polyhedral extension of the Frank-Wolfe theorem to cubic optimization
1171 -- 1202Suho Kang, Junyoung Kim, Seulgi Joung, Kyungsik Lee. Theoretical analysis of integer programming models for the two-dimensional two-staged knapsack problem
1203 -- 1216Mingjie Gao. Moderate deviations for minimax stochastic programs
1217 -- 1238María Dolores Fajardo, José Vidal-Núñez. Lagrange duality on DC evenly convex optimization problems via a generalized conjugation scheme
1239 -- 1248Didier Henrion. Geometry of exactness of moment-SOS relaxations for polynomial optimization

Volume 19, Issue 5

899 -- 917Ramin Fakhimi, Hamidreza Validi, Illya V. Hicks, Tamás Terlaky, Luis F. Zuluaga. A folding preprocess for the max k-cut problem
919 -- 930Anderson E. Schwertner, F. N. C. Sobral. On complexity constants of linear and quadratic models for derivative-free trust-region algorithms
931 -- 954Truong Minh Tuyen, Nguyen Song Ha. Explicit iterative algorithms for solving the split equality problems in Hilbert spaces
955 -- 968Bin Deng, Weidong Li 0002. The budgeted maximin share allocation problem
969 -- 984Shi-Liang Wu, Mei Long, Cui-Xia Li. A projected fixed point method for a class of vertical tensor complementarity problems
985 -- 1005Honglin Ding. A generalized combination of parallel machine scheduling and path
1007 -- 1016Qin Liu, Bo Hou, Gengsheng Zhang, Wen Liu 0009. An approximation algorithm for the k-prize-collecting hitting set problem
1017 -- 1026Chun-Hua Guo. Comments on finite termination of the generalized Newton method for absolute value equations
1027 -- 1031Zhihan Zhu, Yanhao Zhang, Yong Xia 0002. Convergence rate of projected subgradient method with time-varying step-sizes
1033 -- 1052Alejandro Saavedra-Nieves. An optimization approach to coalition formation in centralized EOQ problems with additive transportation costs

Volume 19, Issue 4

699 -- 716Laura Sprenkels, Zümbül Atan, Ivo Adan. Multi-product Newsvendor problem with dynamic pricing: a decision interpolation approximation
717 -- 745Zexian Liu, Yu-Hong Dai, Hongwei Liu. A limited memory subspace minimization conjugate gradient algorithm for unconstrained optimization
747 -- 770Kexin Ren, Chunguang Liu, Lumiao Wang. The modified second APG method for a class of nonconvex nonsmooth problems
771 -- 791Pedro Henrique Del Bianco Hokama, Carla Negri Lintzmayer, Mário César San Felice. A faster heuristic for the traveling salesman problem with drone
793 -- 809Xiaosong Ding, Jun Ma, Xiuming Li, Xi Chen. Improved randomized approaches to the location of a conservative hyperplane
811 -- 832Gabriela B. Fonseca, Thiago Henrique Nogueira, Martín Gómez Ravetti. Stability approach to CDC truck scheduling problem under uncertainty
833 -- 845Enrique Gerstl, Gur Mosheiov. Minimizing the number of tardy jobs with generalized due-dates and position-dependent processing times
847 -- 872Tiantian Fan, Jingyong Tang. New smooth weighted complementarity functions and a cubically convergent method for wLCP
873 -- 888Ruixue Zhao. Complexity bound of a Levenberg-Marquardt algorithm based on probabilistic Jacobian models
889 -- 897G. Battur, Batbileg Sukhee, Rentsen Enkhbat. A global optimization approach to Berge equilibrium based on a regularized function

Volume 19, Issue 3

437 -- 462Antoine Oustry, Martina Cerulli. Convex semi-infinite programming algorithms with inexact separation oracles
463 -- 504Dimitri J. Papageorgiou, Jan Kronqvist, Asha Ramanujam, James Kor, Youngdae Kim, Can Li. Solution polishing via path relinking for continuous black-box optimization
505 -- 525Aysenur Karagoz, Ruofeng Liu, Hamidreza Validi. Strengthened MIP formulations for the liver region redesign models of Akshat et al
527 -- 549Maziar Salahi, Saeid Ansary Karbasy, Temadher Alassiry Al-Maadeed, Abdelouahed Hamdi. Improved Branch and Bound algorithm and an interpolation-based search algorithm for quadratic minimization with one negative eigenvalue
551 -- 577Shuang Wang, Li-Ping Pang 0001, Jian Lv. Robust satisficing model with Sinkhorn distance
579 -- 604Dongdong Gui, Meilong Le, Xiaodong Luo, Zhouchun Huang. A metaheuristic algorithm for efficient aircraft sequencing and scheduling in terminal maneuvering areas
605 -- 641Ali Babapour Azar, Rashed Khanjani Shiraz, Panos M. Pardalos. Portfolio optimization based on higher order stochastic dominance: limited memory bundle algorithm approach
643 -- 666Van Dung Nguyen. A modification of the forward-backward splitting method for monotone inclusions
667 -- 687Woocheol Choi, Changbum Chun, Yoon Mo Jung, Sangwoon Yun. On the linear convergence rate of Riemannian proximal gradient method
689 -- 697Dorothee Henke, Henri Lefebvre, Martin Schmidt 0003, Johannes Thürauf. On coupling constraints in linear bilevel optimization

Volume 19, Issue 2

233 -- 266Aboozar Mohammadi, Davood Hajinezhad, Alfredo García 0001. A trust-region approach for computing Pareto fronts in multiobjective derivative-free optimization
267 -- 284Torbjørn Cunis. Decomposed quasiconvex optimization with application to generalized cone problems
285 -- 306Yassine Nabou, François Glineur, Ion Necoara. Proximal gradient methods with inexact oracle of degree q for composite optimization
307 -- 328Antonio Orvieto. An accelerated lyapunov function for Polyak's Heavy-ball on convex quadratics
329 -- 345Dániel Gerbner, Balázs Keszegh, Kartal Nagy, Balázs Patkós, Gábor Wiener. Cooperation in combinatorial search
347 -- 365M. Gloria Fiestras-Janeiro, Alejandro Saavedra-Nieves. On the least square prenucleolus for games with externalities
367 -- 387Andrew C. Pangia. Approximating optimal solutions to biconvex parametric programs
389 -- 412Akhtar A. Khan, Dezhou Kong, Jinlu Li. Dual and generalized dual cones in Banach spaces
413 -- 424Arnab Sur. Are weaker stationarity concepts of stochastic MPCC problems significant in absence of SMPCC-LICQ?
425 -- 435Benjamin Grimmer, Zhichao Jia. Goldstein stationarity in Lipschitz constrained optimization

Volume 19, Issue 1

1 -- 20Leandro Farias Maia, David Huckleberry Gutman. The randomized block coordinate descent method in the Hölder smooth setting
21 -- 40Lorenzo Reus. Merton portfolio allocation under stochastic dividends
41 -- 60Xiao-bo Li, Kai Tu, Jian Lu 0002. Convergence analysis of the DFP algorithm for unconstrained optimization problems on Riemannian manifolds
61 -- 84Mengxiao Fan, Jicheng Li. The projected splitting iterative methods based on tensor splitting and its majorization matrix splitting for the tensor complementarity problem
85 -- 102Jun Wang 0065, Qiang Ma. 2 minimization
103 -- 122Christopher John Price, Blair Lennon Robertson, Marco Reale. Extending oscars-ii to generally constrained global optimization
123 -- 138Donatella Granata. On penalized reload cost path, walk, tour and maximum flow: hardness and approximation
139 -- 149Li Zhang, Jing Yuan, Qiaoliang Li. An approximation algorithm for k-level squared metric facility location problem with outliers
151 -- 168Robert D. Barish, Tetsuo Shibuya. Affine optimal k-proper connected edge colorings
169 -- 192Francesco Marchetti, Sabrina Guastavino, Cristina Campi, Federico Benvenuto, Michele Piana. A comprehensive theoretical framework for the optimization of neural networks classification performance with respect to weighted metrics
193 -- 210José Maurício Fernandes Medeiros, Anand Subramanian 0001, Eduardo Queiroga. Population-based iterated local search for batch scheduling on parallel machines with incompatible job families, release dates, and tardiness penalties
211 -- 231Charles Audet, Pierre-Yves Bouchet, Loïc Bourdin. Convergence towards a local minimum by direct search methods with a covering step