首页 | 本学科首页   官方微博 | 高级检索  
相似文献
 共查询到20条相似文献,搜索用时 46 毫秒
1.
This paper proposes a two-piece update of projected reduced Hessian algorithm with nonmonotonic trust region strategy for solving nonlinear equality constrained optimization problems. In order to deal with large problems, a two-piece update of twoside projected reduced Hessian is used to replace full Hessian matrix. By adopting the Fletcher's penalty function as the merit function, a nonmonotonic trust region strategy is suggested which does not require the merit function to reduce its value in every iteration. The two-piece update of projected reduced Hessian algorithm which switches to nonmonotonic trust region technique possesses global convergence while maintaining a two-step Q-superlinear local convergence rate under some reasonable conditions. Furthermore, one step Q-superlinear local convergence rate can be obtained if at least one of the update formulas is updated at each iteration by an alternative update rule. The numerical experiment results are reported to show the effectiveness of the propo  相似文献   

2.
This paper presents a trust region algorithm with null space technique fornonlinear equality constrained optimization. Considering in the null space methods that,the convergent rate of range space step is faster than the null space step for the most cases,the proposed algorithm computes null steps more often than range space step. Moreover,the new algorithm is based on the reduced Hessian SQP method. Global convergence ofthe proposed algorithm is proved. The effectiveness of the method is demonstrated bysome numerical examples.  相似文献   

3.
双参数精确罚函数求解约束优化问题的拟牛顿算法   总被引:4,自引:0,他引:4  
刘树人  孟志青 《系统工程》2005,23(10):68-72
对于含约束不等式的最优化问题,给出了一种双参数罚函数形式和这种罚函数的精确罚定理,提出了一个求解这种罚函数无约束优化问题的拟牛顿算法,研究了它的收敛性,数值实验表明了该算法是可行的.  相似文献   

4.
For smooth optimization problem with equality constraints,new continuously differentiate penalty function is derived.It is proved exact in the sense that local optimizers of a nonlinear program are precisely the optimizers of the associated penalty function under some nondegeneracy assumption. It is simple in the sense that the penalty function only includes the objective function and constrained functions,and it doesn’t include their gradients.This is achieved by augmenting the dimension of the program by a variable that controls the weight of the penalty terms.  相似文献   

5.
This paper proposes a nonmonotone line search filter method with reduced Hessian updating for solving nonlinear equality constrained optimization. In order to deal with large scale problems, a reduced Hessian matrix is approximated by BFGS updates. The new method assures global convergence without using a merit function. By Lagrangian function in the filter and nonmonotone scheme, the authors prove that the method can overcome Maratos effect without using second order correction step so that the locally superlinear convergence is achieved. The primary numerical experiments are reported to show effectiveness of the proposed algorithm.  相似文献   

6.
A Strong Subfeasible Directions Algorithm with Superlinear Convergence   总被引:1,自引:0,他引:1  
AStrongSubfeasibleDirectionsAlgorithmwithSuperlinearConvergenceJIANJinbao(Dept.ofMath.andInformationScience,GuangxiUniversity...  相似文献   

7.
This paper proposes an inexact SQP method in association with line search filter technique for solving nonlinear equality constrained optimization.For large-scale applications,it is expensive to get an exact search direction,and hence the authors use an inexact method that finds an approximate solution satisfying some appropriate conditions.The global convergence of the proposed algorithm is established by using line search filter technique.The second-order correction step is used to overcome the Maratos effect,while the line search filter inexact SQP method has q-superlinear local convergence rate.Finally,the results of numerical experiments indicate that the proposed method is efficient for the given test problems.  相似文献   

8.
<正> This paper formulates and analyzes a line search method for general nonlinear equalityconstrained optimization based on filter methods for step acceptance and secant methods for searchdirection.The feature of the new algorithm is that the secant algorithm is used to produce a searchdirection,a backtracking line search procedure is used to generate step size,some filtered rules areused to determine step acceptance,second order correction technique is used to reduce infeasibility andovercome the Maratos effect.Global convergence properties of this method are analyzed:under mildassumptions it is showed that every limit point of the sequence of iterates generated by the algorithmis feasible,and that there exists at least one limit point that is a stationary point for the problem.Moreover,it is also established that the Maratos effect can be overcome in our new approach by addingsecond order correction steps so that fast local superlinear convergence to a second order sufficient localsolution is achieved.Finally,the results of numerical experiments are reported to show the effectivenessof the line search filter secant method.  相似文献   

9.
为了提高求解二阶锥规划问题的效率,提出一种新的求解二阶锥规划问题的非单调信赖域算法.基于Fischer-Burmeister光滑函数,对二阶锥规划问题的最优性条件进行转化,得到与其等价的无约束优化问题的非线性可微的光滑方程组,构造信赖域子问题,利用非单调信赖域算法求解.算法在求解信赖域子问题时,提出了一个新的自适应选取信赖域半径机制,搜索到全局最优解.数值实验结果表明,该算法运行速度快、迭代次数少,比内点算法和不可行内点算法优越.  相似文献   

10.
1 IntroductionConsider the following inequality constrained optiInization problem:Inin f(x)xeRn(1)s.t. g(x) 5 0where f: R1'-R, g: R"-Rm are cofltinuousIy differentiable functions.SQP method for soIving problem(1) is to gellerate a sequence {xk} converging…  相似文献   

11.
<正> This paper proposes a filter secant method with nonmonotone line search for non-linearequality constrained optimization.The Hessian of the Lagrangian is approximated using the BFGSsecant update.This new method has more flexibility for the acceptance of the trial step and requires lesscomputational costs compared with the monotone one.The global and local convergence of the proposedmethod are given under some reasonable conditions.Further,two-step Q-superlinear convergence rateis established by introducing second order correction step.The numerical experiments are reported toshow the effectiveness of the proposed algorithm.  相似文献   

12.
Some classical penalty function algorithms may not always be convergent under big penalty parameters in Matlab software, which makes them impossible to find out an optimal solution to constrained optimization problems. In this paper, a novel penalty function (called M-objective penalty function) with one penalty parameter added to both objective and constrained functions of inequality constrained optimization problems is proposed. Based on the M-objective penalty function, an algorithm is developed to solve an optimal solution to the inequality constrained optimization problems, with its convergence proved under some conditions. Furthermore, numerical results show that the proposed algorithm has a much better convergence than the classical penalty function algorithms under big penalty parameters, and is efficient in choosing a penalty parameter in a large range in Matlab software.  相似文献   

13.
A Superlinearly Convergent Combined PhaseⅠ-PhaseⅡ Subfeasible Method   总被引:2,自引:0,他引:2  
ASuperlinearlyConvergentCombinedPhaseⅠ-PhaseⅡSubfeasibleMethodJIANJinbao(MathematicsandInformationScienceDepartmentofGuangxiU...  相似文献   

14.
AnExactPenaltyFunctionMethodforLinearStaticStackelbergProblemwithMultipleLeadersandMultipleFollowersLIDengfeng;CHENShouyu(Dep...  相似文献   

15.
An active-set projected trust region algorithm is proposed for box constrained optimization problems, where the given algorithm is designed by three steps. First, the projected gradient direction which normally has better numerical performance is introduced. Second, the projected trust region direction that often possesses good convergence is defined, where the matrix of trust region subproblem is updated by limited memory strategy. Third, in order to get both good numerical performance and convergence, the authors define the final search which is the convex combination of the projected gradient direction and the projected trust region direction. Under suitable conditions, the global convergence of the given algorithm is established. Numerical results show that the presented method is competitive to other similar methods.  相似文献   

16.
针对信赖域方法求解多峰值优化不能收敛到全局最优的问题,提出了一种信赖域遗传算法,该算法将遗传算法和信赖域方法进行了结合。利用了遗传算法繁殖算子的随机性和信赖域方法求解二次优化问题的高效性,该算法能够克服信赖域方法的缺点同时能够有效求解一类欺骗性问题。最后证明了算法的收敛性,通过数值试验说明了算法的有效性。  相似文献   

17.
基于粒子群优化的稀疏分解变尺度快速算法   总被引:1,自引:0,他引:1  
针对一类可分稀疏性度量函数,结合最优化理论,研究了稀疏信号重构的快速算法。稀疏分解可以看成是一个带等式约束的优化问题,首先利用惩罚函数法将其转化为无约束优化问题|然后在粒子群优化估计搜索步长的基础上,利用变尺度法寻找无约束优化问题的最优解|最后依次增大惩罚因子,直至稀疏表示系数满足分解精度的要求。该算法避免了矩阵求逆运算,且无需先验地选取惩罚因子。仿真实验验证了算法的有效性和快速性。  相似文献   

18.
为了同时利用证据焦元的基本概率赋值和焦元的基数信息解决DS(Dempster Shafer, DS)证据理论高冲突问题,并考虑数据融合的抗噪声和干扰能力,提出采用基于焦元信息能量的先验信息比值演变函数对证据源和组合规则进行修正的算法。为了进一步降低〖JP2〗算法计算量,利用多元素焦元信任值向单元素焦元分配以及决策集约简方法,进一步优化算法性能,提高算法大数据量适应能力。实验结果验证了优化算法的正确性和有效性。  相似文献   

19.
This paper proposes an arlene scaling derivative-free trust region method with interior backtracking technique for bounded-constrained nonlinear programming. This method is designed to get a stationary point for such a problem with polynomial interpolation models instead of the objective function in trust region subproblem. Combined with both trust region strategy and line search technique, at each iteration, the affine scaling derivative-free trust region subproblem generates a backtracking direction in order to obtain a new accepted interior feasible step. Global convergence and fast local convergence properties are established under some reasonable conditions. Some numerical results are also given to show the effectiveness of the proposed algorithm.  相似文献   

20.
用混沌搜索求解非线性约束优化问题   总被引:21,自引:0,他引:21  
提出了一种用混沌搜索求解非线性约束优化的新方法 .利用罚函数思想将约束问题无约束化 ,再利用混沌的内在随机性与遍历性进行求解 .算例仿真结果表明 ,算法简单实用 ,性能良好 ,是解决非线性约束优化问题的有效途径 .  相似文献   

设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号