A Subspace Modified PRP Method for Large-scale Nonlinear Box-Constrained Optimization

In this article, we first propose a feasible steepest descent direction for box-constrained optimization. By the use of the direction and recently developed modified PRP method, we propose a subspace modified PRP method for box-constrained optimization. Under appropriate conditions, we show that the method is globally convergent. Numerical experiments are presented using box-constrained problems in the CUTEr test problem libraries.     

Modified regularization method for the Cauchy problem of the Helmholtz equation

In this paper, the Cauchy problem for the Helmholtz equation is investigated. It is known that such problem is severely ill-posed. We propose a modified regularization method to solve it based on the solution given by the method of separation of variables. Convergence estimates are presented under two different a-priori bounded assumptions for the exact solution. Finally, numerical examples are given to show the effectiveness of the proposed numerical method.     

An Active Set Modified Polak–Ribiére–Polyak Method for Large-Scale Nonlinear Bound Constrained Optimization

In this paper, we propose an active set modified Polak?CRibiére?CPolyak method for solving large-scale optimization with simple bounds on the variables. The active set is guessed by an identification technique at each iteration and the recently developed modified Polak?CRibiére?CPolyak method is used to update the variables with indices outside of the active set. Under appropriate conditions, we show that the proposed method is globally convergent. Numerical experiments are presented using box constrained problems in the CUTEr test problem libraries.     

MBFGS修正在SQP算法中的应用—算法及其局部收敛性

本研究了SQP算法中保持矩阵正定性的方法．利用Li—Fukmshima提出的求解无约束问题的修正BFGS(MBFGS)公式，提出了求解等式约束问题的SQP算法．证明了若在问题的解处二阶充分条件成立，则相应的SQP算法具有2一一步超线性收敛性．     

A Fourth-Order Modified Method for the Cauchy Problem of the Modified Helmholtz Equation

This paper is concerned with the Cauchy problem for the modified Helmholtz equation in an infinite strip domain 0 < x≤ 1, y ∈ R. The Cauchy data at x = 0 is given and the solution is then sought for the interval 0 < x ≤1. This problem is highly ill-posed and the solution (if it exists) does not depend continuously on the given data. In this paper, we propose a fourth-order modified method to solve the Cauchy problem. Convergence estimates are presented under the suitable choices of regularization parameters and the a priori assumption on the bounds of the exact solution. Numerical implementation is considered and the numerical examples show that our proposed method is effective and stable.     

An accurate active set conjugate gradient algorithm with project search for bound constrained optimization

In the paper, we propose an active set identification technique which accurately identifies active constraints in a neighborhood of an isolated stationary point without strict complementarity conditions. Based on the identification technique, we propose a conjugate gradient algorithm for large-scale bound constrained optimization. In the algorithm, the recently developed modified Polak-Ribiére-Polyak method is used to update the variables with indices outside of the active set, while the projected gradient method is used to update the active variables. Under appropriate conditions, we show that the proposed method is globally convergent. Numerical experiments are presented using bound constrained problems in the CUTEr test problem library.     

On the numerical solution of a boundary integral equation for the exterior Neumann problem on domains with corners

The authors propose a “modified” Nyström method to approximate the solution of a boundary integral equation connected with the exterior Neumann problem for Laplace's equation on planar domains with corners. They prove the convergence and the stability of the method and show some numerical tests.     

Modified Alternating Direction Methods for the Modified Multiple-Sets Split Feasibility Problems

In this paper, we propose two new multiple-sets split feasibility problem models and new solution methods. The first model is more separable than the original one, which enables us to apply a modified alternating direction method with parallel steps to solve it. Then, to overcome the difficulty of computing projections onto the constraint sets, a special version of this modified method with the strategy of projection onto half-space is given. The second model consists in finding a least Euclidean norm solution of the multiple-sets split feasibility problem, for which we provide another modified alternating direction method. Numerical results presented at the last show the efficiency of our methods.     

Modified Tikhonov regularization method for the Cauchy problem of the Helmholtz equation

In this paper, the Cauchy problem for the Helmholtz equation is investigated. By Green’s formulation, the problem can be transformed into a moment problem. Then we propose a modified Tikhonov regularization algorithm for obtaining an approximate solution to the Neumann data on the unspecified boundary. Error estimation and convergence analysis have been given. Finally, we present numerical results for several examples and show the effectiveness of the proposed method.     

大规模多设施Weber问题的改进Cooper算法

 多设施Weber问题（multi-source Weber problem,MWP）是设施选址中的重要模型之一,而Cooper算法是求解MWP最为常用的数值方法.Cooper算法包含选址步和分配步,两步交替进行直至达到局部最优解.本文对Cooper算法的选址步和分配步分别引入改进策略,提出改进Cooper算法：选址步中将Weiszfeld算法和adaptive Barzilai-Borwein （ABB）算法结合,提出收敛速度更快的ABB-Weiszfeld算法求解选址子问题;分配步中提出贪婪簇分割策略来处理退化设施,由此进一步提出具有更好性质的贪婪混合策略.数值实验表明本文提出的改进策略有效地提高了Cooper算法的计算效率,改进算法有着更好的数值表现.     

p-Adic Analogue of the Wave Equation

In this paper, a p-adic analogue of the wave equation with Lipschitz source is considered. Since it is hard to arrive the solution of the problem, we propose a regularized method to solve the problem from a modified p-adic integral equation. Moreover, we give an iterative scheme for numerical computation of the regularlized solution.

     

Construction of Surfaces with Parallelism Conditions

In this paper we define the notion of pseudo-parallel parameterized surfaces, extending that of offset surfaces. Then we consider the problem of fitting a set of scattered points with a surface pseudo-parallel to a given reference surface. We propose a method of solution based on a modified version of the classical smoothing D ^m -splines over a bounded domain. The convergence of the method is established and some numerical examples are given.     

Regularization of a backward problem for the inhomogeneous time-fractional wave equation

In this paper, we consider a backward problem for an inhomogeneous time-fractional wave equation in a general bounded domain. Such a backward problem is of practically great importance because we often do not know the initial density of substance, but we can observe the density at a positive moment. The existence and regularity for the backward problem are investigated. The backward problem is ill-posed, and we propose a regularizing scheme by using a modified regularization method. We also prove the convergence rate for the regularized solution by using some a priori regularization parameter choice rule.     

A primal-dual interior-point method for linear programming based on a weighted barrier function

One motivation for the standard primal-dual direction used in interior-point methods is that it can be obtained by solving a least-squares problem. In this paper, we propose a primal-dual interior-point method derived through a modified least-squares problem. The direction used is equivalent to the Newton direction for a weighted barrier function method with the weights determined by the current primal-dual iterate. We demonstrate that the Newton direction for the usual, unweighted barrier function method can be derived through a weighted modified least-squares problem. The algorithm requires a polynomial number of iterations. It enjoys quadratic convergence if the optimal vertex is nondegenerate.The research of the second author was supported in part by ONR Grants N00014-90-J-1714 and N00014-94-1-0391.     

A relaxation method of an alternating iterative MFS algorithm for the Cauchy problem associated with the two‐dimensional modified Helmholtz equation

We propose two algorithms involving the relaxation of either the given Dirichlet data or the prescribed Neumann data on the over‐specified boundary in the case of the alternating iterative algorithm of Kozlov et al. (USSR Comput Math Math Phys 31 (1991), 45–52) applied to the Cauchy problem for the two‐dimensional modified Helmholtz equation. The two mixed, well‐posed and direct problems corresponding to every iteration of the numerical procedure are solved using the method of fundamental solutions (MFS), in conjunction with the Tikhonov regularization method. For each direct problem considered, the optimal value of the regularization parameter is selected according to the generalized cross‐validation criterion. The iterative MFS algorithms with relaxation are tested for Cauchy problems associated with the modified Helmholtz equation in two‐dimensional geometries to confirm the numerical convergence, stability, accuracy and computational efficiency of the method. © 2011 Wiley Periodicals, Inc. Numer Methods Partial Differential Eq, 2011     

Modified block iterative method for solving convex feasibility problem,equilibrium problems and variational inequality problems

The purpose of this paper is by using the modified block iterative method to propose an algorithm for finding a common element in the intersection of the set of common fixed points of an infinite family of quasi-φ-asymptotically nonexpansive and the set of solutions to an equilibrium problem and the set of solutions to a variational inequality. Under suitable conditions some strong convergence theorems are established in 2-uniformly convex and uniformly smooth Banach spaces. As applications we utilize the results presented in the paper to solving the convex feasibility problem (CFP) and zero point problem of maximal monotone mappings in Banach spaces. The results presented in the paper improve and extend the corresponding results announced by many authors.     

Symmetric modified AOR method to solve systems of linear equations

We propose a class of symmetric modified accelerated overrelaxation (SMAOR) methods for solving large sparse linear systems. The convergence region of the method has been investigated. Numerical examples indicate that the SMAOR method is better than other methods such as accelerated overrelaxation(AOR) and modified accelerated overrelaxation(MAOR) methods, since the spectral radius of iteration matrix in SMAOR method is less than that of the other methods. Also, we apply the method to solve a real boundary value problem.     

Vehicle routing problems with alternative paths: An application to on-demand transportation

The class of vehicle routing problems involves the optimization of freight or passenger transportation activities. These problems are generally treated via the representation of the road network as a weighted complete graph. Each arc of the graph represents the shortest route for a possible origin–destination connection. Several attributes can be defined for one arc (travel time, travel cost, etc.), but the shortest route modeled by this arc is computed according to a single criterion, generally travel time. Consequently, some alternative routes proposing a different compromise between the attributes of the arcs are discarded from the solution space. We propose to consider these alternative routes and to evaluate their impact on solution algorithms and solution values through a multigraph representation of the road network. We point out the difficulties brought by this representation for general vehicle routing problems, which drives us to introduce the so-called fixed sequence arc selection problem (FSASP). We propose a dynamic programming solution method for this problem. In the context of an on-demand transportation (ODT) problem, we then propose a simple insertion algorithm based on iterative FSASP solving and a branch-and-price exact method. Computational experiments on modified instances from the literature and on realistic data issued from an ODT system in the French Doubs Central area underline the cost savings brought by the proposed methods using the multigraph model.     

Convergence of the modified discrete ordinates method for the anisotropic scattering transport equation

Criticality problem of nuclear tractors generally refers to an eigenvalue problem for the transport equations. In this paper, we deal with the eigenvalue of the anisotropic scattering transport equation in slab geometry. We propose a new discrete method which was called modified discrete ordinates method. It is constructed by redeveloping and improving discrete ordinates method in the space of L¹(X). Different from traditional methods, norm convergence of operator approximation is proved theoretically. Furthermore, convergence of eigenvalue approximation and the corresponding error estimation are obtained by analytical tools.     

A continuation method for linear complementarity problems with P 0 matrix

In this article, we propose a new continuation method for solving the linear complementarity problem (LCP). The method solves one system of linear equations and carries out only a one-line search at each iteration. The continuation method is based on a modified smoothing function. The existence and continuity of a smooth path for solving the LCP with a P ₀ matrix are discussed. We investigate the boundedness of the iteration sequence generated by our continuation method under the assumption that the solution set of the LCP is nonempty and bounded. It is shown to converge to an LCP solution globally linearly and locally superlinearly without the assumption of strict complementarity at the solution under suitable assumption. In addition, some numerical results are also reported in this article.