排序方式: 共有56条查询结果,搜索用时 31 毫秒
11.
By smoothing a perturbed minimum function, we propose in this paper a new smoothing function. The existence and continuity of a smooth path for solving the nonlinear complementarity problem (NCP) with a P
0 function are discussed. We investigate the boundedness of the iteration sequence generated by noninterior continuation/smoothing methods under the assumption that the solution set of the NCP is nonempty and bounded. Based on the new smoothing function, we present a predictor-corrector smoothing Newton algorithm for solving the NCP with a P
0 function, which is shown to be globally linearly and locally superlinearly convergent under suitable assumptions. Some preliminary computational results are reported. 相似文献
12.
1.IntroductionIn[1]Mizuno,ToddandYepresentedapredictor-correctoralgorithmforlinearpramgrammingwhichpossessesaquadraticconvergencerateofthedualgaptozero.GuoandWul6]gaveamodificationofthisalgorithmforsolvingconvexquadraticprogramwithupperbounds.Itisshownthatthemodifiedmethodnotonlypreservesalltheoriginalmerits,butalsoreducesthedualgapbyaconstantfactorineachcorrectorstep,incontrasttotheMizuno,TOddandYe'soriginalpredictor--correctormethodwherethedualgapremainsunchanged.Thealgorithmdiscussedint… 相似文献
13.
Image recovery problems can be solved using optimization techniques. They lead often to the solution of either a large-scale convex quadratic program or equivalently a nondifferentiable minimization problem. To solve the quadratic program, we use an infeasible predictor-corrector interior-point method, presented in the more general framework of monotone LCP. The algorithm has polynomial complexity and it converges with asymptotic quadratic rate. When implementing the method to recover images, we take advantage of the underlying sparsity of the problem. We obtain good performances, that we assess by comparing the method with a variable-metric proximal bundle algorithm applied to the solution of equivalent nonsmooth problem. 相似文献
14.
Florian A. Potra 《Annals of Operations Research》1996,62(1):81-102
The Mizuno-Todd-Ye predictor-corrector algorithm for linear programming is extended for solving monotone linear complementarity problems from infeasible starting points. The proposed algorithm requires two matrix factorizations and at most three backsolves per iteration. Its computational complexity depends on the quality of the starting point. If the starting points are large enough, then the algorithm hasO(nL) iteration complexity. If a certain measure of feasibility at the starting point is small enough, then the algorithm has
iteration complexity. At each iteration, both feasibility and optimality are reduced exactly at the same rate. The algorithm is quadratically convergent for problems having a strictly complementary solution, and therefore its asymptotic efficiency index is
. A variant of the algorithm can be used to detect whether solutions with norm less than a given constant exist.This work was supported in part by the National Science Foundation under grant DMS-9305760. 相似文献
15.
Kim-Chuan Toh 《Computational Optimization and Applications》1999,14(3):309-330
Primal-dual path-following algorithms are considered for determinant maximization problem (maxdet-problem). These algorithms apply Newton's method to a primal-dual central path equation similar to that in semidefinite programming (SDP) to obtain a Newton system which is then symmetrized to avoid nonsymmetric search direction. Computational aspects of the algorithms are discussed, including Mehrotra-type predictor-corrector variants. Focusing on three different symmetrizations, which leads to what are known as the AHO, H..K..M and NT directions in SDP, numerical results for various classes of maxdet-problem are given. The computational results show that the proposed algorithms are efficient, robust and accurate. 相似文献
16.
17.
<正>The state equations of stochastic control problems,which are controlled stochastic differential equations,are proposed to be discretized by the weak midpoint rule and predictor-corrector methods for the Markov chain approximation approach. Local consistency of the methods are proved.Numerical tests on a simplified Merton's portfolio model show better simulation to feedback control rules by these two methods, as compared with the weak Euler-Maruyama discretisation used by Krawczyk.This suggests a new approach of improving accuracy of approximating Markov chains for stochastic control problems. 相似文献
18.
19.
一个解凸二次规划的预测-校正光滑化方法 总被引:1,自引:0,他引:1
本文为凸二次规划问题提出一个光滑型方法,它是Engelke和Kanzow提出的解线性规划的光滑化算法的推广。其主要思想是将二次规划的最优性K-T条件写成一个非线性非光滑方程组,并利用Newton型方法来解其光滑近似。本文的方法是预测-校正方法。在较弱的条件下,证明了算法的全局收敛性和超线性收敛性。 相似文献
20.
The simplified Newton method, at the expense of fast convergence, reduces the work required by Newton method by reusing the initial Jacobian matrix. The composite Newton method attempts to balance the trade-off between expense and fast convergence by composing one Newton step with one simplified Newton step. Recently, Mehrotra suggested a predictor-corrector variant of primal-dual interior point method for linear programming. It is currently the interior-point method of the choice for linear programming. In this work we propose a predictor-corrector interior-point algorithm for convex quadratic programming. It is proved that the algorithm is equivalent to a level-1 perturbed composite Newton method. Computations in the algorithm do not require that the initial primal and dual points be feasible. Numerical experiments are made. 相似文献