default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDOptimization Letters, Volume 19
Volume 19, Number 1, January 2025
- Leandro Farias Maia
, David Huckleberry Gutman:
The randomized block coordinate descent method in the Hölder smooth setting. 1-20 - Lorenzo Reus:
Merton portfolio allocation under stochastic dividends. 21-40 - Xiao-bo Li, Kai Tu, Jian Lu:
Convergence analysis of the DFP algorithm for unconstrained optimization problems on Riemannian manifolds. 41-60 - Mengxiao Fan, Jicheng Li:
The projected splitting iterative methods based on tensor splitting and its majorization matrix splitting for the tensor complementarity problem. 61-84 - Jun Wang, Qiang Ma:
On the implementation of ADMM with dynamically configurable parameter for the separable ℓ 1/ℓ 2 minimization. 85-102 - Christopher John Price, Blair Lennon Robertson, Marco Reale:
Extending oscars-ii to generally constrained global optimization. 103-122 - Donatella Granata:
On penalized reload cost path, walk, tour and maximum flow: hardness and approximation. 123-138 - Li Zhang, Jing Yuan, Qiaoliang Li:
An approximation algorithm for k-level squared metric facility location problem with outliers. 139-149 - Robert D. Barish, Tetsuo Shibuya:
Affine optimal k-proper connected edge colorings. 151-168 - Francesco 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. 169-192 - José Maurício Fernandes Medeiros, Anand Subramanian, Eduardo Queiroga:
Population-based iterated local search for batch scheduling on parallel machines with incompatible job families, release dates, and tardiness penalties. 193-210 - Charles Audet, Pierre-Yves Bouchet, Loïc Bourdin:
Convergence towards a local minimum by direct search methods with a covering step. 211-231
Volume 19, Number 2, March 2025
- Aboozar Mohammadi, Davood Hajinezhad, Alfredo García:
A trust-region approach for computing Pareto fronts in multiobjective derivative-free optimization. 233-266 - Torbjørn Cunis:
Decomposed quasiconvex optimization with application to generalized cone problems. 267-284 - Yassine Nabou, François Glineur, Ion Necoara:
Proximal gradient methods with inexact oracle of degree q for composite optimization. 285-306 - Antonio Orvieto:
An accelerated lyapunov function for Polyak's Heavy-ball on convex quadratics. 307-328 - Dániel Gerbner, Balázs Keszegh, Kartal Nagy, Balázs Patkós, Gábor Wiener:
Cooperation in combinatorial search. 329-345 - M. Gloria Fiestras-Janeiro, Alejandro Saavedra-Nieves:
On the least square prenucleolus for games with externalities. 347-365 - Andrew C. Pangia:
Approximating optimal solutions to biconvex parametric programs. 367-387 - Akhtar A. Khan, Dezhou Kong, Jinlu Li:
Dual and generalized dual cones in Banach spaces. 389-412 - Arnab Sur:
Are weaker stationarity concepts of stochastic MPCC problems significant in absence of SMPCC-LICQ? 413-424 - Benjamin Grimmer, Zhichao Jia:
Goldstein stationarity in Lipschitz constrained optimization. 425-435
Volume 19, Number 3, April 2025
- Antoine Oustry, Martina Cerulli:
Convex semi-infinite programming algorithms with inexact separation oracles. 437-462 - Dimitri J. Papageorgiou, Jan Kronqvist, Asha Ramanujam, James Kor, Youngdae Kim, Can Li:
Solution polishing via path relinking for continuous black-box optimization. 463-504 - Aysenur Karagoz, Ruofeng Liu, Hamidreza Validi:
Strengthened MIP formulations for the liver region redesign models of Akshat et al. 505-525 - Maziar 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. 527-549 - Shuang Wang, Li-Ping Pang, Jian Lv:
Robust satisficing model with Sinkhorn distance. 551-577 - Dongdong Gui, Meilong Le, Xiaodong Luo, Zhouchun Huang:
A metaheuristic algorithm for efficient aircraft sequencing and scheduling in terminal maneuvering areas. 579-604 - Ali Babapour Azar, Rashed Khanjani Shiraz, Panos M. Pardalos:
Portfolio optimization based on higher order stochastic dominance: limited memory bundle algorithm approach. 605-641 - Van Dung Nguyen:
A modification of the forward-backward splitting method for monotone inclusions. 643-666 - Woocheol Choi, Changbum Chun, Yoon Mo Jung, Sangwoon Yun:
On the linear convergence rate of Riemannian proximal gradient method. 667-687 - Dorothee Henke, Henri Lefebvre, Martin Schmidt, Johannes Thürauf:
On coupling constraints in linear bilevel optimization. 689-697
Volume 19, Number 4, May 2025
- Laura Sprenkels, Zümbül Atan, Ivo Adan:
Multi-product Newsvendor problem with dynamic pricing: a decision interpolation approximation. 699-716 - Zexian Liu, Yu-Hong Dai, Hongwei Liu:
A limited memory subspace minimization conjugate gradient algorithm for unconstrained optimization. 717-745 - Kexin Ren, Chunguang Liu, Lumiao Wang:
The modified second APG method for a class of nonconvex nonsmooth problems. 747-770 - Pedro Henrique Del Bianco Hokama, Carla Negri Lintzmayer, Mário César San Felice:
A faster heuristic for the traveling salesman problem with drone. 771-791 - Xiaosong Ding, Jun Ma, Xiuming Li, Xi Chen:
Improved randomized approaches to the location of a conservative hyperplane. 793-809 - Gabriela B. Fonseca, Thiago Henrique Nogueira, Martín Gómez Ravetti:
Stability approach to CDC truck scheduling problem under uncertainty. 811-832 - Enrique Gerstl, Gur Mosheiov:
Minimizing the number of tardy jobs with generalized due-dates and position-dependent processing times. 833-845 - Tiantian Fan, Jingyong Tang:
New smooth weighted complementarity functions and a cubically convergent method for wLCP. 847-872 - Ruixue Zhao:
Complexity bound of a Levenberg-Marquardt algorithm based on probabilistic Jacobian models. 873-888 - G. Battur, Batbileg Sukhee, Rentsen Enkhbat:
A global optimization approach to Berge equilibrium based on a regularized function. 889-897
Volume 19, Number 5, June 2025
- Ramin Fakhimi, Hamidreza Validi, Illya V. Hicks, Tamás Terlaky, Luis F. Zuluaga:
A folding preprocess for the max k-cut problem. 899-917 - Anderson E. Schwertner, F. N. C. Sobral:
On complexity constants of linear and quadratic models for derivative-free trust-region algorithms. 919-930 - Truong Minh Tuyen, Nguyen Song Ha:
Explicit iterative algorithms for solving the split equality problems in Hilbert spaces. 931-954 - Bin Deng, Weidong Li:
The budgeted maximin share allocation problem. 955-968 - Shi-Liang Wu, Mei Long, Cui-Xia Li:
A projected fixed point method for a class of vertical tensor complementarity problems. 969-984 - Honglin Ding:
A generalized combination of parallel machine scheduling and path. 985-1005 - Qin Liu, Bo Hou, Gengsheng Zhang, Wen Liu:
An approximation algorithm for the k-prize-collecting hitting set problem. 1007-1016 - Chun-Hua Guo:
Comments on finite termination of the generalized Newton method for absolute value equations. 1017-1026 - Zhihan Zhu, Yanhao Zhang, Yong Xia:
Convergence rate of projected subgradient method with time-varying step-sizes. 1027-1031 - Alejandro Saavedra-Nieves:
An optimization approach to coalition formation in centralized EOQ problems with additive transportation costs. 1033-1052
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 2025-06-21 00:30 CEST 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:
