共查询到20条相似文献,搜索用时 62 毫秒
1.
2.
3.
4.
极小化加权完工时间和的Flowshop问题的算法 总被引:3,自引:0,他引:3
本文讨论了极小化加权完工时间和的Flowshop问题.我们给出了一个最坏情况误差界为m的启发式算法,对于m=2的情况,如果工件具有一致权因子,即pi相似文献
5.
求解病态问题的一种改进的Tikhonov正则化:⑴正则化方法的建立 总被引:1,自引:0,他引:1
对于带有右扰动数据的第一类紧算子方程的病态问题。本文应用正则化子建立了一类新的正则化求解方法,称之为改进的Tikonov正则化;通过适当选取2正则参数,证明了正则解具有最优的渐近收敛阶,与通常的Tikhonov正则化相比,这种改进的正则化可使正则解取到足够高的最优渐近阶。 相似文献
6.
A-线性Bregman 迭代算法 总被引:1,自引:0,他引:1
线性Bregman迭代是Osher和Cai等人最近提出的一种在压缩感知等领域有重要作用的有效算法.本文在矩阵A非满秩情形下,研究了求解下面最优化问题的线性Bregman迭代:min u∈R~M{‖u‖_1:Au+g}给出了一个关于线性Bregman迭代收敛性定理的简化证明,设计了一类A~-线性Bregman迭代算法,并针对A~+情形证明了算法的收敛性.最后,用数值仿真实验验证了本文算法的可行性. 相似文献
7.
给出了一种求解弹性l_{2}-l_{q}正则化问题的迭代重新加权l_{1}极小化算法, 并证明了由该算法产生的迭代序列是有界且渐进正则的. 对于任何有理数q\in(0,1), 基于一个代数的方法, 进一步证明了迭代重新加权l_{1}极小化算法收敛到弹性l_{2}-l_{q}(0
相似文献
8.
9.
本文通过利用极大熵函数构造同伦映射,建立了求解无约束线性l1模问题的熵函数延拓算法,证明了方法的收敛性,并给出了数值算例. 相似文献
10.
对于带有右端扰动数据的第一类紧算子方程的病态问题 ,本文应用正则化子建立了一类新的正则化求解方法 ,称之为改进的Tikonov正则化 ;通过适当选取正则参数 ,证明了正则解具有最优的渐近收敛阶 .与通常的Tikhonov正则化相比 ,这种改进的正则化可使正则解取到足够高的最优渐近阶 相似文献
11.
It is well known that the gradient-projection algorithm plays an important role in solving minimization problems. In this paper, we will use the idea of regularization to establish a general method so that the sequence generated by the general method can be strongly convergent to a minimizer of constrained convex minimization problems, which solves a variational inequality under suitable conditions. 相似文献
12.
Andjouh Amar Bibi Mohand Ouamer 《Journal of Optimization Theory and Applications》2022,192(1):360-378
Journal of Optimization Theory and Applications - In this paper, we propose a new adaptive method for solving the non-convex quadratic minimization problem subject to box constraints, where the... 相似文献
13.
Frank Pörner 《Numerical Functional Analysis & Optimization》2018,39(4):491-516
In this article, we investigate an inexact iterative regularization method based on generalized Bregman distances of an optimal control problem with control constraints. We show robustness and convergence of the inexact Bregman method under a regularity assumption, which is a combination of a source condition and a regularity assumption on the active sets. We also take the discretization error into account. Numerical results are presented to demonstrate the algorithm. 相似文献
14.
In this paper we propose an algorithm for the minimization of potential energy functions. The new algorithm is based on the differential evolution algorithm of Storn and Price (Journal of Global Optimization, vol. 11, pp. 341–359, 1997). The algorithm is tested on two different potential energy functions. The first function is the Lennard Jones energy function and the second function is the many-body potential energy function of Tersoff (Physics Review B, vol. 37, pp. 6991–7000, 1988; vol. 38, pp. 9902–9905, 1988). The first problem is a pair potential and the second problem is a semi-empirical many-body potential energy function considered for silicon-silicon atomic interactions. The minimum binding energies of up to 30 atoms are reported.Visitor at the Institute for Mathematics and its Applications, University of Minnesota, USA. 相似文献
15.
Hideaki Iiduka 《Journal of Optimization Theory and Applications》2011,148(3):580-592
Many practical problems such as signal processing and network resource allocation are formulated as the monotone variational
inequality over the fixed point set of a nonexpansive mapping, and iterative algorithms to solve these problems have been
proposed. This paper discusses a monotone variational inequality with variational inequality constraint over the fixed point
set of a nonexpansive mapping, which is called the triple-hierarchical constrained optimization problem, and presents an iterative
algorithm for solving it. Strong convergence of the algorithm to the unique solution of the problem is guaranteed under certain
assumptions. 相似文献
16.
Marko Miladinović Predrag Stanimirović Sladjana Miljković 《Journal of Optimization Theory and Applications》2011,151(2):304-320
We introduce a gradient descent algorithm for solving large scale unconstrained nonlinear optimization problems. The computation
of the initial trial steplength is based on the usage of both the quasi-Newton property and the Hessian inverse approximation
by an appropriate scalar matrix. The nonmonotone line search technique for the steplength calculation is applied later. The
computational and storage complexity of the new method is equal to the computational and storage complexity of the Barzilai
and Borwein method. On the other hand, the reported numerical results indicate improvements in favor of the new method with
respect to the well known global Barzilai and Borwein method. 相似文献
17.
最小风险证券组合的结构分析和迭代算法 总被引:1,自引:0,他引:1
本文分析了最小风险组合证券投资的结构特征,并提出了一种组合证券风险最小化的迭代算法,证明了其收敛性.该算法操作简单,且易于处理不允许卖空情况下的证券组合问题. 相似文献
18.
考虑带线性约束的三块变量的凸优化模型,目标函数是可分的三个函数和.给出了一个新的分裂算法.首先,对每个块变量解极小化增广拉格朗日函数.然后,通过一个校正步得到新的迭代点.证明了新算法的整体收敛性和O(1/t)的收敛阶. 相似文献
19.
20.
D. Pradeep 《Numerical Functional Analysis & Optimization》2016,37(3):342-362
In this article, we consider a regularized iterative scheme for solving nonlinear ill-posed problems. The convergence analysis and error estimates are derived by choosing the regularization parameter according to both a priori and a posteriori methods. The iterative scheme is stopped using an a posteriori stopping rule, and we prove that the scheme converges to the solution of the well-known Lavrentiev scheme. The salient features of the proposed scheme are: (i) convergence and error estimate analysis require only weaker assumptions compared to standard assumptions followed in literature, and (ii) consideration of an adaptive a posteriori stopping rule and a parameter choice strategy that gives the same convergence rate as that of an a priori method without using the smallness assumption, the source condition. The above features are very useful from theory and application points of view. We also supply the numerical results to illustrate that the method is adaptable. Further, we compare the numerical result of the proposed method with the standard approach to demonstrate that our scheme is stable and achieves good computational output. 相似文献