Optimization Letters

Papers
(The median citation count of Optimization Letters is 1. The table below lists those papers that are above that threshold based on CrossRef citation counts [max. 250 papers]. The publications cover those that have been published in the past four years, i.e., from 2022-06-01 to 2026-06-01.)
ArticleCitations
Preface to the special issue dedicated to the International Conference “Mathematical optimization theory and Operations Research” (MOTOR 2020) held online from July 6 to July 10, 202033
Constrained many-to-many point matching in two dimensions22
Integrated optimization of design and production process with personalization level of products19
A Riemannian subspace BFGS trust region method19
Convergence analysis of generalized ADMM with majorization for linearly constrained composite convex optimization14
Comparing voting districts with uncertain data envelopment analysis13
Exact combinatorial algorithms for solving the bin covering problems with strong divisibility and rejection profit13
A unified approach to approximate partial, prize-collecting, and budgeted sweep cover problems12
An exact penalty method for group-sparse portfolio selection12
On unique recovery of finite-valued integer signals and admissible lattices of sparse hypercubes12
A distributional Farkas’ lemma and moment optimization problems with no-gap dual semi-definite programs12
Stiefel optimization is NP-hard12
On efficient algorithms for bottleneck path problems with many sources11
A simplified treatment of Ramana’s exact dual for semidefinite programming10
On the uniqueness of Nash equilibria in polymatrix games10
Uniqueness of solutions in multivariate Chebyshev approximation problems10
On asymptotic global stability of linear variational inequalities in Hilbert space based on Hausdorff convergence10
Pareto efficiency without topology9
A new convergence rate of the steepest descent regarding the Euclidean norm9
A semidefinite hierarchy for the expected independence number of a random graph9
On the least square prenucleolus for games with externalities9
Linear convergence rate analysis of proximal generalized ADMM for convex composite programming8
Branch-and-bound-and-memorize for the blocking permutation flowshop problem8
A global optimization approach to Berge equilibrium based on a regularized function8
An improved algorithm for parallel machine scheduling under additional resource constraints8
Well-posedness for the split equilibrium problem8
On ambiguity-averse market equilibrium8
A conditional-logic interpretation for Miller–Tucker–Zemlin inequalities and extensions7
Stability for set optimization problems and applications7
Approximating the order 2 quantum Wasserstein distance using the moment-SOS hierarchy7
Cooperation in combinatorial search7
Convergence rate analysis of proximal iteratively reweighted $$\ell _1$$ methods for $$\ell _p$$ regularization problems7
A gradient projection algorithm based on the normal-S iterative algorithm: convergence analysis and machine learning application7
Higher-order optimality conditions of robust Benson proper efficient solutions in uncertain vector optimization problems7
The multilevel facility location and pricing problems: the computational complexity and the stability analysis7
A gradient method exploiting the two dimensional quadratic termination property6
The budgeted maximin share allocation problem6
Generator subadditive functions for mixed-integer programs6
Minimizing the number of tardy jobs with generalized due-dates and position-dependent processing times6
A best possible online algorithm for minimizing the total completion time and the total soft penalty cost6
A Non-polyhedral extension of the Frank–Wolfe theorem to cubic optimization6
On linear algebraic algorithms for the subgraph matching problem and its variants6
A unified tool for solving uni-parametric linear programs, convex quadratic programs, and linear complementarity problems6
The operator splitting schemes revisited: primal-dual gap and degeneracy reduction by a unified analysis6
Optimality conditions for robust weakly efficient solutions in uncertain optimization5
General variable neighborhood search for the minimum stretch spanning tree problem5
Hybrid variable neighborhood search for automated warehouse scheduling5
Frugal and decentralised resolvent splittings defined by nonexpansive operators5
On coupling constraints in linear bilevel optimization5
Stability approach to CDC truck scheduling problem under uncertainty5
A metaheuristic algorithm for efficient aircraft sequencing and scheduling in terminal maneuvering areas5
Recovering linear causal models with latent variables via Cholesky factorization of covariance matrix5
A study on the impact of selecting the follower’s reaction in solving semi-vectorial bilevel problems5
Representation of positive polynomials on a generalized strip and its application to polynomial optimization5
Convergence of a special partially augmented Lagrangian algorithm for sparsity-constrained optimization problems5
An exceptionally difficult binary quadratic optimization problem with symmetry: a challenge for the largest unsolved QAP instance Tai256c5
Improved conditional gradient method for the generalized cone order optimization problem on the local sphere5
A maximal-clique-based set-covering approach to overlapping community detection5
Single-objective robust optimisation in bioprocessing with conformalised quantile regression as interval-based surrogate models5
On the relation between affinely adjustable robust linear complementarity and mixed-integer linear feasibility problems5
Expansions of the characteristic polynomial of a perturbed PSD matrix and convergence analysis of alternating projections for the PSD cone and a line5
Greedy Newton: Newton’s method with exact line search5
Efficient online sensitivity analysis for the injective bottleneck path problem5
Sparse and risk diversification portfolio selection5
Strategy investments in zero-sum games5
Approximation algorithm for the fault-tolerant knapsack center problem5
Differentially private k-center problems5
Spatial branching for a special class of convex MIQO problems5
Interior-point algorithm for symmetric cone horizontal linear complementarity problems based on a new class of algebraically equivalent transformations5
Existence of the least element solution of the vertical block Z-tensor complementarity problem5
Learning to project in a criterion space search algorithm: an application to multi-objective binary linear programming4
Stochastic single machine scheduling with time-dependent deterioration or position-dependent learning effect4
A monotonic optimization approach to mixed variational inequality problems4
The projected splitting iterative methods based on tensor splitting and its majorization matrix splitting for the tensor complementarity problem4
Mixed-integer linear optimization for cardinality-constrained random forests4
Nonnegative low-rank matrix recovery can have spurious local minima4
Optimality conditions for homogeneous polynomial optimization on the unit sphere4
The semiproximal SVM approach for multiple instance learning: a kernel-based computational study4
On penalized reload cost path, walk, tour and maximum flow: hardness and approximation4
Policies for multi-trip route planning in time-sensitive environments4
Minimizing a complex quadratic fractional optimization problem with two second-order cone constraints4
A strict complementarity approach to error bound and sensitivity of solution of conic programs4
Polyhedral results and stronger Lagrangean bounds for stable spanning trees4
Convergence analysis of the DFP algorithm for unconstrained optimization problems on Riemannian manifolds4
Predict and optimize: a smart inventory management model for beauty retail4
Dual and generalized dual cones in Banach spaces4
The metric projection over a polyhedral set through the relative interiors of its faces4
On an effective approach in shape optimization problem for Stokes equation4
Enhancing finite-difference-based derivative-free optimization with machine learning4
A new approach to the multiple obnoxious facility location problem based on combinatorial and continuous tools4
Almost sure convergence of stochastic composite objective mirror descent for non-convex non-smooth optimization4
A fast primal-dual algorithm via dynamical system with variable mass for linearly constrained convex optimization3
Duality in the problems of optimal control described by Darboux-type differential inclusions3
A generalized Frank–Wolfe method with “dual averaging” for strongly convex composite optimization3
Convergence of the sum-of-squares hierarchy for quadratic optimization over roots-of-unity3
On the weak and strong convergence of modified forward-backward-half-forward splitting methods3
A generalised λ-Core concept for normal form games3
Linear adjustable robust optimization problem: semidefinite programming reformulation, optimality conditions and duality3
Optimal TSP tour length estimation using Sammon maps3
Symmetric positive subdefinite tensors3
Practical algorithm for minimum cost submodular cover problem with performance guarantees3
On the diameter of a 2-sum of polyhedra3
Resolving an open problem: maximizing the total irregularity index of molecular trees with prescribed segments or branching vertices3
A deep reinforcement learning framework for solving two-stage stochastic programs3
Functions and inequalities associated with the nonconvex second-order cone3
A linearized method for solving tensor complementarity problems with implicit Z-tensors3
On the linear convergence rate of Riemannian proximal gradient method3
Trust and reputation systems in cloud data centers: a variational approach3
A general VNS for the multi-depot open vehicle routing problem with time windows3
A hybrid acceleration Douglas-Rachford splitting method for solving large-scale absolute value equations3
Multi-product Newsvendor problem with dynamic pricing: a decision interpolation approximation3
A note: on the two-stage flowshop with dedicated machines to minimize total load3
Convergence theorems of hybrid projection algorithms with two inertial terms for solving fixed point problem3
Improvement of convergence criteria for finding common fixed points of multiple finite demicontractive mappings3
A decomposition algorithm for distributionally robust chance-constrained programs with polyhedral ambiguity set3
Scheduling coupled tasks on parallel identical machines3
Circumcentric directions of cones3
A New full-newton step infeasible interior-point method for $$P_*(\kappa )$$-linear Complementarity problem3
Optimal step length for the maximal decrease of a self-concordant function by the Newton method3
Practical approximation algorithms for $${\ell}_1$$-regularized sparse rank-1 approximation to higher-order tensors2
Approximation algorithm for solving the 1-line Steiner tree problem with minimum number of Steiner points2
Kernel $$\ell ^1$$-norm principal component analysis for denoising2
Feature selection in machine learning via variable neighborhood search2
Absolute value equations with $$2^n$$ solutions2
Fractional absolute value equations2
Minimizing the influence spread over a network through node interception2
An accelerating algorithm for maximum shortest path interdiction problem by upgrading edges on trees under unit Hamming distance2
New smooth weighted complementarity functions and a cubically convergent method for wLCP2
Solving the probabilistic profitable tour problem on a line2
A folding preprocess for the max k-cut problem2
The singularity degree of a face of the cone of copositive matrices2
Facet-defining triangle inequalities for the quadratic linear ordering problem2
A parallel greedy approach enhanced by genetic algorithm for the stochastic rig routing problem2
A closed-form bound on the asymptotic linear convergence of iterative methods via fixed point analysis2
A comprehensive theoretical framework for the optimization of neural networks classification performance with respect to weighted metrics2
A modification of the forward–backward splitting method for monotone inclusions2
Method for finding solution to “quasidifferentiable” differential inclusion2
Absolute value inequalities2
A note on the hierarchical multi-switch multi-echelon vehicle routing problem2
Structured $$(\min ,+)$$-convolution and its applications for the shortest/closest vector and nonlinear knapsack problems2
Worst-case evaluation complexity of a derivative-free quadratic regularization method2
An optimization approach to coalition formation in centralized EOQ problems with additive transportation costs2
Linear convergence of the proximal gradient method for composite optimization under the Polyak-Łojasiewicz inequality and its variant2
Local error bounds for the generalized polynomial complementarity problem2
Nicely structured positive bases with maximal cosine measure2
Rates of asymptotic regularity for the alternating Halpern–Mann iteration2
Determining optimal channel partition for 2:4 fine grained structured sparsity2
Newton-type algorithms for inverse optimization: weighted bottleneck Hamming distance and $$\ell _\infty$$-norm objectives2
Biased random-key genetic algorithms for the minimum subgraph diameter problem2
Mixed lattice structures and cone projections2
An uncertain minimization problem: robust optimization versus optimization of robustness2
Degree sequence optimization in bounded treewidth2
Structure of solutions to a class of multistage stochastic linear complementarity problems2
Mixed-integer linearity in nonlinear optimization: a trust region approach2
Exact separation theorem for disjoint closed sets in Hilbert spaces2
Complexity bound of a Levenberg–Marquardt algorithm based on probabilistic Jacobian models2
On atomic cliques in temporal graphs2
Approximate properly solutions of constrained vector optimization with variable coradiant sets2
A cut-based mixed integer programming formulation for the hop-constrained cheapest path problem2
Goldstein stationarity in Lipschitz constrained optimization2
Benchmark-based deviation and drawdown measures in portfolio optimization1
Extension of the value function reformulation to multiobjective bilevel optimization1
Hybrid strategy in multiperiod mean-variance framework1
Local linear convergence of proximal coordinate descent algorithm1
Metric perturbation of Milyutin-type regularity and application to cyclic fixed point theorems1
On maximal and minimal elements for sets with respect to cones1
The symmetry coefficient of positively homogeneous functions1
Learning to deactivate probing with graph convolutional network for mixed-integer nonlinear programming1
Some worst-case results related to the asymmetric traveling salesman problem1
Does risk aversion decrease the order quantity?1
Buffered and Reduced Multidimensional Distribution Functions and Their Application in Optimization1
Characterizations of the solution set for tangentially convex optimization problems1
Validation of scenario generation for decision-making using machine learning prediction models1
Proximal gradient methods with inexact oracle of degree q for composite optimization1
Characterization of set-valued robustness via extended signed distances and separation1
Hausdorff continuity of solution maps to equilibrium problems via the oriented distance function1
A bilevel critical node detection problem1
On a new simple algorithm to compute the resolvents1
Conveyor operations in distribution centers: modeling and optimization1
On the firefighter problem with spreading vaccination for maximizing the number of saved nodes: the IP model and LP rounding algorithms1
The Chambolle–Pock method converges weakly with $$\theta >1/2$$ and $$\tau \sigma \Vert L\Vert ^2<4/(1+2\theta )$$1
Log-domain interior-point methods for convex quadratic programming1
Regularization of vector equilibrium problems1
A discrete competitive facility location model with proportional and binary rules sequentially applied1
The randomized block coordinate descent method in the Hölder smooth setting1
Algebraic formulation of simultaneous tensor-metric learning1
The rendezvous vehicle routing problem1
Globally solving a class of bilevel programs with spatial price equilibrium constraints1
Individual and cooperative portfolio optimization as linear program1
A new feasible moving ball projection algorithm for pseudomonotone variational inequalities1
Constrained optimization based adversarial example generation for transfer attacks in network intrusion detection systems1
On maximum-sum matchings of bichromatic points1
New second-order limiting directional derivatives and C$$^1$$-optimization1
A polytime preprocess algorithm for the maximum independent set problem1
An algorithm for jointly replenishment problem under stock dependent demand and power-of-two policy1
The truck–drone routing optimization problem: mathematical model and a VNS approach1
Hausdorff continuity conditions for parametric nonconvex equilibrium problems1
Subdifferentials of convex matrix-valued functions1
Tightening discretization-based MILP models for the pooling problem using upper bounds on bilinear terms1
A faster heuristic for the traveling salesman problem with drone1
The maximal angle between $$3 \times 3$$ copositive matrices1
Lower complexity bounds for minimizing regularized functions1
On proper minimality in set optimization1
Douglas-Rachford splitting algorithm for projected solution of quasi variational inequality with non-self constraint map1
On the new modulus-based matrix splitting method for linear complementarity problem of $$H_{+}$$-matrix1
Optimal control for production inventory of uncertain random system with jump and deteriorating items1
An accelerated lyapunov function for Polyak’s Heavy-ball on convex quadratics1
A proximal alternating direction method of multipliers with a proximal-perturbed Lagrangian function for nonconvex and nonsmooth structured optimization1
Convergence rates of training deep neural networks via alternating minimization methods1
Tensor denoising via dual Schatten norms1
A projected splitting method for vertical tensor complementarity problems1
Two-agent single-machine scheduling with release dates to minimize the makespan1
Mathematical formulations for the robust bin packing problem with fragile objects1
Approximation algorithms for the restricted k-Chinese postman problems with penalties1
On sparse solution of tensor complementarity problem1
Numerical solution of delay fractional optimal control problems with free terminal time1
Computing tighter bounds on the n-queens constant via Newton’s method1
Counter-adversarial training data distribution validation1
General variable neighborhood search for the parallel machine scheduling problem with two common servers1
Strengthened MIP formulations for the liver region redesign models of Akshat et al.1
A cutting plane algorithm for globally solving low-dimensional k-means problems1
0.40003299713135