| Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
| 1 | Samuel Kroger, Hamidreza Validi, Illya V. Hicks |
A polytime preprocess algorithm for the maximum independent set problem.  |
Optim. Lett.  |
2024 |
DBLP DOI BibTeX RDF |
|
| 1 | Shubham Kumar, Deepmala, Milan Hladík, Hossein Moosaei |
Characterization of unique solvability of absolute value equations: an overview, extensions, and future directions. |
Optim. Lett. |
2024 |
DBLP DOI BibTeX RDF |
|
| 1 | Benjamin Grimmer |
On optimal universal first-order methods for minimizing heterogeneous sums. |
Optim. Lett. |
2024 |
DBLP DOI BibTeX RDF |
|
| 1 | Geovani Nunes Grapiglia |
Worst-case evaluation complexity of a derivative-free quadratic regularization method. |
Optim. Lett. |
2024 |
DBLP DOI BibTeX RDF |
|
| 1 | Shiming Li, Wei Yu 0011, Zhaohui Liu 0001 |
A local search algorithm for the k-path partition problem. |
Optim. Lett. |
2024 |
DBLP DOI BibTeX RDF |
|
| 1 | Feng Guo, Meijun Zhang |
An SDP method for fractional semi-infinite programming problems with SOS-convex polynomials. |
Optim. Lett. |
2024 |
DBLP DOI BibTeX RDF |
|
| 1 | Yifu Chen, Christos T. Maravelias, Xiaomin Zhang |
Tightening discretization-based MILP models for the pooling problem using upper bounds on bilinear terms. |
Optim. Lett. |
2024 |
DBLP DOI BibTeX RDF |
|
| 1 | Christopher J. Lourenco, Erick Moreno-Centeno |
Exact QR factorizations of rectangular matrices. |
Optim. Lett. |
2024 |
DBLP DOI BibTeX RDF |
|
| 1 | Marco Locatelli 0001 |
A new approach to the multiple obnoxious facility location problem based on combinatorial and continuous tools. |
Optim. Lett. |
2024 |
DBLP DOI BibTeX RDF |
|
| 1 | Dmitry V. Gribanov, I. A. Shumilov, Dmitriy S. Malyshev |
Structured $(\min ,+)$-convolution and its applications for the shortest/closest vector and nonlinear knapsack problems. |
Optim. Lett. |
2024 |
DBLP DOI BibTeX RDF |
|
| 1 | Xianpeng Mao, Yuning Yang |
Practical approximation algorithms for ℓ1-regularized sparse rank-1 approximation to higher-order tensors. |
Optim. Lett. |
2024 |
DBLP DOI BibTeX RDF |
|
| 1 | Ran Ma, Juannian Xu, Yuzhong Zhang |
A best possible online algorithm for minimizing the total completion time and the total soft penalty cost. |
Optim. Lett. |
2024 |
DBLP DOI BibTeX RDF |
|
| 1 | Wei Liang, Zhao Zhang 0002, Ding-Zhu Du |
A unified approach to approximate partial, prize-collecting, and budgeted sweep cover problems. |
Optim. Lett. |
2024 |
DBLP DOI BibTeX RDF |
|
| 1 | 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. |
Optim. Lett. |
2024 |
DBLP DOI BibTeX RDF |
|
| 1 | Aleksandr Beznosikov, Martin Takác 0001 |
Random-reshuffled SARAH does not need full gradient computations. |
Optim. Lett. |
2024 |
DBLP DOI BibTeX RDF |
|
| 1 | Stevo Rackovic, Cláudia Soares, Dusan Jakovetic, Zoranka Desnica |
A majorization-minimization-based method for nonconvex inverse rig problems in facial animation: algorithm derivation. |
Optim. Lett. |
2024 |
DBLP DOI BibTeX RDF |
|
| 1 | Quentin Klopfenstein, Quentin Bertrand, Alexandre Gramfort, Joseph Salmon, Samuel Vaiter |
Local linear convergence of proximal coordinate descent algorithm. |
Optim. Lett. |
2024 |
DBLP DOI BibTeX RDF |
|
| 1 | Pengxiang Pan, Hongtao Zhu |
Approximation algorithms for the restricted k-Chinese postman problems with penalties. |
Optim. Lett. |
2024 |
DBLP DOI BibTeX RDF |
|
| 1 | Feng Xue |
The operator splitting schemes revisited: primal-dual gap and degeneracy reduction by a unified analysis. |
Optim. Lett. |
2024 |
DBLP DOI BibTeX RDF |
|
| 1 | Zhongming Wu, Ye Song, Fan Jiang |
Inexact generalized ADMM with relative error criteria for linearly constrained convex optimization problems. |
Optim. Lett. |
2024 |
DBLP DOI BibTeX RDF |
|
| 1 | Bogdan Grechuk, Michael Zabarankin, Alexander Mafusalov, Stan Uryasev |
Buffered and Reduced Multidimensional Distribution Functions and Their Application in Optimization. |
Optim. Lett. |
2024 |
DBLP DOI BibTeX RDF |
|
| 1 | Ping-Fan Dai, Shi-Liang Wu |
A projected splitting method for vertical tensor complementarity problems. |
Optim. Lett. |
2024 |
DBLP DOI BibTeX RDF |
|
| 1 | Zsolt Darvay, Petra Renáta Rigó |
Interior-point algorithm for symmetric cone horizontal linear complementarity problems based on a new class of algebraically equivalent transformations. |
Optim. Lett. |
2024 |
DBLP DOI BibTeX RDF |
|
| 1 | Manlio Gaudioso, Giampaolo Liuzzi, Stefano Lucidi |
A clustering heuristic to improve a derivative-free algorithm for nonsmooth optimization. |
Optim. Lett. |
2024 |
DBLP DOI BibTeX RDF |
|
| 1 | Abdennour Azerine, Mourad Boudhar, Djamal Rebaine |
On the complexity of proportionate open shop and job shop problems. |
Optim. Lett. |
2024 |
DBLP DOI BibTeX RDF |
|
| 1 | Zeinab Alizadeh, Afrooz Jalilzadeh, Farzad Yousefian |
Randomized Lagrangian stochastic approximation for large-scale constrained stochastic Nash games. |
Optim. Lett. |
2024 |
DBLP DOI BibTeX RDF |
|
| 1 | 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. |
Optim. Lett. |
2024 |
DBLP DOI BibTeX RDF |
|
| 1 | Mengxue Xia, Haohao Li, Daojun Xu |
Checking weak and strong optimality of the solution to interval convex quadratic programming in a general form. |
Optim. Lett. |
2024 |
DBLP DOI BibTeX RDF |
|
| 1 | Greta 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. |
Optim. Lett. |
2024 |
DBLP DOI BibTeX RDF |
|
| 1 | Ashish Cherukuri |
Sample average approximation of conditional value-at-risk based variational inequalities. |
Optim. Lett. |
2024 |
DBLP DOI BibTeX RDF |
|
| 1 | Patrick Mehlitz |
A simple proof of second-order sufficient optimality conditions in nonlinear semidefinite optimization. |
Optim. Lett. |
2024 |
DBLP DOI BibTeX RDF |
|
| 1 | Shaotao 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. |
Optim. Lett. |
2024 |
DBLP DOI BibTeX RDF |
|
| 1 | Anastasia Ivanova, Roland Hildebrand |
Optimal step length for the maximal decrease of a self-concordant function by the Newton method. |
Optim. Lett. |
2024 |
DBLP DOI BibTeX RDF |
|
| 1 | Mansoureh Alavi Hejazi, Nooshin Movahedian |
On constraint qualifications and optimality conditions for robust optimization problems through pseudo-differential. |
Optim. Lett. |
2024 |
DBLP DOI BibTeX RDF |
|
| 1 | Lidia Huerga, Enrico Miglierina, Elena Molho, Vicente Novo |
On proper minimality in set optimization. |
Optim. Lett. |
2024 |
DBLP DOI BibTeX RDF |
|
| 1 | Kai Kopperschmidt, Ruslanas Stacevicius |
Pooling adjacent violators under interval constraints. |
Optim. Lett. |
2024 |
DBLP DOI BibTeX RDF |
|
| 1 | Binbin Zhang, Fuhong Yu |
Exact separation theorem for disjoint closed sets in Hilbert spaces. |
Optim. Lett. |
2024 |
DBLP DOI BibTeX RDF |
|
| 1 | Matteo Avolio, Antonio Fuduli |
The semiproximal SVM approach for multiple instance learning: a kernel-based computational study. |
Optim. Lett. |
2024 |
DBLP DOI BibTeX RDF |
|
| 1 | Vinícius Carvalho Soares, Marcos Costa Roboredo |
On the exact solution of the multi-depot open vehicle routing problem. |
Optim. Lett. |
2024 |
DBLP DOI BibTeX RDF |
|
| 1 | Vera Roshchina, Nadezda Sukhorukova, Julien Ugon |
Uniqueness of solutions in multivariate Chebyshev approximation problems. |
Optim. Lett. |
2024 |
DBLP DOI BibTeX RDF |
|
| 1 | Shuhan Kou, Bruce L. Golden, Luca Bertazzi |
An improved model for estimating optimal VRP solution values. |
Optim. Lett. |
2024 |
DBLP DOI BibTeX RDF |
|
| 1 | Nikolaos Karagiannis-Axypolitidis, Fabrizio Panebianco, Giuliano Bonanomi, Francesco Giannino |
Plants' competition under autotoxicity effect: an evolutionary game. |
Optim. Lett. |
2024 |
DBLP DOI BibTeX RDF |
|
| 1 | Robert J. Baraldi, Drew P. Kouri |
Local convergence analysis of an inexact trust-region method for nonsmooth optimization. |
Optim. Lett. |
2024 |
DBLP DOI BibTeX RDF |
|
| 1 | Mostafa Khatami, Daniel Oron, Amir Salehipour |
Scheduling coupled tasks on parallel identical machines. |
Optim. Lett. |
2024 |
DBLP DOI BibTeX RDF |
|
| 1 | Qian Yan, Wang Chen, Xinmin Yang |
A novel one-parameter filled function method with an application to pathological analysis. |
Optim. Lett. |
2024 |
DBLP DOI BibTeX RDF |
|
| 1 | Malick M. Ndiaye, Ahmed Osman, Saïd Salhi, Batool Madani |
The truck-drone routing optimization problem: mathematical model and a VNS approach. |
Optim. Lett. |
2024 |
DBLP DOI BibTeX RDF |
|
| 1 | Seulgi Joung |
A new sequential lifting of robust cover inequalities. |
Optim. Lett. |
2024 |
DBLP DOI BibTeX RDF |
|
| 1 | Pavel A. Borisovsky |
A parallel greedy approach enhanced by genetic algorithm for the stochastic rig routing problem. |
Optim. Lett. |
2024 |
DBLP DOI BibTeX RDF |
|
| 1 | Xue-liu Li, Tong-tong Shang, Guo-ji Tang |
Lower bounds of the solution set of the polynomial complementarity problem. |
Optim. Lett. |
2024 |
DBLP DOI BibTeX RDF |
|
| 1 | Matan Atsmony, Gur Mosheiov |
Single machine scheduling to minimize maximum earliness/tardiness cost with job rejection. |
Optim. Lett. |
2024 |
DBLP DOI BibTeX RDF |
|
| 1 | Shaohua Xie, Jia Li |
k-sparse vector recovery via Truncated ℓ 1-ℓ 2 local minimization. |
Optim. Lett. |
2024 |
DBLP DOI BibTeX RDF |
|
| 1 | Laurentiu Leustean, Pedro Pinto 0003 |
Rates of asymptotic regularity for the alternating Halpern-Mann iteration. |
Optim. Lett. |
2024 |
DBLP DOI BibTeX RDF |
|
| 1 | Jintao Xu, Chenglong Bao, Wenxun Xing |
Convergence rates of training deep neural networks via alternating minimization methods. |
Optim. Lett. |
2024 |
DBLP DOI BibTeX RDF |
|
| 1 | Soumitra Dey, Vellaichamy Vetrivel, Hong-Kun Xu |
Well-posedness for the split equilibrium problem. |
Optim. Lett. |
2024 |
DBLP DOI BibTeX RDF |
|
| 1 | Jack Zhang, Hamidreza Validi, Austin Buchanan, Illya V. Hicks |
Linear-size formulations for connected planar graph partitioning and political districting. |
Optim. Lett. |
2024 |
DBLP DOI BibTeX RDF |
|
| 1 | Xu Tian |
Award scheme in productivity-based contests. |
Optim. Lett. |
2024 |
DBLP DOI BibTeX RDF |
|
| 1 | Krishnamurthy Dvijotham, Bala Krishnamoorthy, Yunqi Luo, Benjamin Rapone |
Robust feasibility of systems of quadratic equations using topological degree theory. |
Optim. Lett. |
2024 |
DBLP DOI BibTeX RDF |
|
| 1 | Shuhan Kou, Bruce L. Golden, Stefan Poikonen |
Optimal TSP tour length estimation using Sammon maps. |
Optim. Lett. |
2023 |
DBLP DOI BibTeX RDF |
|
| 1 | Mujahid N. Syed |
Feature selection in machine learning via variable neighborhood search. |
Optim. Lett. |
2023 |
DBLP DOI BibTeX RDF |
|
| 1 | Jing Yang, Xueyu Shi, Oleg A. Prokopyev |
Exact solution approaches for a class of bilevel fractional programs. |
Optim. Lett. |
2023 |
DBLP DOI BibTeX RDF |
|
| 1 | Marduch Tadaros, Athanasios Migdalas, Björn Samuelsson |
A note on the hierarchical multi-switch multi-echelon vehicle routing problem. |
Optim. Lett. |
2023 |
DBLP DOI BibTeX RDF |
|
| 1 | An Zhang 0001, Tan Zhen, Yong Chen 0002, Guangting Chen |
An improved algorithm for parallel machine scheduling under additional resource constraints. |
Optim. Lett. |
2023 |
DBLP DOI BibTeX RDF |
|
| 1 | Byung-Cheon Choi, Myoung-Ju Park |
Correction to: Two‑machine flow shop scheduling with convex resource consumption functions. |
Optim. Lett. |
2023 |
DBLP DOI BibTeX RDF |
|
| 1 | Yuncheng Luo |
Stochastic single machine scheduling with time-dependent deterioration or position-dependent learning effect. |
Optim. Lett. |
2023 |
DBLP DOI BibTeX RDF |
|
| 1 | Lijun Ding, Madeleine Udell |
A strict complementarity approach to error bound and sensitivity of solution of conic programs. |
Optim. Lett. |
2023 |
DBLP DOI BibTeX RDF |
|
| 1 | Yi Lei, Hu Shao, Ting Wu 0009, Pengjie Liu |
An accelerating algorithm for maximum shortest path interdiction problem by upgrading edges on trees under unit Hamming distance. |
Optim. Lett. |
2023 |
DBLP DOI BibTeX RDF |
|
| 1 | Maxim K. Sakharov, Kamila Koledina, Irek Gubaydullin, Anatoly P. Karpenko |
Parallel memetic algorithm for optimal control of multi-stage catalytic reactions. |
Optim. Lett. |
2023 |
DBLP DOI BibTeX RDF |
|
| 1 | Chongyang Liu, Zhaohua Gong, Song Wang 0004, Kok Lay Teo |
Numerical solution of delay fractional optimal control problems with free terminal time. |
Optim. Lett. |
2023 |
DBLP DOI BibTeX RDF |
|
| 1 | Lahoussine Lafhim, Alain B. Zemkoho |
Extension of the value function reformulation to multiobjective bilevel optimization. |
Optim. Lett. |
2023 |
DBLP DOI BibTeX RDF |
|
| 1 | Kaining Shao, Wenjuan Fan, Zishu Yang, Shanlin Yang, Panos M. Pardalos |
A variable neighborhood search algorithm for a PET/CT examination scheduling problem considering multi-stage process and deteriorating effect. |
Optim. Lett. |
2023 |
DBLP DOI BibTeX RDF |
|
| 1 | Shmuel Onn |
Degree sequence optimization in bounded treewidth. |
Optim. Lett. |
2023 |
DBLP DOI BibTeX RDF |
|
| 1 | Hadi Abbaszadehpeivasti, Etienne de Klerk, Moslem Zamani |
Conditions for linear convergence of the gradient method for non-convex optimization. |
Optim. Lett. |
2023 |
DBLP DOI BibTeX RDF |
|
| 1 | Xiangyu Cui, Duan Li 0002, Yun Shi, Mingjia Zhu |
Hybrid strategy in multiperiod mean-variance framework. |
Optim. Lett. |
2023 |
DBLP DOI BibTeX RDF |
|
| 1 | Artem A. Panin, Aleksandr V. Plyasunov |
The multilevel facility location and pricing problems: the computational complexity and the stability analysis. |
Optim. Lett. |
2023 |
DBLP DOI BibTeX RDF |
|
| 1 | Olga I. Kostyukova, Tatiana V. Tchemisova |
An exact explicit dual for the linear copositive programming problem. |
Optim. Lett. |
2023 |
DBLP DOI BibTeX RDF |
|
| 1 | Warren L. Hare, Gabriel Jarry-Bolduc, Chayne Planiden |
Nicely structured positive bases with maximal cosine measure. |
Optim. Lett. |
2023 |
DBLP DOI BibTeX RDF |
|
| 1 | Renbo Zhao, Qiuyun Zhu |
A generalized Frank-Wolfe method with "dual averaging" for strongly convex composite optimization. |
Optim. Lett. |
2023 |
DBLP DOI BibTeX RDF |
|
| 1 | Christian Bingane |
Largest small polygons: a sequential convex optimization approach. |
Optim. Lett. |
2023 |
DBLP DOI BibTeX RDF |
|
| 1 | Jianping Li, Lijian Cai, Junran Lichen, Pengxiang Pan |
Combinatorial algorithms for solving the constrained knapsack problems with divisible item sizes and penalties. |
Optim. Lett. |
2023 |
DBLP DOI BibTeX RDF |
|
| 1 | Hui Ouyang |
Bregman circumcenters: monotonicity and forward weak convergence. |
Optim. Lett. |
2023 |
DBLP DOI BibTeX RDF |
|
| 1 | Saman Babaie-Kafaki, Nasrin Mirhoseini, Zohre Aminifard |
A descent extension of a modified Polak-Ribière-Polyak method with application in image restoration problem. |
Optim. Lett. |
2023 |
DBLP DOI BibTeX RDF |
|
| 1 | Alberto Herrán, J. Manuel Colmenar, Nenad Mladenovic, Abraham Duarte |
A general variable neighborhood search approach for the minimum load coloring problem. |
Optim. Lett. |
2023 |
DBLP DOI BibTeX RDF |
|
| 1 | Farzaneh Karami, Mahdi Fathi 0001, Panos M. Pardalos |
Conveyor operations in distribution centers: modeling and optimization. |
Optim. Lett. |
2023 |
DBLP DOI BibTeX RDF |
|
| 1 | José Yunier Bello Cruz, Oday Hazaimah |
On the weak and strong convergence of modified forward-backward-half-forward splitting methods. |
Optim. Lett. |
2023 |
DBLP DOI BibTeX RDF |
|
| 1 | Pitchaya Wiratchotisatian, Andrew C. Trapp |
A reformulation technique to solve polynomial optimization problems with separable objective functions of bounded integer variables. |
Optim. Lett. |
2023 |
DBLP DOI BibTeX RDF |
|
| 1 | Jianbin Wang, Jianhua Yuan, Wenbao Ai |
A step-truncated method in a wide neighborhood interior-point algorithm for linear programming. |
Optim. Lett. |
2023 |
DBLP DOI BibTeX RDF |
|
| 1 | David T. Mildebrath |
A polynomial-time algorithm for a nonconvex chance-constrained program under the normal approximation. |
Optim. Lett. |
2023 |
DBLP DOI BibTeX RDF |
|
| 1 | Bruce L. Golden, Eric Oden, S. Raghavan 0001 |
The rendezvous vehicle routing problem. |
Optim. Lett. |
2023 |
DBLP DOI BibTeX RDF |
|
| 1 | Müzeyyen Ertürk, Ahmet Salkim |
Superiorization and bounded perturbation resilience of a gradient projection algorithm solving the convex minimization problem. |
Optim. Lett. |
2023 |
DBLP DOI BibTeX RDF |
|
| 1 | Pascal Heid |
A link between the steepest descent method and fixed-point iterations. |
Optim. Lett. |
2023 |
DBLP DOI BibTeX RDF |
|
| 1 | Casper T. Röling, Stefanny Ramirez, Dario Bauso, Hamidou Tembine |
Stochastic programming with primal-dual dynamics: a mean-field game approach. |
Optim. Lett. |
2023 |
DBLP DOI BibTeX RDF |
|
| 1 | Qian Li, Wei Zhang |
Sparse and risk diversification portfolio selection. |
Optim. Lett. |
2023 |
DBLP DOI BibTeX RDF |
|
| 1 | Joel Antonio Trejo-Sánchez, Francisco Alejandro Madera-Ramírez, José Alberto Fernández-Zepeda, José Luis López-Martínez, Alejandro Flores-Lamas |
A fast approximation algorithm for the maximum 2-packing set problem on planar graphs. |
Optim. Lett. |
2023 |
DBLP DOI BibTeX RDF |
|
| 1 | Jonathan Gillard 0002 |
Review on the book Yaroslav D. Sergeyev, Renato De Leone (Eds.) Numerical infinities and infinitesimals in optimization. |
Optim. Lett. |
2023 |
DBLP DOI BibTeX RDF |
|
| 1 | Zhanyin Li, Jun Pei, Ping Yan, Ya Zhou, Panos M. Pardalos |
Dynamic resource allocation and collaborative scheduling in R&D and manufacturing processes of high-end equipment with budget constraint. |
Optim. Lett. |
2023 |
DBLP DOI BibTeX RDF |
|
| 1 | Wenjie Li, Hailing Liu |
Online NDP-constraint scheduling of jobs with delivery times or weights. |
Optim. Lett. |
2023 |
DBLP DOI BibTeX RDF |
|
| 1 | Temitayo Ajayi, Taewoo Lee, Andrew J. Schaefer |
A note on the implications of approximate submodularity in discrete optimization. |
Optim. Lett. |
2023 |
DBLP DOI BibTeX RDF |
|
| 1 | Lei Huang |
Optimality conditions for homogeneous polynomial optimization on the unit sphere. |
Optim. Lett. |
2023 |
DBLP DOI BibTeX RDF |
|
| 1 | Jeffrey Larson 0001, Misha Padidar, Stefan M. Wild |
Modeling approaches for addressing unrelaxable bound constraints with unconstrained optimization methods. |
Optim. Lett. |
2023 |
DBLP DOI BibTeX RDF |
|
| 1 | Ioana Molan, Martin Schmidt 0003 |
Using neural networks to solve linear bilevel problems with unknown lower level. |
Optim. Lett. |
2023 |
DBLP DOI BibTeX RDF |
|
![[Valid RSS]](Pics/valid-rss.png "Validate my RSS feed")
data released under the ODC-BY 1.0 license