Computational Optimization and Applications is a peer reviewed journal that is committed to timely publication of research and tutorial papers on the analysis and development of computational algorithms and modeling technology for optimization. Algorithms either for general classes of optimization problems or for more specific applied problems are of interest. Stochastic algorithms as well as deterministic algorithms will be considered. Papers that can provide both theoretical analysis, along with carefully designed computational experiments, are particularly welcome.Topics of interest include, but are not limited to the following:Large Scale Optimization,Unconstrained Optimization,Linear Programming,Quadratic Programming Complementarity Problems, and Variational Inequalities,Constrained Optimization,Nondifferentiable Optimization,Integer Programming,Combinatorial Optimization,Stochastic Optimization,Multiobjective Optimization,Network Optimization,Complexity Theory,Approximations and Error Analysis,Parametric Programming and Sensitivity Analysis,Parallel Computing, Distributed Computing, and Vector Processing,Software, Benchmarks, Numerical Experimentation and Comparisons,Modelling Languages and Systems for Optimization,Automatic Differentiation,Applications in Engineering, Finance, Optimal Control, Optimal Design, Operations Research,Transportation, Economics, Communications, Manufacturing, and Management Science.
《计算优化与应用》是一本同行评审期刊，致力于及时发表关于优化计算算法和建模技术的分析和开发的研究和指导论文。算法无论是一般类的优化问题或更具体的应用问题的兴趣。将考虑随机算法以及确定性算法。能提供理论分析和精心设计的计算实验的论文特别受欢迎。感兴趣的主题包括但不限于以下内容：大规模优化、无约束优化、线性规划、二次规划互补问题和变分不等式、约束优化、不可微优化、整数规划、组合优化、随机优化、多目标优化、网络优化、复杂性理论、近似和误差分析、参数规划和灵敏度分析、并行计算、分布式计算和向量处理、软件、基准测试、数值实验和比较、优化建模语言和系统、自动微分、在工程、金融、最优控制、最优设计、运筹学、运输、经济、通信、制造和管理科学中的应用。
Structured nonconvex and nonsmooth optimization: algorithms and iteration complexity analysis
来源期刊：Computational Optimization and ApplicationsDOI：10.1007/s10589-018-0034-y
Modified extragradient-like algorithms with new stepsizes for variational inequalities
来源期刊：Computational Optimization and ApplicationsDOI：10.1007/S10589-019-00093-X
A family of spectral gradient methods for optimization
来源期刊：Computational Optimization and ApplicationsDOI：10.1007/s10589-019-00107-8
Robust optimal discrete arc sizing for tree-shaped potential networks
来源期刊：Computational Optimization and ApplicationsDOI：10.1007/S10589-019-00085-X
Convergence rate for a Radau hp collocation method applied to constrained optimal control
来源期刊：Computational Optimization and ApplicationsDOI：10.1007/s10589-019-00100-1
Fast bundle-level methods for unconstrained and ball-constrained convex optimization
来源期刊：Computational Optimization and ApplicationsDOI：10.1007/S10589-019-00071-3
Direct search based on probabilistic feasible descent for bound and linearly constrained problems
来源期刊：Computational Optimization and ApplicationsDOI：10.1007/S10589-019-00062-4
Asynchronous parallel primal–dual block coordinate update methods for affinely constrained convex programs
来源期刊：Computational Optimization and ApplicationsDOI：10.1007/s10589-018-0037-8
On level regularization with normal solutions in decomposition methods for multistage stochastic programming problems
来源期刊：Computational Optimization and ApplicationsDOI：10.1007/S10589-019-00104-X
Efficient calculation of regular simplex gradients
来源期刊：Computational Optimization and ApplicationsDOI：10.1007/s10589-019-00063-3
Ordered p-median problems with neighbourhoods
来源期刊：Computational Optimization and ApplicationsDOI：10.1007/S10589-019-00077-X
A Newton-like method with mixed factorizations and cubic regularization for unconstrained minimization
来源期刊：Computational Optimization and ApplicationsDOI：10.1007/S10589-019-00089-7
Quasi-Newton approaches to interior point methods for quadratic problems
来源期刊：Computational Optimization and ApplicationsDOI：10.1007/s10589-019-00102-z
Newton’s method with feasible inexact projections for solving constrained generalized equations
来源期刊：Computational Optimization and ApplicationsDOI：10.1007/s10589-018-0040-0
A partial outer convexification approach to control transmission lines
来源期刊：Computational Optimization and ApplicationsDOI：10.1007/s10589-018-0047-6
On the optimal solution set in interval linear programming
来源期刊：Computational Optimization and ApplicationsDOI：10.1007/s10589-018-0029-8
Proximal alternating penalty algorithms for nonsmooth constrained convex optimization
来源期刊：Computational Optimization and ApplicationsDOI：10.1007/s10589-018-0033-z
Inexact alternating direction methods of multipliers for separable convex optimization
来源期刊：Computational Optimization and ApplicationsDOI：10.1007/S10589-019-00072-2
Convergence and evaluation-complexity analysis of a regularized tensor-Newton method for solving nonlinear least-squares problems
来源期刊：Computational Optimization and ApplicationsDOI：10.1007/S10589-019-00064-2
Long-step path-following algorithm for solving symmetric programming problems with nonlinear objective functions
来源期刊：Computational Optimization and ApplicationsDOI：10.1007/S10589-018-0054-7
A dense initialization for limited-memory quasi-Newton methods
来源期刊：Computational Optimization and ApplicationsDOI：10.1007/s10589-019-00112-x
Computing the spark: mixed-integer programming for the (vector) matroid girth problem
来源期刊：Computational Optimization and ApplicationsDOI：10.1007/s10589-019-00114-9
Non-stationary Douglas–Rachford and alternating direction method of multipliers: adaptive step-sizes and convergence
来源期刊：Computational Optimization and ApplicationsDOI：10.1007/s10589-019-00106-9
A new infeasible proximal bundle algorithm for nonsmooth nonconvex constrained optimization
来源期刊：Computational Optimization and ApplicationsDOI：10.1007/s10589-019-00115-8
An efficient optimization approach for best subset selection in linear regression, with application to model selection and fitting in autoregressive time-series
来源期刊：Computational Optimization and ApplicationsDOI：10.1007/s10589-019-00134-5
Two-phase semi-Lagrangian relaxation for solving the uncapacitated distribution centers location problem for B2C E-commerce
来源期刊：Computational Optimization and ApplicationsDOI：10.1007/S10589-019-00061-5
Polyhedral approximations of the semidefinite cone and their application
来源期刊：Computational Optimization and ApplicationsDOI：10.1007/s10589-020-00255-2
A sub-additive DC approach to the complementarity problem
来源期刊：Computational Optimization and ApplicationsDOI：10.1007/S10589-019-00078-W
Graph-based algorithms for the efficient solution of optimization problems involving monotone functions
来源期刊：Computational Optimization and ApplicationsDOI：10.1007/S10589-019-00070-4
A novel convex dual approach to three-dimensional assignment problem: theoretical analysis
来源期刊：Computational Optimization and ApplicationsDOI：10.1007/S10589-019-00113-W
A constraint-reduced MPC algorithm for convex quadratic programming, with a modified active set identification scheme
来源期刊：Computational Optimization and ApplicationsDOI：10.1007/S10589-019-00058-0
A simple convergence analysis of Bregman proximal gradient algorithm
来源期刊：Computational Optimization and ApplicationsDOI：10.1007/s10589-019-00092-y
On relaxation of some customized proximal point algorithms for convex minimization: from variational inequality perspective
来源期刊：Computational Optimization and ApplicationsDOI：10.1007/S10589-019-00091-Z
A new approximation hierarchy for polynomial conic optimization
来源期刊：Computational Optimization and ApplicationsDOI：10.1007/S10589-019-00066-0
An almost cyclic 2-coordinate descent method for singly linearly constrained problems
来源期刊：Computational Optimization and ApplicationsDOI：10.1007/s10589-019-00082-0
Modified inexact Levenberg–Marquardt methods for solving nonlinear least squares problems
来源期刊：Computational Optimization and ApplicationsDOI：10.1007/S10589-019-00111-Y
A globally convergent Levenberg–Marquardt method for equality-constrained optimization
来源期刊：Computational Optimization and ApplicationsDOI：10.1007/s10589-018-0038-7
A parameterized Douglas–Rachford algorithm
来源期刊：Computational Optimization and ApplicationsDOI：10.1007/S10589-019-00088-8
Interior point method on semi-definite linear complementarity problems using the Nesterov–Todd (NT) search direction: polynomial complexity and local convergence
来源期刊：Computational Optimization and ApplicationsDOI：10.1007/S10589-019-00110-Z
A framework for parallel second order incremental optimization algorithms for solving partially separable problems
来源期刊：Computational Optimization and ApplicationsDOI：10.1007/S10589-018-00057-7
Accelerating block coordinate descent methods with identification strategies
来源期刊：Computational Optimization and ApplicationsDOI：10.1007/S10589-018-00056-8
Projective method of multipliers for linearly constrained convex minimization
来源期刊：Computational Optimization and ApplicationsDOI：10.1007/s10589-019-00065-1
Correction to: The adjoint Newton algorithm for large-scale unconstrained optimization in meteorology applications
来源期刊：Computational Optimization and ApplicationsDOI：10.1007/s10589-019-00123-8
A difference-of-convex functions approach for sparse PDE optimal control problems with nonconvex costs
来源期刊：Computational Optimization and ApplicationsDOI：10.1007/S10589-019-00101-0
Maximum–norm a posteriori error estimates for an optimal control problem
来源期刊：Computational Optimization and ApplicationsDOI：10.1007/s10589-019-00090-0
PAL-Hom method for QP and an application to LP
来源期刊：Computational Optimization and ApplicationsDOI：10.1007/S10589-019-00069-X
Correction to: Convergence rate for a Radau hp collocation method applied to constrained optimal control
来源期刊：Computational Optimization and ApplicationsDOI：10.1007/S10589-019-00108-7
Additive and restricted additive Schwarz–Richardson methods for inequalities with nonlinear monotone operators
来源期刊：Computational Optimization and ApplicationsDOI：10.1007/s10589-019-00116-7
Optimized choice of parameters in interior-point methods for linear programming
来源期刊：Computational Optimization and ApplicationsDOI：10.1007/S10589-019-00079-9
