排序方式: 共有104条查询结果,搜索用时 31 毫秒
61.
A SQP Method for Inequality Constrained Optimization 总被引:1,自引:0,他引:1
Ju-liang ZHANG Xiang-sun ZHANGInstitute of Applied Mathematics Academy of Mathematics System Sciences Chinese Academy of Sciences Beijing China 《应用数学学报(英文版)》2002,18(1):77-84
Abstract In this paper, a new SQP method for inequality constrained optimization is proposed and the globalconvergence is obtained under very mild conditions. 相似文献
62.
In this paper, we describe a successive approximation and smooth sequential quadratic programming (SQP) method for mathematical programs with nonlinear complementarity constraints (MPCC). We introduce a class of smooth programs to approximate the MPCC. Using an 11 penalty function, the line search assures global convergence, while the superlinear convergence rate is shown under the strictly complementary and second-order sufficient conditions. Moreover, we prove that the current iterated point is an exact stationary point of the mathematical programs with equilibrium constraints (MPEC) when the algorithm terminates finitely. 相似文献
63.
Stabilized Sequential Quadratic Programming 总被引:2,自引:0,他引:2
William W. Hager 《Computational Optimization and Applications》1999,12(1-3):253-273
Recently, Wright proposed a stabilized sequential quadratic programming algorithm for inequality constrained optimization. Assuming the Mangasarian-Fromovitz constraint qualification and the existence of a strictly positive multiplier (but possibly dependent constraint gradients), he proved a local quadratic convergence result. In this paper, we establish quadratic convergence in cases where both strict complementarity and the Mangasarian-Fromovitz constraint qualification do not hold. The constraints on the stabilization parameter are relaxed, and linear convergence is demonstrated when the parameter is kept fixed. We show that the analysis of this method can be carried out using recent results for the stability of variational problems. 相似文献
64.
一个新的SQP方法及其超线性收敛性 总被引:3,自引:0,他引:3
由Wilson,Han,Powell发展的SQP技术是解非线性规划的最有效的方法之一,但是,如果其中的二次子规划问题无可行解或者其搜索方向向量无界,该方法an和Burke「3」,周广路「2」分别对二次规划问题作了修正,克服了上述矛盾,本文在「2」的基础上,进上步修正,证明在Armijo搜索下算法具有全局收敛性,并通过解一辅助线性方程组,利用弧式搜索,得出该方法具有超线性收敛性。 相似文献
65.
S. DhandoleS.V. Modak 《Applied Mathematical Modelling》2012,36(1):399-413
A method based on constrained optimization for updating of an acoustic finite element model using pressure response is proposed in this paper. The constrained optimization problem is solved using sequential quadratic programming algorithm. Updating parameters related to the properties of the sound absorbers and the measurement errors are considered. Effectiveness of the method is demonstrated by numerical studies on a 2D rectangular cavity and a car cavity. It is shown that the constrained formulation, that includes lower and upper bounds on the updating parameters in the form of inequality constraints, is important for obtaining a correct updated model. It is seen that the proposed updating method is not only able to effectively update the model to obtain a close match between the finite element model pressure response and the reference pressure response, but is also able to identify the correction factors to the parameters in error with reasonable accuracy. 相似文献
66.
求解Minimax优化问题的SQP方法 总被引:12,自引:0,他引:12
本文提出一类求解minimax优化问题的有效算法,该算法属于序列二次规划方法.它具有全局收敛性和超线性收敛速率.数值例子表明,该算法是非常有效的,这与算法具有良好的理论结果是分不开的. 相似文献
67.
MBFGS修正在SQP算法中的应用—算法及其局部收敛性 总被引:1,自引:0,他引:1
本研究了SQP算法中保持矩阵正定性的方法.利用Li—Fukmshima提出的求解无约束问题的修正BFGS(MBFGS)公式,提出了求解等式约束问题的SQP算法.证明了若在问题的解处二阶充分条件成立,则相应的SQP算法具有2一一步超线性收敛性. 相似文献
68.
In this paper, a new sequential penalty algorithm, based on the Linfin exact penalty function, is proposed for a general nonlinear constrained optimization problem. The algorithm has the following characteristics: it can start from an arbitrary initial point; the feasibility of the subproblem is guaranteed; the penalty parameter is adjusted automatically; global convergence without any regularity assumption is proved. The update formula of the penalty parameter is new. It is proved that the algorithm proposed in this paper behaves equivalently to the standard SQP method after sufficiently many iterations. Hence, the local convergence results of the standard SQP method can be applied to this algorithm. Preliminary numerical experiments show the efficiency and stability of the algorithm. 相似文献
69.
A new technique for inconsistent QP problems in the SQP method 总被引:1,自引:0,他引:1
P. Spellucci 《Mathematical Methods of Operations Research》1998,47(3):355-400
Successful treatment of inconsistent QP problems is of major importance in the SQP method, since such occur quite often even for well behaved nonlinear programming problems. This paper presents a new technique for regularizing inconsistent QP problems, which compromises in its properties between the simple technique of Pantoja and Mayne [36] and the highly successful, but expensive one of Tone [47]. Global convergence of a corresponding algorithm is shown under reasonable weak conditions. Numerical results are reported which show that this technique, combined with a special method for the case of regular subproblems, is quite competitive to highly appreciated established ones. 相似文献
70.
An efficient SQP algorithm for solving nonlinear degenerate problems is proposed in the paper. At each iteration of the algorithm, a quadratic programming subproblem, which is always feasible by introducing a slack variable, is solved to obtain a search direction. The steplength along this direction is computed by employing the 1∞ exact penalty function through Armijo-type line search scheme. The algorithm is proved to be convergent globally under mild conditions. 相似文献