Optimization Letters is an international journal covering all aspects of optimization, including theory, algorithms, computational studies, and applications, and providing an outlet for rapid publication of short communications in the field. Originality, significance, quality and clarity are the essential criteria for choosing the material to be published.Optimization Letters has been expanding in all directions at an astonishing rate during the last few decades. New algorithmic and theoretical techniques have been developed, the diffusion into other disciplines has proceeded at a rapid pace, and our knowledge of all aspects of the field has grown even more profound. At the same time one of the most striking trends in optimization is the constantly increasing interdisciplinary nature of the field.Optimization Letters aims to communicate in a timely fashion all recent developments in optimization with concise short articles (limited to a total of ten journal pages). Such concise articles will be easily accessible by readers working in any aspects of optimization and wish to be informed of recent developments.
《优化快报》是一本国际期刊，涵盖了优化的各个方面，包括理论、算法、计算研究和应用，并为该领域的短期通信提供了快速出版渠道。原创性、重要性、质量和清晰度是选择出版材料的基本标准。在过去的几十年里， 《优化快报》以惊人的速度向各个方向发展。新的算法和理论技术得到了发展，向其他学科的扩散也在迅速进行，我们对该领域各个方面的知识也变得更加深刻。同时，优化领域最引人注目的趋势之一是该领域不断增加的跨学科性质。优化快报旨在以简明扼要的短文及时交流优化领域的所有最新进展（限于总共10页期刊）。这样的简明文章将很容易获得的读者工作在任何方面的优化和希望被告知最近的发展。
“Active-set complexity” of proximal gradient: How long does it take to find the sparsity pattern?
来源期刊：Optimization LettersDOI：10.1007/s11590-018-1325-z
Stochastic $$R_0$$R0 tensors to stochastic tensor complementarity problems
来源期刊：Optimization LettersDOI：10.1007/s11590-018-1362-7
Global optimality conditions and exact penalization
来源期刊：Optimization LettersDOI：10.1007/s11590-017-1214-x
Mixed-integer programming formulation of a data-driven solver in computational elasticity
来源期刊：Optimization LettersDOI：10.1007/s11590-019-01409-w
On the linear convergence of the stochastic gradient method with constant step-size
来源期刊：Optimization LettersDOI：10.1007/S11590-018-1331-1
Disciplined geometric programming
来源期刊：Optimization LettersDOI：10.1007/S11590-019-01422-Z
An equivalent tensor equation to the tensor complementarity problem with positive semi-definite Z-tensor
来源期刊：Optimization LettersDOI：10.1007/S11590-018-1268-4
Markov inequalities, Dubiner distance, norming meshes and polynomial optimization on convex bodies
来源期刊：Optimization LettersDOI：10.1007/S11590-018-1377-0
Proper initialization is crucial for the Nelder–Mead simplex search
来源期刊：Optimization LettersDOI：10.1007/S11590-018-1284-4
A modulus-based nonsmooth Newton’s method for solving horizontal linear complementarity problems
来源期刊：Optimization LettersDOI：10.1007/s11590-019-01515-9
A 5-approximation algorithm for the k-prize-collecting Steiner tree problem
来源期刊：Optimization LettersDOI：10.1007/s11590-017-1135-8
Packing a fixed number of identical circles in a circular container with circular prohibited areas
来源期刊：Optimization LettersDOI：10.1007/s11590-018-1351-x
The linearized alternating direction method of multipliers for sparse group LAD model
来源期刊：Optimization LettersDOI：10.1007/s11590-017-1180-3
Path planning for unmanned vehicles with localization constraints
来源期刊：Optimization LettersDOI：10.1007/s11590-019-01435-8
A full-Newton step feasible interior-point algorithm for monotone horizontal linear complementarity problems
来源期刊：Optimization LettersDOI：10.1007/S11590-018-1328-9
Essential stability of cooperative equilibria for population games
来源期刊：Optimization LettersDOI：10.1007/S11590-018-1303-5
Identification of the thermal conductivity coefficient in two dimension case
来源期刊：Optimization LettersDOI：10.1007/S11590-018-1304-4
Enhanced basic procedures for the projection and rescaling algorithm
来源期刊：Optimization LettersDOI：10.1007/s11590-019-01390-4
Algorithms for the generalized independent set problem based on a quadratic optimization approach
来源期刊：Optimization LettersDOI：10.1007/S11590-019-01418-9
A polynomial-time algorithm for finding critical nodes in bipartite permutation graphs
来源期刊：Optimization LettersDOI：10.1007/S11590-018-1371-6
Numeric algorithm for optimal impulsive control based on feedback maximum principle
来源期刊：Optimization LettersDOI：10.1007/S11590-018-1344-9
On approximate solutions of nondifferentiable vector optimization problems with cone-convex objectives
来源期刊：Optimization LettersDOI：10.1007/S11590-018-1292-4
Positive bases with maximal cosine measure
来源期刊：Optimization LettersDOI：10.1007/S11590-018-1334-Y
Sequential parametric convex approximation algorithm for bilinear matrix inequality problem
来源期刊：Optimization LettersDOI：10.1007/S11590-018-1274-6
Distributionally robust $$L_1$$L1-estimation in multiple linear regression
来源期刊：Optimization LettersDOI：10.1007/S11590-018-1299-X
Dynamic improvements of static surrogates in direct search optimization
来源期刊：Optimization LettersDOI：10.1007/S11590-019-01452-7
A simultaneous diagonalization based SOCP relaxation for convex quadratic programs with linear complementarity constraints
来源期刊：Optimization LettersDOI：10.1007/S11590-018-1337-8
Matrices with lexicographically-ordered rows
来源期刊：Optimization LettersDOI：10.1007/s11590-018-1369-0
The probabilistic and reliable connected power dominating set problems
来源期刊：Optimization LettersDOI：10.1007/S11590-018-1339-6
On matrix exponentials and their approximations related to optimization on the Stiefel manifold
来源期刊：Optimization LettersDOI：10.1007/S11590-018-1341-Z
On global minimizers of quadratic functions with cubic regularization
来源期刊：Optimization LettersDOI：10.1007/s11590-018-1316-0
A limiting subdifferential version of Ekeland’s variational principle in set optimization
来源期刊：Optimization LettersDOI：10.1007/s11590-019-01489-8
An approximation algorithm for the dynamic facility location problem with outliers
来源期刊：Optimization LettersDOI：10.1007/s11590-017-1153-6
Inventory replenishment decisions model for the supplier selection problem facing low perfect rate situations
来源期刊：Optimization LettersDOI：10.1007/s11590-019-01510-0
A descent method for least absolute deviation lasso problems
来源期刊：Optimization LettersDOI：10.1007/s11590-017-1157-2
Optimal road maintenance investment in traffic networks with random demands
来源期刊：Optimization LettersDOI：10.1007/s11590-019-01493-y
A matheuristic for the 0–1 generalized quadratic multiple knapsack problem
来源期刊：Optimization LettersDOI：10.1007/s11590-019-01503-z
Apriori estimates for fractional diffusion equation
来源期刊：Optimization LettersDOI：10.1007/S11590-018-1332-0
Acceleration procedure for special classes of multi-extremal problems
来源期刊：Optimization LettersDOI：10.1007/S11590-018-1355-6
Optimality conditions for $${\\varvec{\\epsilon }}$$ϵ-quasi solutions of optimization problems via $${\\varvec{\\epsilon }}$$ϵ-upper convexificators with applications
来源期刊：Optimization LettersDOI：10.1007/S11590-018-1287-1
A branch and cut algorithm for the capacitated star–star telecommunication network problem
来源期刊：Optimization LettersDOI：10.1007/S11590-018-1282-6
Gradient method with multiple damping for large-scale unconstrained optimization
来源期刊：Optimization LettersDOI：10.1007/s11590-018-1247-9
Minimum cost multicommodity network flow problem in time-varying networks: by decomposition principle
来源期刊：Optimization LettersDOI：10.1007/s11590-019-01519-5
The modified second APG method for DC optimization problems
来源期刊：Optimization LettersDOI：10.1007/S11590-018-1280-8
Optimal control of implicit control systems and its applications to differential complementarity problems
来源期刊：Optimization LettersDOI：10.1007/s11590-017-1221-y
Program strategies for a dynamic game in the space of measures
来源期刊：Optimization LettersDOI：10.1007/S11590-018-1318-Y
Preface: Special issue dedicated to the tenth international conference on optimization techniques and applications (ICOTA 10)
来源期刊：Optimization LettersDOI：10.1007/s11590-019-01410-3
A new tool for the investigation of extended real-valued functions
来源期刊：Optimization LettersDOI：10.1007/S11590-018-1370-7
LMI and SDP technique for stability analysis of nonlinear delay systems subject to constraints
来源期刊：Optimization LettersDOI：10.1007/S11590-018-1352-9
Quasi \\(\\epsilon \\)-solutions in a semi-infinite programming problem with locally Lipschitz data
来源期刊：Optimization LettersDOI：10.1007/S11590-019-01457-2
