Optimization Letters

Article	Citations
Dynamic resource allocation and collaborative scheduling in R&D and manufacturing processes of high-end equipment with budget constraint	30
Connectedness of the solution sets in generalized semi-infinite set optimization	18
Matching orderable and separable hypergraphs	16
A fresh geometrical look at the general S-procedure	15
A Riemannian subspace BFGS trust region method	13
Integrated optimization of design and production process with personalization level of products	12
Constrained many-to-many point matching in two dimensions	12
An approximation algorithm for the k-generalized Steiner forest problem	12
A unified analysis of convex and non-convex $$\ell _p$$-ball projection problems	12
Review on the book Anatoly Zhigljavsky, Antanas Žilinskas “Bayesian and High-Dimensional Global Optimization”, SpringerBriefs in Optimization, Springer, 2021	11
Primal-dual subgradient method for constrained convex optimization problems	11
Decentralized scheduling with precedence constraints	10
A block coordinate descent method for sensor network localization	10
On unique recovery of finite-valued integer signals and admissible lattices of sparse hypercubes	10
A link between the steepest descent method and fixed-point iterations	10
The truck–drone routing optimization problem: mathematical model and a VNS approach	9
A low-rank spectral method for learning Markov models	9
The multi-depot k-traveling repairman problem	8
Guillotine cutting is asymptotically optimal for packing consecutive squares	8
Dependence in constrained Bayesian optimization	8
Tight bounds on Lyapunov rank	8
Cooperative congestion games: existence of a Nash-stable coalition structure	8
Wildfire burn scar encapsulation	8
A novel one-parameter filled function method with an application to pathological analysis	8
Nested-solution facility location models	8

Equilibrium uniqueness in aggregative games: very practical conditions	7
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	7
A note on approximate proper efficiency in linear fractional vector optimization	7
A strict complementarity approach to error bound and sensitivity of solution of conic programs	7
Scheduling jobs with general linear deterioration to minimize total weighted number of late jobs	7
Computing tighter bounds on the n-queens constant via Newton’s method	6
Feature selection in machine learning via variable neighborhood search	6
Stochastic proximal subgradient descent oscillates in the vicinity of its accumulation set	6
Polyhedral results and stronger Lagrangean bounds for stable spanning trees	6
On the rate of convergence of alternating minimization for non-smooth non-strongly convex optimization in Banach spaces	6
Optimality conditions for homogeneous polynomial optimization on the unit sphere	6
A polytime preprocess algorithm for the maximum independent set problem	6
The set partitioning problem in a quantum context	6
A distributional Farkas’ lemma and moment optimization problems with no-gap dual semi-definite programs	6
Online NDP-constraint scheduling of jobs with delivery times or weights	6
Interior-point algorithm for symmetric cone horizontal linear complementarity problems based on a new class of algebraically equivalent transformations	6
Checking weak and strong optimality of the solution to interval convex quadratic programming in a general form	6
Strong convergence of inertial subgradient extragradient algorithm for solving pseudomonotone equilibrium problems	6
Constrained optimization based adversarial example generation for transfer attacks in network intrusion detection systems	5
Single machine scheduling with maintenance and position-based job eligibility constraints for battery manufacturing	5
Tensor denoising via dual Schatten norms	5
An uncertain minimization problem: robust optimization versus optimization of robustness	5
Boundedness of the inverse of a regularized Jacobian matrix in constrained optimization and applications	5
Kernel $$\ell ^1$$-norm principal component analysis for denoising	5
Almost sure convergence of stochastic composite objective mirror descent for non-convex non-smooth optimization	5
Convergence analysis of generalized ADMM with majorization for linearly constrained composite convex optimization	5
A step-truncated method in a wide neighborhood interior-point algorithm for linear programming	5
Nonsmooth rank-one matrix factorization landscape	5
Efficient compact linear programs for network revenue management	5
Comparing voting districts with uncertain data envelopment analysis	5
On efficient algorithms for bottleneck path problems with many sources	5
Minimizing a complex quadratic fractional optimization problem with two second-order cone constraints	5
Zeroth-order methods for noisy Hölder-gradient functions	5
On the relation between affinely adjustable robust linear complementarity and mixed-integer linear feasibility problems	5
Shortest path network problems with stochastic arc weights	5
A class of new modulus-based matrix splitting methods for linear complementarity problem	4
Subdifferentials of convex matrix-valued functions	4
Optimization of boundary value problems for higher order differential inclusions and duality	4
Regularization of vector equilibrium problems	4
Study on proportionate flowshop scheduling with due-date assignment and position-dependent weights	4
On sparse solution of tensor complementarity problem	4
Theoretical analysis of integer programming models for the two-dimensional two-staged knapsack problem	4
Optimal externalities in a parallel transportation network	4
Method for finding solution to “quasidifferentiable” differential inclusion	4
A new approach to the multiple obnoxious facility location problem based on combinatorial and continuous tools	4
Designing an optimal contract mechanism in a cellulosic biofuel enterprise	4
Improved approximation algorithm for the parallel-machine customer order scheduling with delivery time and submodular rejection penalties	4
Decentralized bilevel optimization	4
The projected splitting iterative methods based on tensor splitting and its majorization matrix splitting for the tensor complementarity problem	4
Convergence of Lasserre’s hierarchy: the general case	4

A unified approach to approximate partial, prize-collecting, and budgeted sweep cover problems	4
Efficiently solving the thief orienteering problem with a max–min ant colony optimization approach	4
Minimizing the influence spread over a network through node interception	4
General variable neighborhood search approach to group steiner tree problem	4
On lower and upper bounds for single machine parallel batch scheduling	4
Expected value based optimal control for discrete-time stochastic noncausal systems	4
t-Linearization for the maximum diversity problem	4
A modification of the forward–backward splitting method for monotone inclusions	4
On an effective approach in shape optimization problem for Stokes equation	4
Convergence rate of a rectangular subdivision-based optimization algorithm for smooth multivariate functions	4
On partial descriptions of König graphs for odd paths and all their spanning supergraphs	3
On quantitative stability in infinite-dimensional optimization under uncertainty	3
Uniqueness of solutions in multivariate Chebyshev approximation problems	3
Streaming algorithms for maximizing the difference of submodular functions and the sum of submodular and supermodular functions	3
Approximation algorithms for the k-depots Hamiltonian path problem	3
Individual and cooperative portfolio optimization as linear program	3
Solving an inverse elliptic coefficient problem by convex non-linear semidefinite programming	3
Optimal control for production inventory of uncertain random system with jump and deteriorating items	3
Superiorization and bounded perturbation resilience of a gradient projection algorithm solving the convex minimization problem	3
Optimal override policy for chemotherapy scheduling template via mixed-integer linear programming	3
Linear convergence rate analysis of a class of exact first-order distributed methods for weight-balanced time-varying networks and uncoordinated step sizes	3
Non-dominated solutions for time series learning and forecasting	3
The rendezvous vehicle routing problem	3
A generalized Frank–Wolfe method with “dual averaging” for strongly convex composite optimization	3
Comments on finite termination of the generalized Newton method for absolute value equations	3
On ambiguity-averse market equilibrium	3
Gain-optimized spectral distortions for pronunciation training	3
An exact method for optimizing a quadratic function over the efficient set of multiobjective integer linear fractional program	3
Parametric set valued equilibrium problems under K-convexity type conditions	3
Optimal TSP tour length estimation using Sammon maps	3
On refinement strategies for solving $${\textsc {MINLP}\mathrm{s}}$$  by piecewise linear relaxations: a generalized red refinement	3
Linear-size formulations for connected planar graph partitioning and political districting	3
Solving SDP relaxations of Max-Cut problem with large number of hypermetric inequalities by L-BFGS-B	3
Review on the book Yaroslav D. Sergeyev, Renato De Leone (Eds.) Numerical infinities and infinitesimals in optimization	3
On properties of univariate max functions at local maximizers	3
Pooling adjacent violators under interval constraints	3
The quasidifferential descent method in a control problem with nonsmooth objective functional	3
A clustering heuristic to improve a derivative-free algorithm for nonsmooth optimization	3
On the superiority of PGMs to PDCAs in nonsmooth nonconvex sparse regression	3
Convergence analysis of block majorize-minimize subspace approach	3
Stochastic single machine scheduling with time-dependent deterioration or position-dependent learning effect	3
A polynomial-time algorithm for a nonconvex chance-constrained program under the normal approximation	3
A simplified treatment of Ramana’s exact dual for semidefinite programming	3
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	3
A new polynomially solvable class of quadratic optimization problems with box constraints	2
Variable and constraint reduction techniques for the temporal bin packing problem with fire-ups	2
Budget-cut: introduction to a budget based cutting-plane algorithm for capacity expansion models	2
An inventory model for multiple items assuming time-varying demands and limited storage	2
Dual and generalized dual cones in Banach spaces	2
On complexity constants of linear and quadratic models for derivative-free trust-region algorithms	2
An improvement of the Goldstein line search	2
A note on Anti-Nash equilibrium for bimatrix game	2
Merton portfolio allocation under stochastic dividends	2
A local search algorithm for the k-path partition problem	2
Convergence analysis of the DFP algorithm for unconstrained optimization problems on Riemannian manifolds	2
Characterization of unique solvability of absolute value equations: an overview, extensions, and future directions	2
Pareto efficiency without topology	2
Duality in the problems of optimal control described by Darboux-type differential inclusions	2
A fast primal-dual algorithm via dynamical system with variable mass for linearly constrained convex optimization	2
Implicit steepest descent algorithm for optimization with orthogonality constraints	2
Using regression models to understand the impact of route-length variability in practical vehicle routing	2
Optimal step length for the maximal decrease of a self-concordant function by the Newton method	2
Log-domain interior-point methods for convex quadratic programming	2
A general VNS for the multi-depot open vehicle routing problem with time windows	2
Convergence rate of projected subgradient method with time-varying step-sizes	2
Bin packing with divisible item sizes and rejection penalties	2
Practical initialization of the Nelder–Mead method for computationally expensive optimization problems	2
Affine optimal k-proper connected edge colorings	2
Improved exploitation of higher order smoothness in derivative-free optimization	2
The metric projection over a polyhedral set through the relative interiors of its faces	2
A matrix-free trust-region newton algorithm for convex-constrained optimization	2
Connectedness properties of the efficient sets and the nondominated sets to vector optimization problems	2
A new Bregman projection method with a self-adaptive process for solving variational inequality problem in reflexive Banach spaces	2
Convex semi-infinite programming algorithms with inexact separation oracles	2
A note on study on proportionate flowshop scheduling with due-date assignment and position-dependent weights	2
An improved algorithm for parallel machine scheduling under additional resource constraints	2
Regularized quasi-monotone method for stochastic optimization	2
On the least square prenucleolus for games with externalities	2
Spatial price equilibrium networks with flow-dependent arc multipliers	2
A discrete competitive facility location model with proportional and binary rules sequentially applied	2

On the proximal point algorithm and its Halpern-type variant for generalized monotone operators in Hilbert space	2
On maximal and minimal elements for sets with respect to cones	2
Minimum budget for misinformation detection in online social networks with provable guarantees	2
On penalized reload cost path, walk, tour and maximum flow: hardness and approximation	2
Using neural networks to solve linear bilevel problems with unknown lower level	2
The semiproximal SVM approach for multiple instance learning: a kernel-based computational study	2
A New full-newton step infeasible interior-point method for $$P_*(\kappa )$$-linear Complementarity problem	2
Linearized formulations for failure aware barter exchange	2
A note on the implications of approximate submodularity in discrete optimization	2
Lower bounds of the solution set of the polynomial complementarity problem	2
Stochastic programming with primal–dual dynamics: a mean-field game approach	2
Circumcentric directions of cones	2