default search action
Optimization Letters, Volume 18
Volume 18, Number 1, January 2024
- Rafael 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. 1-17 - Jack Zhang, Hamidreza Validi, Austin Buchanan
Linear-size formulations for connected planar graph partitioning and political districting. 19-31 - Vera Roshchina, Nadezda Sukhorukova
Uniqueness of solutions in multivariate Chebyshev approximation problems. 33-55 - Manlio Gaudioso, Giampaolo Liuzzi
A clustering heuristic to improve a derivative-free algorithm for nonsmooth optimization. 57-71 - Dmitry V. Gribanov
Structured $(\min ,+)$-convolution and its applications for the shortest/closest vector and nonlinear knapsack problems. 73-103 - Feng Guo
An SDP method for fractional semi-infinite programming problems with SOS-convex polynomials. 105-133 - Quentin Klopfenstein
Local linear convergence of proximal coordinate descent algorithm. 135-154 - Feng Xue:
The operator splitting schemes revisited: primal-dual gap and degeneracy reduction by a unified analysis. 155-194 - Geovani Nunes Grapiglia
Worst-case evaluation complexity of a derivative-free quadratic regularization method. 195-213 - Yifu Chen
Tightening discretization-based MILP models for the pooling problem using upper bounds on bilinear terms. 215-234 - Pavel A. Borisovsky
A parallel greedy approach enhanced by genetic algorithm for the stochastic rig routing problem. 235-255 - Kai Kopperschmidt
Pooling adjacent violators under interval constraints. 257-277 - Shiming Li, Wei Yu
A local search algorithm for the k-path partition problem. 279-290 - Shaohua Xie, Jia Li:
k-sparse vector recovery via Truncated ℓ 1-ℓ 2 local minimization. 291-305 - Pengxiang Pan
Approximation algorithms for the restricted k-Chinese postman problems with penalties. 307-318 - Ran Ma, Juannian Xu, Yuzhong Zhang:
A best possible online algorithm for minimizing the total completion time and the total soft penalty cost. 319-338 - Mengxue Xia, Haohao Li, Daojun Xu:
Checking weak and strong optimality of the solution to interval convex quadratic programming in a general form. 339-364 - Abdennour Azerine
On the complexity of proportionate open shop and job shop problems. 365-375
Volume 18, Number 2, March 2024
- Zeinab Alizadeh, Afrooz Jalilzadeh
Randomized Lagrangian stochastic approximation for large-scale constrained stochastic Nash games. 377-401 - Bogdan Grechuk
Buffered and Reduced Multidimensional Distribution Functions and Their Application in Optimization. 403-426 - Benjamin Grimmer
On optimal universal first-order methods for minimizing heterogeneous sums. 427-445 - Zhongming Wu, Ye Song, Fan Jiang:
Inexact generalized ADMM with relative error criteria for linearly constrained convex optimization problems. 447-470 - Ashish Cherukuri
Sample average approximation of conditional value-at-risk based variational inequalities. 471-496 - Xue-liu Li, Tong-tong Shang, Guo-ji Tang
Lower bounds of the solution set of the polynomial complementarity problem. 497-511 - Lidia Huerga
On proper minimality in set optimization. 513-528 - Laurentiu Leustean
Rates of asymptotic regularity for the alternating Halpern-Mann iteration. 529-543 - Stevo Rackovic
A majorization-minimization-based method for nonconvex inverse rig problems in facial animation: algorithm derivation. 545-559 - Binbin Zhang, Fuhong Yu:
Exact separation theorem for disjoint closed sets in Hilbert spaces. 561-574 - Wei Liang, Zhao Zhang, Ding-Zhu Du:
A unified approach to approximate partial, prize-collecting, and budgeted sweep cover problems. 575-589 - Krishnamurthy Dvijotham, Bala Krishnamoorthy
Robust feasibility of systems of quadratic equations using topological degree theory. 591-613 - Zsolt Darvay
Interior-point algorithm for symmetric cone horizontal linear complementarity problems based on a new class of algebraically equivalent transformations. 615-634 - Matteo Avolio
The semiproximal SVM approach for multiple instance learning: a kernel-based computational study. 635-649 - Samuel Kroger, Hamidreza Validi, Illya V. Hicks:
A polytime preprocess algorithm for the maximum independent set problem. 651-661
Volume 18, Number 3, April 2024
- Robert J. Baraldi
Local convergence analysis of an inexact trust-region method for nonsmooth optimization. 663-680 - Christopher J. Lourenco
Exact QR factorizations of rectangular matrices. 681-695 - Shuhan Kou
An improved model for estimating optimal VRP solution values. 697-703 - Mansoureh Alavi Hejazi, Nooshin Movahedian
On constraint qualifications and optimality conditions for robust optimization problems through pseudo-differential. 705-726 - Aleksandr Beznosikov
Random-reshuffled SARAH does not need full gradient computations. 727-749 - Matan Atsmony, Gur Mosheiov
Single machine scheduling to minimize maximum earliness/tardiness cost with job rejection. 751-766 - Xianpeng Mao
Practical approximation algorithms for ℓ1-regularized sparse rank-1 approximation to higher-order tensors. 767-781 - Shaotao Hu
Strong convergence theorem for a new Bregman extragradient method with a different line-search process for solving variational inequality problems in reflexive Banach spaces. 783-801 - Qian Yan, Wang Chen, Xinmin Yang
A novel one-parameter filled function method with an application to pathological analysis. 803-824 - Greta Malaspina
Linear convergence rate analysis of a class of exact first-order distributed methods for weight-balanced time-varying networks and uncoordinated step sizes. 825-846 - Anastasia Ivanova, Roland Hildebrand:
Optimal step length for the maximal decrease of a self-concordant function by the Newton method. 847-854 - Nikolaos Karagiannis-Axypolitidis
Plants' competition under autotoxicity effect: an evolutionary game. 855-872
Volume 18, Number 4, May 2024
- Marco Locatelli
A new approach to the multiple obnoxious facility location problem based on combinatorial and continuous tools. 873-887 - Shubham Kumar, Deepmala, Milan Hladík
Characterization of unique solvability of absolute value equations: an overview, extensions, and future directions. 889-907 - Jintao Xu
Convergence rates of training deep neural networks via alternating minimization methods. 909-923 - Seulgi Joung
A new sequential lifting of robust cover inequalities. 925-941 - Jong-Kyu Lee, You-Young Cho, Jin-Hee Jin, Gyeong-Mi Cho
A New full-newton step infeasible interior-point method for P*(κ )-linear Complementarity problem. 943-964 - Patrick Mehlitz
A simple proof of second-order sufficient optimality conditions in nonlinear semidefinite optimization. 965-976 - Soumitra Dey
Well-posedness for the split equilibrium problem. 977-989 - Mostafa Khatami
Scheduling coupled tasks on parallel identical machines. 991-1003 - Ping-Fan Dai, Shi-Liang Wu:
A projected splitting method for vertical tensor complementarity problems. 1005-1021 - Malick M. Ndiaye
The truck-drone routing optimization problem: mathematical model and a VNS approach. 1023-1052 - Vinícius Carvalho Soares, Marcos Costa Roboredo:
On the exact solution of the multi-depot open vehicle routing problem. 1053-1069 - Xu Tian
Award scheme in productivity-based contests. 1071-1093
Volume 18, Number 5, June 2024
- Queenie Yingkun Huang
A distributional Farkas' lemma and moment optimization problems with no-gap dual semi-definite programs. 1095-1110 - Emilie Chouzenoux
Convergence analysis of block majorize-minimize subspace approach. 1111-1130 - Lu Yang, Zhouwang Yang:
A sequential reduction algorithm for the large-scale fixed-charge network flow problems. 1131-1149 - Xionghui Zheng, Yong Wang, Zheng-Hai Huang:
A linearized method for solving tensor complementarity problems with implicit Z-tensors. 1151-1171 - Hongwu Li, Haibin Zhang, Yunhai Xiao
Convergence analysis of generalized ADMM with majorization for linearly constrained composite convex optimization. 1173-1200 - Arezu Zare:
Minimizing a complex quadratic fractional optimization problem with two second-order cone constraints. 1201-1215 - Yifu Feng, Xin-Na Geng, Dan-Yang Lv, Ji-Bo Wang:
Scheduling jobs with general linear deterioration to minimize total weighted number of late jobs. 1217-1235 - Xianfu Wang, Ziyuan Wang
Every proximal mapping is a resolvent of level proximal subdifferential. 1237-1252 - Zhichun Yang
Variance reduced moving balls approximation method for smooth constrained minimization problems. 1253-1271 - Kirill V. Kaymakov
On efficient algorithms for bottleneck path problems with many sources. 1273-1283 - Maryam Bagherian
Tensor denoising via dual Schatten norms. 1285-1301 - Christian Biefel
On the relation between affinely adjustable robust linear complementarity and mixed-integer linear feasibility problems. 1303-1311
Volume 18, Number 6, July 2024
- Arnold Neumaier, Morteza Kimiaei
An improvement of the Goldstein line search. 1313-1333 - Prateek Jaiswal
Multistart algorithm for identifying all optima of nonconvex stochastic functions. 1335-1360 - Shunyu Yao
Minimizing the influence spread over a network through node interception. 1361-1382 - Ankur Sinha, Tanmay Khandait, Raja Mohanty:
A gradient-based bilevel optimization approach for tuning regularization hyperparameters. 1383-1404 - Chun-Na Li, Jiakou Liu, Yanhui Meng, Yuan-Hai Shao
Recursive universum linear discriminant analysis. 1405-1419 - Suding Liu
Approximation algorithm for solving the 1-line Steiner tree problem with minimum number of Steiner points. 1421-1435 - Limei Feng, Yongle Zhang, Yiran He:
A new feasible moving ball projection algorithm for pseudomonotone variational inequalities. 1437-1455 - Shiqiang Zhang
Dependence in constrained Bayesian optimization. 1457-1473 - Qilin Wang
Higher-order optimality conditions of robust Benson proper efficient solutions in uncertain vector optimization problems. 1475-1490 - Michael J. Brusco
A maximal-clique-based set-covering approach to overlapping community detection. 1491-1510 - Konstantinos Papalamprou, Leonidas S. Pitsoulis, Balázs Kotnyek:
A mathematical programming approach for recognizing binet matrices. 1511-1532 - Ali P. Farajzadeh
On maximal and minimal elements for sets with respect to cones. 1533-1540
Volume 18, Number 7, September 2024
- Matthew K. Tam
Frugal and decentralised resolvent splittings defined by nonexpansive operators. 1541-1559 - Michael Zabarankin, Bogdan Grechuk
Benchmark-based deviation and drawdown measures in portfolio optimization. 1561-1578 - Jani Jokela
Mixed lattice structures and cone projections. 1579-1591 - Ren-Xia Chen
Two-machine job shop scheduling with optional job rejection. 1593-1618 - Thuy Nguyen Thi Thu
A self adaptive inertial algorithm for solving variational inequalities over the solution set of the split variational inequality problem. 1619-1645 - Mounir El Maghri
A reduced Jacobian method with full convergence property. 1647-1671 - Han Wang, Yunhai Xiao
Linear convergence rate analysis of proximal generalized ADMM for convex composite programming. 1673-1688 - Maxim V. Dolgopolik
Subdifferentials of convex matrix-valued functions. 1689-1710 - Sonali Sharma, K. Palpandi:
A criterion for Q-tensors. 1711-1726 - Thu Trang Thi Du, Toan Minh Ho, Phi-Dung Hoang:
Representation of positive polynomials on a generalized strip and its application to polynomial optimization. 1727-1746 - Bo Hou, Hongye Zheng, Wen Liu, Weili Wu, Ding-Zhu Du, Suogang Gao:
Improved approximation algorithm for the parallel-machine customer order scheduling with delivery time and submodular rejection penalties. 1747-1754 - Prateek Jaiswal
Correction: Multistart algorithm for identifying all optima of nonconvex stochastic functions. 1755
Volume 18, Number 8, November 2024
- Pietro Belotti
Spatial branching for a special class of convex MIQO problems. 1757-1770 - Raul Garcia
Strategy investments in zero-sum games. 1771-1789 - Fan Yuan, Dachuan Xu, Donglei Du, Min Li
Differentially private k-center problems. 1791-1809 - Sevilay Demir Saglam
Duality in the problems of optimal control described by Darboux-type differential inclusions. 1811-1835 - Luis Evaristo Caraballo, R. A. Castro, José Miguel Díaz-Báñez, Marco A. Heredia, Jorge Urrutia, Inmaculada Ventura
Constrained many-to-many point matching in two dimensions. 1837-1854 - Ziyi Jiang, Dan Wang, Xinwei Liu
A fast primal-dual algorithm via dynamical system with variable mass for linearly constrained convex optimization. 1855-1880 - Yuwen Zhai, Qilin Wang
Optimality conditions for robust weakly efficient solutions in uncertain optimization. 1881-1905 - Lam Quoc Anh, Nguyen Huu Danh, Pham Thanh Duoc:
Hausdorff continuity of solution maps to equilibrium problems via the oriented distance function. 1907-1924 - Manzhan Gu, Weitao Yang, Peihai Liu:
Stochastic single-machine scheduling with workload-dependent maintenance activities. 1925-1947 - Ba-Yi Cheng, Jie Duan
Integrated optimization of design and production process with personalization level of products. 1949-1960
Volume 18, Number 9, December 2024
- Hadi Charkhgard, Jinkyoo Park, Changhyun Kwon
Special issue on advances in computational optimization and their modern applications. 1961-1962 - Nalin Thoummala, Yuncheol Kang, Daiki Min
A deep learning-based approach to a newsvendor problem considering uncertainty and time-varying costs. 1963-1974 - Frank E. Curtis
Fair machine learning through constrained stochastic optimization and an ε-constraint method. 1975-1991 - Dogacan Yilmaz, I. Esra Büyüktahtakin:
A deep reinforcement learning framework for solving two-stage stochastic programs. 1993-2020 - Görkem Emirhüseyinoglu, Mohsen Shahhosseini
Validation of scenario generation for decision-making using machine learning prediction models. 2021-2032 - Abhijit Gosavi
Deep reinforcement learning for approximate policy iteration: convergence analysis and a post-earthquake disaster response case study. 2033-2050 - Alvaro Sierra-Altamiranda, Hadi Charkhgard
Learning to project in a criterion space search algorithm: an application to multi-objective binary linear programming. 2051-2078 - Mohit Mahajan, Wen-Mei Hwu, Rakesh Nagi
Determining optimal channel partition for 2:4 fine grained structured sparsity. 2079-2090 - A. S. Syed Shahul Hameed
NPROS: A Not So Pure Random Orthogonal search algorithm - A suite of random optimization algorithms driven by reinforcement learning. 2091-2111 - Yuqing Liang, Dongpo Xu
Almost sure convergence of stochastic composite objective mirror descent for non-convex non-smooth optimization. 2113-2131 - Xiao Ling
Kernel ℓ 1-norm principal component analysis for denoising. 2133-2148 - Siham Tassouli
A neurodynamic approach for joint chance constrained rectangular geometric optimization. 2149-2167 - Marc Chalé
Constrained optimization based adversarial example generation for transfer attacks in network intrusion detection systems. 2169-2188 - Allen Holder
Comparing voting districts with uncertain data envelopment analysis. 2189-2202 - Francesco Biancalani, Giorgio Gnecco
Prediction of annual CO2 emissions at the country and sector levels, based on a matrix completion optimization problem. 2203-2219 - Sang-Wook Lee, Hyun-Jung Kim
Single machine scheduling with maintenance and position-based job eligibility constraints for battery manufacturing. 2221-2234
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
last updated on 2024-11-21 20:19 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: