Optimization Letters

Article	Citations
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, 2020	34
On unique recovery of finite-valued integer signals and admissible lattices of sparse hypercubes	20
On the rate of convergence of alternating minimization for non-smooth non-strongly convex optimization in Banach spaces	19
Equilibrium uniqueness in aggregative games: very practical conditions	17
Cooperative congestion games: existence of a Nash-stable coalition structure	16
Guillotine cutting is asymptotically optimal for packing consecutive squares	15
Stochastic proximal subgradient descent oscillates in the vicinity of its accumulation set	13
Constrained many-to-many point matching in two dimensions	12
A Riemannian subspace BFGS trust region method	12
Convergence analysis of generalized ADMM with majorization for linearly constrained composite convex optimization	11
A unified approach to approximate partial, prize-collecting, and budgeted sweep cover problems	11
A distributional Farkas’ lemma and moment optimization problems with no-gap dual semi-definite programs	10
Comparing voting districts with uncertain data envelopment analysis	10
Pareto efficiency without topology	10
Integrated optimization of design and production process with personalization level of products	10
On efficient algorithms for bottleneck path problems with many sources	10
Uniqueness of solutions in multivariate Chebyshev approximation problems	9
On the least square prenucleolus for games with externalities	9
A new convergence rate of the steepest descent regarding the Euclidean norm	9
A note on study on proportionate flowshop scheduling with due-date assignment and position-dependent weights	8
On partial descriptions of König graphs for odd paths and all their spanning supergraphs	8
A simplified treatment of Ramana’s exact dual for semidefinite programming	8
Using regression models to understand the impact of route-length variability in practical vehicle routing	8
On ambiguity-averse market equilibrium	8
Improved exploitation of higher order smoothness in derivative-free optimization	8

An improved algorithm for parallel machine scheduling under additional resource constraints	7
Higher-order optimality conditions of robust Benson proper efficient solutions in uncertain vector optimization problems	7
Cooperation in combinatorial search	7
Distributionally-robust machine learning using locally differentially-private data	7
Well-posedness for the split equilibrium problem	7
A computational study on QP problems with general linear constraints	7
The multilevel facility location and pricing problems: the computational complexity and the stability analysis	7
Convergence rate analysis of proximal iteratively reweighted $$\ell _1$$ methods for $$\ell _p$$ regularization problems	7
Shrinking approximants for fixed point problem and generalized split null point problem in Hilbert spaces	7
Minimizing the number of tardy jobs with generalized due-dates and position-dependent processing times	7
Stochastic saddle-point optimization for the Wasserstein barycenter problem	7
A global optimization approach to Berge equilibrium based on a regularized function	7
A conditional-logic interpretation for Miller–Tucker–Zemlin inequalities and extensions	7
Linear convergence rate analysis of proximal generalized ADMM for convex composite programming	7
Uniform convexity, uniform monotonicity and $$(\phi ,c)$$-subdifferentiability with application to nonlinear PDE	6
A maximal-clique-based set-covering approach to overlapping community detection	6
Exact penalty functions with multidimensional penalty parameter and adaptive penalty updates	6
The operator splitting schemes revisited: primal-dual gap and degeneracy reduction by a unified analysis	6
A general variable neighborhood search approach for the minimum load coloring problem	6
A gradient method exploiting the two dimensional quadratic termination property	6
Frugal and decentralised resolvent splittings defined by nonexpansive operators	6
A no-delay single machine scheduling problem to minimize total weighted early and late work	6
On linear algebraic algorithms for the subgraph matching problem and its variants	6
A best possible online algorithm for minimizing the total completion time and the total soft penalty cost	6
Hybrid variable neighborhood search for automated warehouse scheduling	6
A new restricted memory level bundle method for constrained convex nonsmooth optimization	6
Primal-dual incremental gradient method for nonsmooth and convex optimization problems	5
Convergence of a special partially augmented Lagrangian algorithm for sparsity-constrained optimization problems	5
Differentially private k-center problems	5
2DPackLib: a two-dimensional cutting and packing library	5
A Non-polyhedral extension of the Frank–Wolfe theorem to cubic optimization	5
On coupling constraints in linear bilevel optimization	5
The budgeted maximin share allocation problem	5
General variable neighborhood search for the minimum stretch spanning tree problem	5
An exceptionally difficult binary quadratic optimization problem with symmetry: a challenge for the largest unsolved QAP instance Tai256c	5
A metaheuristic algorithm for efficient aircraft sequencing and scheduling in terminal maneuvering areas	5
Convergence rates analysis of a multiobjective proximal gradient method	5
Strategy investments in zero-sum games	5
Online total bipartite matching problem	4
Optimality conditions for robust weakly efficient solutions in uncertain optimization	4
Sparse and risk diversification portfolio selection	4
Wildfire burn scar encapsulation	4
Matching orderable and separable hypergraphs	4
On the relation between affinely adjustable robust linear complementarity and mixed-integer linear feasibility problems	4
The projected splitting iterative methods based on tensor splitting and its majorization matrix splitting for the tensor complementarity problem	4
Spatial branching for a special class of convex MIQO problems	4
Stability approach to CDC truck scheduling problem under uncertainty	4
Expansions of the characteristic polynomial of a perturbed PSD matrix and convergence analysis of alternating projections for the PSD cone and a line	4
Optimality conditions for homogeneous polynomial optimization on the unit sphere	4
A strict complementarity approach to error bound and sensitivity of solution of conic programs	4

On an effective approach in shape optimization problem for Stokes equation	4
Minimizing a complex quadratic fractional optimization problem with two second-order cone constraints	4
Representation of positive polynomials on a generalized strip and its application to polynomial optimization	4
Efficient online sensitivity analysis for the injective bottleneck path problem	4
Modeling a flexible staff scheduling problem in the Era of Covid-19	4
Existence of the least element solution of the vertical block Z-tensor complementarity problem	4
Nested-solution facility location models	4
Interior-point algorithm for symmetric cone horizontal linear complementarity problems based on a new class of algebraically equivalent transformations	4
Almost sure convergence of stochastic composite objective mirror descent for non-convex non-smooth optimization	4
Optimal externalities in a parallel transportation network	4
A general VNS for the multi-depot open vehicle routing problem with time windows	3
The metric projection over a polyhedral set through the relative interiors of its faces	3
On the weak and strong convergence of modified forward-backward-half-forward splitting methods	3
Scheduling coupled tasks on parallel identical machines	3
A decomposition algorithm for distributionally robust chance-constrained programs with polyhedral ambiguity set	3
Multi-product Newsvendor problem with dynamic pricing: a decision interpolation approximation	3
Convergence analysis of the DFP algorithm for unconstrained optimization problems on Riemannian manifolds	3
Circumcentric directions of cones	3
Stochastic single machine scheduling with time-dependent deterioration or position-dependent learning effect	3
Practical algorithm for minimum cost submodular cover problem with performance guarantees	3
A new approach to the multiple obnoxious facility location problem based on combinatorial and continuous tools	3
Dual and generalized dual cones in Banach spaces	3
Solution methodologies for minimizing a sum of pointwise minima of two functions	3
A note: on the two-stage flowshop with dedicated machines to minimize total load	3
A unified convergence rate analysis of the accelerated smoothed gap reduction algorithm	3
A linearized method for solving tensor complementarity problems with implicit Z-tensors	3
On the linear convergence rate of Riemannian proximal gradient method	3
Polyhedral results and stronger Lagrangean bounds for stable spanning trees	3
A generalized Frank–Wolfe method with “dual averaging” for strongly convex composite optimization	3
Duality in the problems of optimal control described by Darboux-type differential inclusions	3
An inventory model for multiple items assuming time-varying demands and limited storage	3
Connectedness properties of the efficient sets and the nondominated sets to vector optimization problems	3
A fast primal-dual algorithm via dynamical system with variable mass for linearly constrained convex optimization	3
Efficiently solving the thief orienteering problem with a max–min ant colony optimization approach	3
A deep reinforcement learning framework for solving two-stage stochastic programs	3
Learning to project in a criterion space search algorithm: an application to multi-objective binary linear programming	3
An exact penalty function method for optimal control of a dubins airplane in the presence of moving obstacles	3
Economic lot-sizing problem with remanufacturing option: complexity and algorithms	3
The partially symmetric rank-1 approximation of fourth-order partially symmetric tensors	3
Optimal TSP tour length estimation using Sammon maps	3
On penalized reload cost path, walk, tour and maximum flow: hardness and approximation	3
The semiproximal SVM approach for multiple instance learning: a kernel-based computational study	3
A New full-newton step infeasible interior-point method for $$P_*(\kappa )$$-linear Complementarity problem	3
Variable and constraint reduction techniques for the temporal bin packing problem with fire-ups	3
Linearized formulations for failure aware barter exchange	3
Optimal step length for the maximal decrease of a self-concordant function by the Newton method	3
On refinement strategies for solving $${\textsc {MINLP}\mathrm{s}}$$  by piecewise linear relaxations: a generalized red refinement	3
A closed-form bound on the asymptotic linear convergence of iterative methods via fixed point analysis	2
Convergence of the proximal bundle algorithm for nonsmooth nonconvex optimization problems	2
Approximate properly solutions of constrained vector optimization with variable coradiant sets	2
Exact separation theorem for disjoint closed sets in Hilbert spaces	2
Structured $$(\min ,+)$$-convolution and its applications for the shortest/closest vector and nonlinear knapsack problems	2
On atomic cliques in temporal graphs	2
A lexicographic optimization approach to the deviation-flow refueling station location problem on a general network	2
Optimal multi-state partnerships for woody biomass co-firing incorporating a demand-response function for biomass procurement	2
Degree sequence optimization in bounded treewidth	2
Inertial projection and contraction methods for split feasibility problem applied to compressed sensing and image restoration	2
A note on the hierarchical multi-switch multi-echelon vehicle routing problem	2
Dissecting the duality gap: the supporting hyperplane interpretation revisited	2
An accelerating algorithm for maximum shortest path interdiction problem by upgrading edges on trees under unit Hamming distance	2
The multi-depot k-traveling repairman problem	2
Constrained optimization based adversarial example generation for transfer attacks in network intrusion detection systems	2
On the proximal mapping for multi-valued monotone variational inequality problems	2
Complexity bound of a Levenberg–Marquardt algorithm based on probabilistic Jacobian models	2
Solving the probabilistic profitable tour problem on a line	2
A VNS based framework for early diagnosis of the Alzheimer's disease converted from mild cognitive impairment	2
The forward–backward splitting method for non-Lipschitz continuous minimization problems in Banach spaces	2
Newton-type algorithms for inverse optimization: weighted bottleneck Hamming distance and $$\ell _\infty$$-norm objectives	2
Approximation algorithm for solving the 1-line Steiner tree problem with minimum number of Steiner points	2
Complexity of near-optimal robust versions of multilevel optimization problems	2
Mixed lattice structures and cone projections	2
Approximation algorithm for minimum partial multi-cover under a geometric setting	2
Goldstein stationarity in Lipschitz constrained optimization	2
Nicely structured positive bases with maximal cosine measure	2
On self-concordant barriers for generalized power cones	2
Mixed-integer linearity in nonlinear optimization: a trust region approach	2
Expected value based optimal control for discrete-time stochastic noncausal systems	2
A modification of the forward–backward splitting method for monotone inclusions	2
An exact explicit dual for the linear copositive programming problem	2
New smooth weighted complementarity functions and a cubically convergent method for wLCP	2

Worst-case evaluation complexity of a derivative-free quadratic regularization method	2
An uncertain minimization problem: robust optimization versus optimization of robustness	2
An optimization approach to coalition formation in centralized EOQ problems with additive transportation costs	2
Trigonometric approximation of the Max-Cut polytope is star-like	2
A comprehensive theoretical framework for the optimization of neural networks classification performance with respect to weighted metrics	2
Practical approximation algorithms for $${\ell}_1$$-regularized sparse rank-1 approximation to higher-order tensors	2
Biased random-key genetic algorithms for the minimum subgraph diameter problem	2
Rates of asymptotic regularity for the alternating Halpern–Mann iteration	2
Determining optimal channel partition for 2:4 fine grained structured sparsity	2
A parallel greedy approach enhanced by genetic algorithm for the stochastic rig routing problem	2
Exact algorithms for the robust uncapacitated multiple allocation p-hub median problem	2
Feature selection in machine learning via variable neighborhood search	2
A fresh geometrical look at the general S-procedure	2
On a conservative partition refinement (CPR) method for a class of two-stage stochastic programming problems	2
A folding preprocess for the max k-cut problem	2
Hausdorff continuity of solution maps to equilibrium problems via the oriented distance function	1
A polytime preprocess algorithm for the maximum independent set problem	1
Efficient PTAS for the maximum traveling salesman problem in a metric space of fixed doubling dimension	1
A discrete competitive facility location model with proportional and binary rules sequentially applied	1
Convergence rates of training deep neural networks via alternating minimization methods	1
Buffered and Reduced Multidimensional Distribution Functions and Their Application in Optimization	1
New second-order limiting directional derivatives and C$$^1$$-optimization	1
Minsum scheduling with acceptable lead-times and optional job rejection	1
Modeling the spread of infectious diseases through influence maximization	1
Optimal control for production inventory of uncertain random system with jump and deteriorating items	1
A primal-dual approximation algorithm for the k-prize-collecting minimum power cover problem	1
Globally solving a class of bilevel programs with spatial price equilibrium constraints	1
Two-agent single-machine scheduling with release dates to minimize the makespan	1
Review on the book Anatoly Zhigljavsky, Antanas Žilinskas “Bayesian and High-Dimensional Global Optimization”, SpringerBriefs in Optimization, Springer, 2021	1
The randomized block coordinate descent method in the Hölder smooth setting	1
The set partitioning problem in a quantum context	1
Bregman circumcenters: monotonicity and forward weak convergence	1
On sparse solution of tensor complementarity problem	1
Strengthened MIP formulations for the liver region redesign models of Akshat et al.	1
A note on overrelaxation in the Sinkhorn algorithm	1
An exact method for optimizing a quadratic function over the efficient set of multiobjective integer linear fractional program	1
Method for finding solution to “quasidifferentiable” differential inclusion	1
A faster heuristic for the traveling salesman problem with drone	1
A new Bregman projection method with a self-adaptive process for solving variational inequality problem in reflexive Banach spaces	1
On maximal and minimal elements for sets with respect to cones	1
Decentralized scheduling with precedence constraints	1
The rendezvous vehicle routing problem	1
An accelerated lyapunov function for Polyak’s Heavy-ball on convex quadratics	1
Convergence rates of damped inerial dynamics from multi-degree-of-freedom system	1
Existence and generic stability conditions of equilibrium points to controlled systems for n-player multiobjective generalized games using the Kakutani–Fan–Glicksberg fixed-point theorem	1
Conveyor operations in distribution centers: modeling and optimization	1
Benchmark-based deviation and drawdown measures in portfolio optimization	1
Characterizations of the solution set for tangentially convex optimization problems	1
Extension of the value function reformulation to multiobjective bilevel optimization	1
Commutation principles for optimization problems on spectral sets in Euclidean Jordan algebras	1
On the firefighter problem with spreading vaccination for maximizing the number of saved nodes: the IP model and LP rounding algorithms	1
On a new simple algorithm to compute the resolvents	1
Regularization of vector equilibrium problems	1
Validation of scenario generation for decision-making using machine learning prediction models	1
Convergence rate of a rectangular subdivision-based optimization algorithm for smooth multivariate functions	1
Hybrid strategy in multiperiod mean-variance framework	1
Improved approximation algorithm for the parallel-machine customer order scheduling with delivery time and submodular rejection penalties	1
Upper semicontinuity of the solution map to a parametric boundary optimal control problem with unbounded constraint sets	1
Comments on finite termination of the generalized Newton method for absolute value equations	1
On the solution existence and stability of polynomial optimization problems	1
Distributionally robust joint chance-constrained support vector machines	1
Bin packing with divisible item sizes and rejection penalties	1
Minimizing the influence spread over a network through node interception	1
Local linear convergence of proximal coordinate descent algorithm	1
Practical initialization of the Nelder–Mead method for computationally expensive optimization problems	1
Robustness of solutions to the capacitated facility location problem with uncertain demand	1
A new feasible moving ball projection algorithm for pseudomonotone variational inequalities	1
Individual and cooperative portfolio optimization as linear program	1
A projected splitting method for vertical tensor complementarity problems	1
Robust inventory problem with budgeted cumulative demand uncertainty	1
Numerical solution of delay fractional optimal control problems with free terminal time	1
A matrix-free trust-region newton algorithm for convex-constrained optimization	1
General variable neighborhood search for the parallel machine scheduling problem with two common servers	1
On proper minimality in set optimization	1
Approximation algorithms for the restricted k-Chinese postman problems with penalties	1
Proximal gradient methods with inexact oracle of degree q for composite optimization	1
The truck–drone routing optimization problem: mathematical model and a VNS approach	1
On the new modulus-based matrix splitting method for linear complementarity problem of $$H_{+}$$-matrix	1
Computing tighter bounds on the n-queens constant via Newton’s method	1
Tightening discretization-based MILP models for the pooling problem using upper bounds on bilinear terms	1
Characterization of set-valued robustness via extended signed distances and separation	1
Hausdorff continuity conditions for parametric nonconvex equilibrium problems	1
Subdifferentials of convex matrix-valued functions	1
Log-domain interior-point methods for convex quadratic programming	1
Combining variable neighborhood search and machine learning to solve the vehicle routing problem with crowd-shipping	1
Merton portfolio allocation under stochastic dividends	1
Tensor denoising via dual Schatten norms	1
Proximal operator and optimality conditions for ramp loss SVM	1
Implicit steepest descent algorithm for optimization with orthogonality constraints	1
Kernel $$\ell ^1$$-norm principal component analysis for denoising	1
Optimal override policy for chemotherapy scheduling template via mixed-integer linear programming	1