共查询到20条相似文献,搜索用时 31 毫秒
1.
The stabilized sequential quadratic programming (SQP) method has nice local convergence properties: it possesses local superlinear convergence under very mild assumptions not including any constraint qualifications. However, any attempts to globalize convergence of this method indispensably face some principal difficulties concerned with intrinsic deficiencies of the steps produced by it when relatively far from solutions; specifically, it has a tendency to produce long sequences of short steps before entering the region where its superlinear convergence shows up. In this paper, we propose a modification of the stabilized SQP method, possessing better “semi-local” behavior, and hence, more suitable for the development of practical realizations. The key features of the new method are identification of the so-called degeneracy subspace and dual stabilization along this subspace only; thus the name “subspace-stabilized SQP”. We consider two versions of this method, their local convergence properties, as well as a practical procedure for approximation of the degeneracy subspace. Even though we do not consider here any specific algorithms with theoretically justified global convergence properties, subspace-stabilized SQP can be a relevant substitute for the stabilized SQP in such algorithms using the latter at the “local phase”. Some numerical results demonstrate that stabilization along the degeneracy subspace is indeed crucially important for success of dual stabilization methods. 相似文献
2.
NE/SQP (Refs. 2–3) is a recent algorithm that has proven quite effective for solving the nonlinear complementarity problem (NCP). NE/SQP is robust in the sense that its direction-finding subproblems are always solvable; in addition, the convergence rate of this method is q-quadratic. In this note, we consider a generalized version of NE/SQP, as first described in Ref. 4, which is suitable for the bounded NCP. We extend the work in Ref. 4 by demonstrating a stronger convergence result and present numerical results on test problems. 相似文献
3.
In this paper, we introduce a cautious BFGS (CBFGS) update criterion in the reduced Hessian sequential quadratic programming
(SQP) method. An attractive property of this update criterion is that the generated iterative matrices are always positive
definite. Under mild conditions, we get the global convergence of the reduced Hessian SQP method. In particular, the second
order sufficient condition is not necessary for the global convergence of the method. Furthermore, we show that if the second
order sufficient condition holds at an accumulation point, then the reduced Hessian SQP method with CBFGS update reduces to
the reduced Hessian SQP method with ordinary BFGS update. Consequently, the local behavior of the proposed method is the same
as the reduced Hessian SQP method with BFGS update. The presented preliminary numerical experiments show the good performance
of the method.
This work was supported by the National Natural Science Foundation of China via grant 10671060 and 10471060. 相似文献
4.
In this paper, we present an extension to the NE/SQP method; the latter is a robust algorithm that we proposed for solving the nonlinear complementarity problem in an earlier article. In this extended version of NE/SQP, instead of exactly solving the quadratic program subproblems, approximate solutions are generated via an inexact rule.Under a proper choice for this rule, this inexact method is shown to inherit the same convergence properties of the original NE/SQP method. In addition to developing the convergence theory for the inexact method, we also present numerical results of the algorithm tested on two problems of varying size. 相似文献
5.
《Journal of Computational and Applied Mathematics》2005,180(1):201-211
Sequential quadratic programming (SQP) has been one of the most important methods for solving nonlinearly constrained optimization problems. In this paper, we present and study an active set SQP algorithm for inequality constrained optimization. The active set technique is introduced which results in the size reduction of quadratic programming (QP) subproblems. The algorithm is proved to be globally convergent. Thus, the results show that the global convergence of SQP is still guaranteed by deleting some “redundant” constraints. 相似文献
6.
不等式约束优化一个新的SQP算法 总被引:5,自引:0,他引:5
本文提出了一个处理不等式约束优化问题的新的SQP算法.和传统的SQP算法相比,该算法每步只需求解一个仅含等式约束的子二次规划,从而减少了算法的计算工作量.在适当的条件下,证明算法是全局收敛的且具有超线性收敛速度.数值实验表明算法是有效的. 相似文献
7.
对于非线性约束的优化问题.最近给出的各种SQP算法均采用罚函数技巧以保证算法的全局收敛性,因而都必须小心地调整惩罚参数。本文给出一个不依赖于惩罚参数、每步迭代的校正矩阵也不需正定且仍具有全局收敛性的SQP方法,而且罚函数形式简单、具有和约束函数同阶的光滑性. 相似文献
8.
In this paper, the feasible type SQP method is improved. A new SQP algorithm is presented to solve the nonlinear inequality constrained optimization. As compared with the existing SQP methods, per single iteration, in order to obtain the search direction, it is only necessary to solve equality constrained quadratic programming subproblems and systems of linear equations. Under some suitable conditions, the global and superlinear convergence can be induced. 相似文献
9.
We investigate local convergence of an SQP method for nonlinear optimal control of weakly singular Hammerstein integral equations. Sufficient conditions for local quadratic convergence of the method are discussed. 相似文献
10.
最优化两个拓广的SQP和SSLE算法模型及其超线性和二次收敛性 总被引:2,自引:0,他引:2
简金宝 《高校应用数学学报(A辑)》2001,16(4):435-444
给出一般约束最优化的序列二次规划(SQP)和序列线性方程组(SSLE)算法两个拓广的模型,详细分析和论证两个模型的局部超线性收敛性及二次收敛性条件,其中并不需要严格互补条件,拓广的模型及其收敛速度结果具有更广泛的适用性,为SQP和SSLE算法收敛速度的研究提供了更为完善和便利的理论基础。 相似文献
11.
12.
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. 相似文献
13.
In this paper, the augmented Lagrangian SQP method is considered for the numerical solution of optimization problems with equality constraints. The problem is formulated in a Hilbert space setting. Since the augmented Lagrangian SQP method is a type of Newton method for the nonlinear system of necessary optimality conditions, it is conceivable that q-quadratic convergence can be shown to hold locally in the pair (x, ). Our interest lies in the convergence of the variable x alone. We improve convergence estimates for the Newton multiplier update which does not satisfy the same convergence properties in x as for example the least-square multiplier update. We discuss these updates in the context of parameter identification problems. Furthermore, we extend the convergence results to inexact augmented Lagrangian methods. Numerical results for a control problem are also presented. 相似文献
14.
15.
非线性约束条件下一个超线性收敛的可行方法 总被引:3,自引:0,他引:3
在本文中,我们对非线性不等式约束条件下的非线性优化问题给出了一个新的SQP类可行方法.此算法不但结构简单、易于计算,并且在适当的假设条件下,我们证明了算法具有全局收敛性及超线性收敛性 相似文献
16.
Sequential quadratic programming (SQP) methods are known to be efficient for solving a series of related nonlinear optimization problems because of desirable hot and warm start properties—a solution for one problem is a good estimate of the solution of the next. However, standard SQP solvers contain elements to enforce global convergence that can interfere with the potential to take advantage of these theoretical local properties in full. We present two new predictor–corrector procedures for solving a nonlinear program given a sufficiently accurate estimate of the solution of a similar problem. The procedures attempt to trace a homotopy path between solutions of the two problems, staying within the local domain of convergence for the series of problems generated. We provide theoretical convergence and tracking results, as well as some numerical results demonstrating the robustness and performance of the methods. 相似文献
17.
An algorithm of sequential systems of linear equations for nonlinear optimization problems with arbitrary initial point 总被引:6,自引:0,他引:6
For current sequential quadratic programming (SQP) type algorithms, there exist two problems: (i) in order to obtain a search
direction, one must solve one or more quadratic programming subproblems per iteration, and the computation amount of this
algorithm is very large. So they are not suitable for the large-scale problems; (ii) the SQP algorithms require that the related
quadratic programming subproblems be solvable per iteration, but it is difficult to be satisfied. By using ε-active set procedure
with a special penalty function as the merit function, a new algorithm of sequential systems of linear equations for general
nonlinear optimization problems with arbitrary initial point is presented. This new algorithm only needs to solve three systems
of linear equations having the same coefficient matrix per iteration, and has global convergence and local superlinear convergence.
To some extent, the new algorithm can overcome the shortcomings of the SQP algorithms mentioned above.
Project partly supported by the National Natural Science Foundation of China and Tianyuan Foundation of China. 相似文献
18.
利用广义投影校正技术对搜索方向进行某种修正,改进假设条件,采用一种新型的一阶修正方向并结合SQP技术,建立了求解非线性约束最优化问题(p)的一个新的SQP可行下降算法,在较温和的假设条件下证明了算法的全局收敛性.由于新算法仅需较小的存储,从而适合大规模最优化问题的计算. 相似文献
19.
序列二次规划方法(SQP)是解决非线性规划问题最有效的算法之一,但是当QP子问题不可行时算法可能会失败.而且线搜索中的罚参数的选择通常比较困难.在文献[1]中,SQP方法得到了修正,使得QP子问题可行.在本文中,我们利用滤子技术避免了罚函数的使用同时提出了带线搜索的滤子方法,最终保证了SQP方法总是可行的,而且得到了方法的全局收敛性. 相似文献
20.
Alexey F. Izmailov Alexey S. Kurennoy Mikhail V. Solodov 《Set-Valued and Variational Analysis》2013,21(1):17-45
While generalized equations with differentiable single-valued base mappings and the associated Josephy–Newton method have been studied extensively, the setting with semismooth base mapping had not been previously considered (apart from the two special cases of usual nonlinear equations and of Karush–Kuhn–Tucker optimality systems). We introduce for the general semismooth case appropriate notions of solution regularity and prove local convergence of the corresponding Josephy–Newton method. As an application, we immediately recover the known primal-dual local convergence properties of semismooth sequential quadratic programming algorithm (SQP), but also obtain some new results that complete the analysis of the SQP primal rate of convergence, including its quasi-Newton variant. 相似文献