Optimization Letters

Article	Citations
A fresh geometrical look at the general S-procedure	33
Primal-dual subgradient method for constrained convex optimization problems	20
A note on approximate proper efficiency in linear fractional vector optimization	19
On unique recovery of finite-valued integer signals and admissible lattices of sparse hypercubes	16
On sparse solution of tensor complementarity problem	15
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	14
A novel one-parameter filled function method with an application to pathological analysis	13
A polytime preprocess algorithm for the maximum independent set problem	12
Online NDP-constraint scheduling of jobs with delivery times or weights	12
The set partitioning problem in a quantum context	11
On efficient algorithms for bottleneck path problems with many sources	10
Constrained optimization based adversarial example generation for transfer attacks in network intrusion detection systems	10
A distributional Farkas’ lemma and moment optimization problems with no-gap dual semi-definite programs	10
Minimizing a complex quadratic fractional optimization problem with two second-order cone constraints	10
Improved approximation algorithm for the parallel-machine customer order scheduling with delivery time and submodular rejection penalties	9
Characterization of set-valued robustness via extended signed distances and separation	9
The projected splitting iterative methods based on tensor splitting and its majorization matrix splitting for the tensor complementarity problem	9
A modification of the forward–backward splitting method for monotone inclusions	9
Tight bounds on Lyapunov rank	8
Designing an optimal contract mechanism in a cellulosic biofuel enterprise	8
On the rate of convergence of alternating minimization for non-smooth non-strongly convex optimization in Banach spaces	8
Nested-solution facility location models	8
Shortest path network problems with stochastic arc weights	8
On lower and upper bounds for single machine parallel batch scheduling	8
Strong convergence of inertial subgradient extragradient algorithm for solving pseudomonotone equilibrium problems	8

Review on the book Anatoly Zhigljavsky, Antanas Žilinskas “Bayesian and High-Dimensional Global Optimization”, SpringerBriefs in Optimization, Springer, 2021	8
A low-rank spectral method for learning Markov models	7
Nonsmooth rank-one matrix factorization landscape	7
A step-truncated method in a wide neighborhood interior-point algorithm for linear programming	7
A unified analysis of convex and non-convex $$\ell _p$$-ball projection problems	7
Computing tighter bounds on the n-queens constant via Newton’s method	7
Matching orderable and separable hypergraphs	7
A strict complementarity approach to error bound and sensitivity of solution of conic programs	7
Efficient compact linear programs for network revenue management	7
Connectedness of the solution sets in generalized semi-infinite set optimization	7
Optimization of boundary value problems for higher order differential inclusions and duality	7
Convergence rate of a rectangular subdivision-based optimization algorithm for smooth multivariate functions	7
Zeroth-order methods for noisy Hölder-gradient functions	7
Interior-point algorithm for symmetric cone horizontal linear complementarity problems based on a new class of algebraically equivalent transformations	7
Optimality conditions for homogeneous polynomial optimization on the unit sphere	7
Feature selection in machine learning via variable neighborhood search	6
Checking weak and strong optimality of the solution to interval convex quadratic programming in a general form	6
The truck–drone routing optimization problem: mathematical model and a VNS approach	6
On the relation between affinely adjustable robust linear complementarity and mixed-integer linear feasibility problems	6
Minimizing the influence spread over a network through node interception	6
On an effective approach in shape optimization problem for Stokes equation	6
Comparing voting districts with uncertain data envelopment analysis	6
Convergence analysis of generalized ADMM with majorization for linearly constrained composite convex optimization	6
Subdifferentials of convex matrix-valued functions	6
Dependence in constrained Bayesian optimization	6
A new approach to the multiple obnoxious facility location problem based on combinatorial and continuous tools	6
Decentralized bilevel optimization	6
General variable neighborhood search approach to group steiner tree problem	6
Almost sure convergence of stochastic composite objective mirror descent for non-convex non-smooth optimization	5
Regularization of vector equilibrium problems	5
Kernel $$\ell ^1$$-norm principal component analysis for denoising	5
Theoretical analysis of integer programming models for the two-dimensional two-staged knapsack problem	5
An uncertain minimization problem: robust optimization versus optimization of robustness	5
Tensor denoising via dual Schatten norms	5
Integrated optimization of design and production process with personalization level of products	5
A Riemannian subspace BFGS trust region method	5
A unified approach to approximate partial, prize-collecting, and budgeted sweep cover problems	5
Polyhedral results and stronger Lagrangean bounds for stable spanning trees	5
Method for finding solution to “quasidifferentiable” differential inclusion	5
Single machine scheduling with maintenance and position-based job eligibility constraints for battery manufacturing	5
Guillotine cutting is asymptotically optimal for packing consecutive squares	4
Decentralized scheduling with precedence constraints	4
Cooperative congestion games: existence of a Nash-stable coalition structure	4
A deep reinforcement learning framework for solving two-stage stochastic programs	4
Optimal externalities in a parallel transportation network	4
Convex semi-infinite programming algorithms with inexact separation oracles	4
Review on the book Yaroslav D. Sergeyev, Renato De Leone (Eds.) Numerical infinities and infinitesimals in optimization	4
Wildfire burn scar encapsulation	4
A link between the steepest descent method and fixed-point iterations	4
A block coordinate descent method for sensor network localization	4

Stochastic proximal subgradient descent oscillates in the vicinity of its accumulation set	4
Scheduling jobs with general linear deterioration to minimize total weighted number of late jobs	4
Efficiently solving the thief orienteering problem with a max–min ant colony optimization approach	4
Practical algorithm for minimum cost submodular cover problem with performance guarantees	4
Expected value based optimal control for discrete-time stochastic noncausal systems	4
Equilibrium uniqueness in aggregative games: very practical conditions	4
The multi-depot k-traveling repairman problem	4
Constrained many-to-many point matching in two dimensions	4
Dynamic resource allocation and collaborative scheduling in R&D and manufacturing processes of high-end equipment with budget constraint	4
A class of new modulus-based matrix splitting methods for linear complementarity problem	4
A necessary condition for the guarantee of the superiorization method	4
A note: on the two-stage flowshop with dedicated machines to minimize total load	4
Boundedness of the inverse of a regularized Jacobian matrix in constrained optimization and applications	4
Minimum budget for misinformation detection in online social networks with provable guarantees	3
Dual and generalized dual cones in Banach spaces	3
A note on study on proportionate flowshop scheduling with due-date assignment and position-dependent weights	3
Lower bounds of the solution set of the polynomial complementarity problem	3
On ambiguity-averse market equilibrium	3
Regularized quasi-monotone method for stochastic optimization	3
An improved algorithm for parallel machine scheduling under additional resource constraints	3
Implicit steepest descent algorithm for optimization with orthogonality constraints	3
On partial descriptions of König graphs for odd paths and all their spanning supergraphs	3
A note on Anti-Nash equilibrium for bimatrix game	3
Circumcentric directions of cones	3
Variable and constraint reduction techniques for the temporal bin packing problem with fire-ups	3
Optimal step length for the maximal decrease of a self-concordant function by the Newton method	3
The metric projection over a polyhedral set through the relative interiors of its faces	3
Correction to: A no-delay single machine scheduling problem to minimize total weighted early and late work	3
Budget-cut: introduction to a budget based cutting-plane algorithm for capacity expansion models	3
Robustness of solutions to the capacitated facility location problem with uncertain demand	3
Stochastic single machine scheduling with time-dependent deterioration or position-dependent learning effect	3
Pareto efficiency without topology	3
A polynomial-time algorithm for a nonconvex chance-constrained program under the normal approximation	3
Optimal override policy for chemotherapy scheduling template via mixed-integer linear programming	3
Improved exploitation of higher order smoothness in derivative-free optimization	3
Using regression models to understand the impact of route-length variability in practical vehicle routing	3
An exact method for optimizing a quadratic function over the efficient set of multiobjective integer linear fractional program	3
On refinement strategies for solving $${\textsc {MINLP}\mathrm{s}}$$  by piecewise linear relaxations: a generalized red refinement	3
Multi-product Newsvendor problem with dynamic pricing: a decision interpolation approximation	3
On maximal and minimal elements for sets with respect to cones	3
Bin packing with divisible item sizes and rejection penalties	3
Convergence of Lasserre’s hierarchy: the general case	3
A generalized Frank–Wolfe method with “dual averaging” for strongly convex composite optimization	3
Log-domain interior-point methods for convex quadratic programming	3
A discrete competitive facility location model with proportional and binary rules sequentially applied	3
Optimal TSP tour length estimation using Sammon maps	3
Approximation algorithms for the k-depots Hamiltonian path problem	3
On properties of univariate max functions at local maximizers	3
Connectedness properties of the efficient sets and the nondominated sets to vector optimization problems	3
Gain-optimized spectral distortions for pronunciation training	3
Practical initialization of the Nelder–Mead method for computationally expensive optimization problems	3
Spatial price equilibrium networks with flow-dependent arc multipliers	3
A general VNS for the multi-depot open vehicle routing problem with time windows	2
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	2
Merton portfolio allocation under stochastic dividends	2
An inventory model for multiple items assuming time-varying demands and limited storage	2
Learning to project in a criterion space search algorithm: an application to multi-objective binary linear programming	2
On the proximal point algorithm and its Halpern-type variant for generalized monotone operators in Hilbert space	2
Convergence analysis of block majorize-minimize subspace approach	2
Convergence rate of projected subgradient method with time-varying step-sizes	2
Uniqueness of solutions in multivariate Chebyshev approximation problems	2
A fast primal-dual algorithm via dynamical system with variable mass for linearly constrained convex optimization	2
An improvement of the Goldstein line search	2
Linear convergence rate analysis of a class of exact first-order distributed methods for weight-balanced time-varying networks and uncoordinated step sizes	2
Pooling adjacent violators under interval constraints	2
Parametric set valued equilibrium problems under K-convexity type conditions	2
Characterization of unique solvability of absolute value equations: an overview, extensions, and future directions	2
Streaming algorithms for maximizing the difference of submodular functions and the sum of submodular and supermodular functions	2
A matrix-free trust-region newton algorithm for convex-constrained optimization	2
A generalized combination of parallel machine scheduling and path	2
Duality for convex infinite optimization on linear spaces	2
Solving an inverse elliptic coefficient problem by convex non-linear semidefinite programming	2
On complexity constants of linear and quadratic models for derivative-free trust-region algorithms	2
A simplified treatment of Ramana’s exact dual for semidefinite programming	2
Comments on finite termination of the generalized Newton method for absolute value equations	2
Optimal control for production inventory of uncertain random system with jump and deteriorating items	2
A New full-newton step infeasible interior-point method for $$P_*(\kappa )$$-linear Complementarity problem	2
On penalized reload cost path, walk, tour and maximum flow: hardness and approximation	2
A local search algorithm for the k-path partition problem	2
Individual and cooperative portfolio optimization as linear program	2

Duality in the problems of optimal control described by Darboux-type differential inclusions	2
Solving SDP relaxations of Max-Cut problem with large number of hypermetric inequalities by L-BFGS-B	2
A new Bregman projection method with a self-adaptive process for solving variational inequality problem in reflexive Banach spaces	2
Linearized formulations for failure aware barter exchange	2
On optimal universal first-order methods for minimizing heterogeneous sums	2
Superiorization and bounded perturbation resilience of a gradient projection algorithm solving the convex minimization problem	2
Stochastic programming with primal–dual dynamics: a mean-field game approach	2
A new convergence rate of the steepest descent regarding the Euclidean norm	2
A note on the implications of approximate submodularity in discrete optimization	2
On the least square prenucleolus for games with externalities	2
Affine optimal k-proper connected edge colorings	2
Linear-size formulations for connected planar graph partitioning and political districting	2
A clustering heuristic to improve a derivative-free algorithm for nonsmooth optimization	2
The rendezvous vehicle routing problem	2
Convergence analysis of the DFP algorithm for unconstrained optimization problems on Riemannian manifolds	2
Using neural networks to solve linear bilevel problems with unknown lower level	2
Correction to: Two‑machine flow shop scheduling with convex resource consumption functions	1
Well-posedness for the split equilibrium problem	1
Hybrid strategy in multiperiod mean-variance framework	1
Scheduling with generalized and periodic due dates under single- and two-machine environments	1
Variable smoothing incremental aggregated gradient method for nonsmooth nonconvex regularized optimization	1
Finding optimal solutions to several gray pattern instances	1
An approximation algorithm for k-level squared metric facility location problem with outliers	1
Characterizations of the solution set for tangentially convex optimization problems	1
Correction to: Duality for quasiconvex minimization over closed convex cones	1
A dual scheme for solving linear countable semi-infinite fractional programming problems	1
A computational study on QP problems with general linear constraints	1
A robust model for the lot-sizing problem with uncertain demands	1
Stochastic saddle-point optimization for the Wasserstein barycenter problem	1
Shrinking approximants for fixed point problem and generalized split null point problem in Hilbert spaces	1
Are weaker stationarity concepts of stochastic MPCC problems significant in absence of SMPCC-LICQ?	1
A variable neighborhood search algorithm for a PET/CT examination scheduling problem considering multi-stage process and deteriorating effect	1
Economic lot-sizing problem with remanufacturing option: complexity and algorithms	1
Distributionally-robust machine learning using locally differentially-private data	1
Convergence rate analysis of proximal iteratively reweighted $$\ell _1$$ methods for $$\ell _p$$ regularization problems	1
Extending oscars-ii to generally constrained global optimization	1
Linear convergence rate analysis of proximal generalized ADMM for convex composite programming	1
A decomposition algorithm for distributionally robust chance-constrained programs with polyhedral ambiguity set	1
Two-machine job shop scheduling with optional job rejection	1
Robust satisficing model with Sinkhorn distance	1
The assignment problem revisited	1
The single train shortest route problem in a railyard	1
Upper semicontinuity of the solution map to a parametric boundary optimal control problem with unbounded constraint sets	1
Triply stochastic sequential assignment problem with the uncertainty in worker survival	1
On linear algebraic algorithms for the subgraph matching problem and its variants	1
On the weak and strong convergence of modified forward-backward-half-forward splitting methods	1
Cooperation in combinatorial search	1
Single machine batch scheduling with non-increasing time slot costs	1
Extremely non-convex optimization problems: the case of the multiple obnoxious facilities location	1
Inertial projection and contraction methods for split feasibility problem applied to compressed sensing and image restoration	1
An intractability result for the vertex 3-colourability problem	1
Special issue: Optimization in natural resources, environment and sustainability	1
On proper minimality in set optimization	1
Optimization models for integrated biorefinery operations	1
A global optimization approach to Berge equilibrium based on a regularized function	1
A conditional-logic interpretation for Miller–Tucker–Zemlin inequalities and extensions	1
Sparse regression over clusters: SparClur	1
Proximal gradient methods with inexact oracle of degree q for composite optimization	1
The multilevel facility location and pricing problems: the computational complexity and the stability analysis	1
Convergence rates of RLT and Lasserre-type hierarchies for the generalized moment problem over the simplex and the sphere	1
Quantitative inconsistent feasibility for averaged mappings	1
The subdifferential descent method in a nonsmooth variational problem	1
Solution polishing via path relinking for continuous black-box optimization	1
A linearized method for solving tensor complementarity problems with implicit Z-tensors	1
On the linear convergence rate of Riemannian proximal gradient method	1
Buffered and Reduced Multidimensional Distribution Functions and Their Application in Optimization	1
Strengthened MIP formulations for the liver region redesign models of Akshat et al.	1
A limited memory subspace minimization conjugate gradient algorithm for unconstrained optimization	1
Higher-order optimality conditions of robust Benson proper efficient solutions in uncertain vector optimization problems	1
An FPTAS for two performance measures for the relocation scheduling problem subject to fixed processing sequences	1
New second-order limiting directional derivatives and C$$^1$$-optimization	1
The operator splitting schemes revisited: primal-dual gap and degeneracy reduction by a unified analysis	1
A unified convergence rate analysis of the accelerated smoothed gap reduction algorithm	1
The semiproximal SVM approach for multiple instance learning: a kernel-based computational study	1
A Non-polyhedral extension of the Frank–Wolfe theorem to cubic optimization	1
Approximation algorithms for the restricted k-Chinese postman problems with penalties	1
Modeling the spread of infectious diseases through influence maximization	1
The partially symmetric rank-1 approximation of fourth-order partially symmetric tensors	1
Robust optimality, duality and saddle points for multiobjective fractional semi-infinite optimization with uncertain data	1
Conditions for linear convergence of the gradient method for non-convex optimization	1
Solution methodologies for minimizing a sum of pointwise minima of two functions	1
On the exact solution of the multi-depot open vehicle routing problem	1
A general variable neighborhood search approach for the minimum load coloring problem	1
QN-tensor and tensor complementarity problem	1
Minimizing the number of tardy jobs with generalized due-dates and position-dependent processing times	1
The leave-worst-k-out criterion for cross validation	1
Hausdorff continuity of solution maps to equilibrium problems via the oriented distance function	1
Numerical solution of delay fractional optimal control problems with free terminal time	1
An upper bound on the Hausdorff distance between a Pareto set and its discretization in bi-objective convex quadratic optimization	1
Scheduling coupled tasks on parallel identical machines	1
Special issue on advances in computational optimization and their modern applications	1
Benchmark-based deviation and drawdown measures in portfolio optimization	1
Some notes on the solvability conditions for absolute value equations	1