共查询到20条相似文献,搜索用时 0 毫秒
1.
N. Yamashita K. Taji M. Fukushima 《Journal of Optimization Theory and Applications》1997,92(3):439-456
Recently, Peng considered a merit function for the variational inequality problem (VIP), which constitutes an unconstrained differentiable optimization reformulation of VIP. In this paper, we generalize the merit function proposed by Peng and study various properties of the generalized function. We call this function the D-gap function. We give conditions under which any stationary point of the D-gap function is a solution of VIP and conditions under which it provides a global error bound for VIP. We also present a descent method for solving VIP based on the D-gap function. 相似文献
2.
针对随机线性互补问题,提出等价的无约束优化再定式模型,即由D-间隙函数定义的确定性的无约束期望残差极小化问题.通过拟Monte Carlo方法,将样本进行了推广,得到了相关的离散近似问题.在适当的条件下,提出了最优解存在的充分条件,以及探究了离散近似问题的最优解及稳定点的收敛性.另外,在针对一类带有常系数矩阵的随机互补线性问题,研究了解存在的充要条件. 相似文献
3.
在本文中,我们给出一个求解无约束优化问题的秩一适定方法,该方法具有下述较好性质:校正矩阵是对称正定的;在适当条件下,对非凸函数拥有全局收敛性.我们还给出数值检验结果. 相似文献
4.
B. S. Goh 《Journal of Optimization Theory and Applications》1997,92(3):581-604
Existing algorithms for solving unconstrained optimization problems are generally only optimal in the short term. It is desirable to have algorithms which are long-term optimal. To achieve this, the problem of computing the minimum point of an unconstrained function is formulated as a sequence of optimal control problems. Some qualitative results are obtained from the optimal control analysis. These qualitative results are then used to construct a theoretical iterative method and a new continuous-time method for computing the minimum point of a nonlinear unconstrained function. New iterative algorithms which approximate the theoretical iterative method and the proposed continuous-time method are then established. For convergence analysis, it is useful to note that the numerical solution of an unconstrained optimization problem is none other than an inverse Lyapunov function problem. Convergence conditions for the proposed continuous-time method and iterative algorithms are established by using the Lyapunov function theorem. 相似文献
5.
In this paper, the non-quasi-Newton's family with inexact line search applied to unconstrained optimization problems is studied. A new update formula for non-quasi-Newton's family is proposed. It is proved that the constituted algorithm with either Wolfe-type or Armijotype line search converges globally and Q-superlinearly if the function to be minimized has Lipschitz continuous gradient. 相似文献
6.
对一般目标函数极小化问题的拟牛顿法及其全局收敛性的研究,已经成为拟牛顿法理论中最基本的开问题之一.本文对这个问题做了进一步的研究,对无约束优化问题提出一类新的广义拟牛顿算法,并结合Goldstein线搜索证明了算法对一般非凸目标函数极小化问题的全局收敛性. 相似文献
7.
本文在求解无约束最优化问题的MFR共轭梯度法和MPRP共轭梯度法中引入两种非单调线性搜索技术.我们证明在适当条件下采用非单调线性搜索的MFR算法和MPRP算法具有全局收敛性.数值结果表明非单调线性搜索具有优越性. 相似文献
8.
Schäffler S. Schultz R. Weinzierl K. 《Journal of Optimization Theory and Applications》2002,114(1):209-222
We propose a new stochastic algorithm for the solution of unconstrained vector optimization problems, which is based on a special class of stochastic differential equations. An efficient algorithm for the numerical solution of the stochastic differential equation is developed. Interesting properties of the algorithm enable the treatment of problems with a large number of variables. Numerical results are given. 相似文献
9.
结合非单调信赖域方法,和非单调线搜索技术,提出了一种新的无约束优化算法.信赖域方法的每一步采用线搜索,使得迭代每一步都充分下降加快了迭代速度.在一定条件下,证明了算法具有全局收敛性和局部超线性.收敛速度.数值试验表明算法是十分有效的. 相似文献
10.
一种无约束全局优化的水平值下降算法 总被引:1,自引:0,他引:1
本文研究无约束全局优化问题,建立了一种新的水平值下降算法(Level-value Descent Method,LDM).讨论并建立了概率意义下取全局最小值的一个充分必要条件,证明了算法LDM是依概率测度收敛的.这种LDM算法是基于重点度取样(Improtance Sampling)和Markov链Monte-Carlo随机模拟实现的,并利用相对熵方法(TheCross-Entropy Method)自动更新取样密度,算例表明LDM算法具有较高的数值精度和较好的全局收敛性. 相似文献
11.
本文通过结合牛顿法与PRP共轭梯度法提出一修正PRP方法,新方法中包含了二阶导数信息,在适当的假设下算法全局收敛,数值算例表明了算法的有效性. 相似文献
13.
14.
针对无约束非线性规划传统优化方法存在的问题,将区间自适应遗传算法引入无约束非线性规划优化中,算法可以利用当前进化信息,自适应移动搜索区间,找到全局最优解,故可缩短搜索区间长度,提高编码精度,降低算法计算量,解决了传统遗传算法处理优化问题时,给定区间必须包含最优解这一问题,这也是本算法有别于其他优化算法的独特优势,为某些最优解所在区间难以估计的无约束非线性规划问题的优化提供了一条有效可行的途径.系统阐述了区间自适应遗传算法的原理,给出了算法优化无约束非线性规划问题的步骤,以MatlabR2016b仿真方式对算法进行了实例测试,结果表明,方法是一种计算稳定、正确、有效、可靠实用的无约束非线性规划优化方法. 相似文献
15.
本文提出了一类新的用于解决无约束最优化问题的拟牛顿方法,并证明了这样的性质,在 精确线性搜索条件下,每一步该族所有方法所产生的迭代方向和迭代点列仅依赖于参数ρ.该方 法可视为拟牛顿方法中黄族的推广. 相似文献
16.
In this paper,we propose a new nonmonotone trust region Barzilai-Borwein(BB for short) method for solving unconstrained optimization problems.The proposed method is given by a novel combination of a modified Metropolis criterion,BB-stepsize and trust region method.The new method uses the reciprocal of BB-stepsize to approximate the Hessian matrix of the objective function in the trust region subproblems,and accepts some bad solutions according to the modified Metropolis criterion based on simula... 相似文献
17.
本文提出了一种解无约束优化问题的新的非单调自适应信赖域方法.这种方法借助于目标函数的海赛矩阵的近似数量矩阵来确定信赖域半径.在通常的条件下,给出了新算法的全局收敛性以及局部超线性收敛的结果,数值试验验证了新的非单调方法的有效性. 相似文献
18.
Songhai Deng Zhong Wan Xiaohong Chen 《Journal of Optimization Theory and Applications》2013,157(3):820-842
In this paper, an improved spectral conjugate gradient algorithm is developed for solving nonconvex unconstrained optimization problems. Different from the existent methods, the spectral and conjugate parameters are chosen such that the obtained search direction is always sufficiently descent as well as being close to the quasi-Newton direction. With these suitable choices, the additional assumption in the method proposed by Andrei on the boundedness of the spectral parameter is removed. Under some mild conditions, global convergence is established. Numerical experiments are employed to demonstrate the efficiency of the algorithm for solving large-scale benchmark test problems, particularly in comparison with the existent state-of-the-art algorithms available in the literature. 相似文献
19.
We consider quasidifferentiable functions in the sense of Demyanov and Rubinov, i. e. functions, which are directionally differentiable and whose directional derivative can be expressed as a difference of two sublinear functions, so that its subdifferential, called the quasidifferential, consists of a pair of sets. For these functions a generalized gradient algorithm is proposed. Its behaviour is studied in detail for the special class of continuously subdifferentiable functions. Numerical test results are given. Finally, the general quasidifferentiable case is simulated by means of perturbed subdifferentials, where we make use of the non-uniqueness in the quasidifferential representation. 相似文献