An active set method for bound-constrained optimization
IF 1.4
3区 数学
Q3 COMPUTER SCIENCE, SOFTWARE ENGINEERING
引用次数: 0
Abstract
In this article, a class of algorithms is developed for bound-constrained optimization. The new scheme uses the gradient-free line search along bent search paths. Unlike traditional algorithms for ...有约束优化的有源集方法
本文开发了一类用于约束优化的算法。新方案沿弯曲搜索路径使用无梯度线搜索。与传统算法不同的是，这种算法 ...
本文章由计算机程序翻译，如有差异，请以英文原文为准。
求助全文
约1分钟内获得全文
求助全文
来源期刊
Optimization Methods & Software
工程技术-计算机：软件工程
CiteScore
4.50
自引率
0.00%
发文量
40
审稿时长
7 months
期刊介绍：
Optimization Methods and Software
publishes refereed papers on the latest developments in the theory and realization of optimization methods, with particular emphasis on the interface between software development and algorithm design.
Topics include:
Theory, implementation and performance evaluation of algorithms and computer codes for linear, nonlinear, discrete, stochastic optimization and optimal control. This includes in particular conic, semi-definite, mixed integer, network, non-smooth, multi-objective and global optimization by deterministic or nondeterministic algorithms.
Algorithms and software for complementarity, variational inequalities and equilibrium problems, and also for solving inverse problems, systems of nonlinear equations and the numerical study of parameter dependent operators.
Various aspects of efficient and user-friendly implementations: e.g. automatic differentiation, massively parallel optimization, distributed computing, on-line algorithms, error sensitivity and validity analysis, problem scaling, stopping criteria and symbolic numeric interfaces.
Theoretical studies with clear potential for applications and successful applications of specially adapted optimization methods and software to fields like engineering, machine learning, data mining, economics, finance, biology, or medicine. These submissions should not consist solely of the straightforward use of standard optimization techniques.
求助内容：
应助结果提醒方式：
京公网安备 11010802042870号
