The relaxation methods have served as very efficient tools for solving linear system and have many important applications in the field of science and engineering.In this paper,we study an efficient relaxation method b...The relaxation methods have served as very efficient tools for solving linear system and have many important applications in the field of science and engineering.In this paper,we study an efficient relaxation method based on the well-known Gauss-Seidel iteration method.Theoretical analysis shows our method can converge to the unique solution of the linear system.In addition,our method is applied to solve the saddle point problem and Page Rank problem,and the numerical results show our method is more powerful than the existent relaxation methods.展开更多
By further generalizing Frommer's results in the sense of nonlinear multisplitting, we build a class of nonlinear multisplitting AOR-type methods, which covers many rather practical nonlinear multisplitting relaxa...By further generalizing Frommer's results in the sense of nonlinear multisplitting, we build a class of nonlinear multisplitting AOR-type methods, which covers many rather practical nonlinear multisplitting relaxation methods such as multisplitting AOR-Newton method, multisplitting AOR-chord method and multisplitting AOR-Steffensen method, etc.. Furthermore,a general convergence theorem for the nonlinear multisplitting AOR-type methods and the local convergence for the multisplitting AOR-Newton method are discussed in detail.A lot of numerical tests show that our new methods are feasible and satisfactory.展开更多
Asynchronous parallel multisplitting relaxation methods for solving large sparse linear complementarity problems are presented, and their convergence is proved when the system matrices are H-matrices having positive d...Asynchronous parallel multisplitting relaxation methods for solving large sparse linear complementarity problems are presented, and their convergence is proved when the system matrices are H-matrices having positive diagonal elements. Moreover, block and multi-parameter variants of the new methods, together with their convergence properties, are investigated in detail. Numerical results show that these new methods can achieve high parallel efficiency for solving the large sparse linear complementarity problems on multiprocessor systems.展开更多
A new algorithm of the relaxation method is developed for the inversion of forward scattered light to obtain the size distribution of spherical particles. Numerical tests are performed for a laser particle analyzer us...A new algorithm of the relaxation method is developed for the inversion of forward scattered light to obtain the size distribution of spherical particles. Numerical tests are performed for a laser particle analyzer using the Mie theory and the diffraction approximation. The algorithm efficiency, in the presence of experimental noises, is studied. The results show that the technique is fast in convergence, stable against random noise and insensitive to the distribution of particles and the initial trial distribution.展开更多
Two main methods, inactive eiement method and quiet element method, to simulate the process of multilayer ：and multipass welding：were reviewed, and the shortcomings of both methods were diScussed as well Based on ...Two main methods, inactive eiement method and quiet element method, to simulate the process of multilayer ：and multipass welding：were reviewed, and the shortcomings of both methods were diScussed as well Based on these analyses, a method called node dynamic relaxation method was put into forward to simulate the multilayer and multipass welding process, and the principle and application of this method were discussed in detail. The simulating results show that using the node dynamic relaxation method can decrease mesh distortion, improve calculation efficiency, and obtain good simulation results. This method can also be used in the field of simulation addition or removing materials in finite element analysis.展开更多
This paper presents an efficient algorithm for globally solving a generalized linear fractional programming problem.For establishing this algorithm,we firstly construct a two-level linear relaxation method,and by util...This paper presents an efficient algorithm for globally solving a generalized linear fractional programming problem.For establishing this algorithm,we firstly construct a two-level linear relaxation method,and by utilizing the method,we can convert the initial generalized linear fractional programming problem and its subproblems into a series of linear programming relaxation problems.Based on the branch-and-bound framework and linear programming relaxation problems,a branch-and-bound algorithm is presented for globally solving the generalized linear fractional programming problem,and the computational complexity of the algorithm is given.Finally,numerical experimental results demonstrate the feasibility and efficiency of the proposed algorithm.展开更多
The analysis of cable structures is one of the most challenging problems for civil and mechanical engineers.Because they have highly nonlinear behavior,it is difficult to find solutions to these problems.Thus far,diff...The analysis of cable structures is one of the most challenging problems for civil and mechanical engineers.Because they have highly nonlinear behavior,it is difficult to find solutions to these problems.Thus far,different assumptions and methods have been proposed to solve such structures.The dynamic relaxation method(DRM)is an explicit procedure for analyzing these types of structures.To utilize this scheme,investigators have suggested various stiffness matrices for a cable element.In this study,the efficiency and suitability of six well-known proposed matrices are assessed using the DRM.To achieve this goal,16 numerical examples and two criteria,namely,the number of iterations and the analysis time,are employed.Based on a comprehensive comparison,the methods are ranked according to the two criteria.The numerical findings clearly reveal the best techniques.Moreover,a variety of benchmark problems are suggested by the authors for future studies of cable structures.展开更多
We establish the convergence theories of the symmetric relaxation methods for the system of linear equations with symmetric positive definite coefficient matrix, and more generally, those of the unsymmetric relaxation...We establish the convergence theories of the symmetric relaxation methods for the system of linear equations with symmetric positive definite coefficient matrix, and more generally, those of the unsymmetric relaxation methods for the system of linear equations with positive definite matrix.展开更多
In this paper we propose some waveform relaxation (WR) methods for solving large systems of initial value problems. Nonlinear ODEs, linear ODEs, semi-explicit DAEs and linear DAEs are discussed. The accuracy increase ...In this paper we propose some waveform relaxation (WR) methods for solving large systems of initial value problems. Nonlinear ODEs, linear ODEs, semi-explicit DAEs and linear DAEs are discussed. The accuracy increase for WR methods is investigated.展开更多
This paper is concerned with the solvability and waveform relaxation methods of linear variable-coefficient differential-algebraic equations （DAEs）. Most of the previous works have been focused on linear variable-co...This paper is concerned with the solvability and waveform relaxation methods of linear variable-coefficient differential-algebraic equations （DAEs）. Most of the previous works have been focused on linear variable-coefficient DAEs with smooth coefficients and data, yet no results related to the convergence rate of the corresponding waveform relaxation methods has been obtained. In this paper, we develope the solvability theory for the linear variable-coefficient DAEs on Legesgue square-integrable function space in both traditional and least squares senses, and determine the convergence rate of the waveform relaxation methods for solving linear variable-coefficient DAEs.展开更多
Abstract In this paper,a class of generalized parallel matrix multisplitting relaxation methods for solving linear complementarity problems on the high speed multiprocessor systems is set up.This class of methods not ...Abstract In this paper,a class of generalized parallel matrix multisplitting relaxation methods for solving linear complementarity problems on the high speed multiprocessor systems is set up.This class of methods not only includes all the existing relaxation methods for the linear complementarity problems,but also yields a lot of novel ones in the sense of multisplitting.We establish the convergence theories of this class of generalized parallel multisplitting relaxation methods under the condition that the system matrix is an H matrix with positive diagonal elements.展开更多
The purpose is to accurately predict the performance of foil bearing and achieve accurate results in the design of foil bearing structure.A new type of foil bearing with surface microstructure is used as experimental ...The purpose is to accurately predict the performance of foil bearing and achieve accurate results in the design of foil bearing structure.A new type of foil bearing with surface microstructure is used as experimental material.First,the lubrication mechanism of elastic foil gas bearing is analyzed.Then,the numerical solution process of the static bearing capacity and friction torque is analyzed,including the discretization of the governing equation of rarefied gas pressure based on the non-dimensional modified Reynolds equation and the over relaxation iteration method,the grid planning within the calculation range,the static solution of boundary parameters and static solution of the numerical process.Finally,the solution program is analyzed.The experimental data in National Aeronautics and Space Administration(NASA)public literature are compared with the simulation results of this exploration,so as to judge the accuracy of the calculation process.The results show that under the same static load,the difference between the minimum film thickness calculated and the test results is not obvious;when the rotor speed of the bearing is 60000 r/min,the influence of the boundary slip effect increases with the increase of the micro groove depth on the flat foil surface;when the eccentricity or the micro groove depth of the bearing increases,the bearing capacity will be strengthened.When the eccentricity is 6µm and 14µm,the viscous friction torque of the new foil bearing increases significantly with the increase of the depth of the foil micro groove,but when the eccentricity is 22µm,the viscous friction torque does not change with the change of the depth of the foil micro groove.It shows that the bearing capacity and performance of foil bearing are improved.展开更多
This study explores free convective heat transfer in an electrically conducting nanofluid flow over a moving semi-infinite flat plate under the influence of an induced magnetic field and viscous dissipation.The veloci...This study explores free convective heat transfer in an electrically conducting nanofluid flow over a moving semi-infinite flat plate under the influence of an induced magnetic field and viscous dissipation.The velocity and magnetic field vectors are aligned at a distance from the plate.The Spectral Relaxation Method(SRM)is used to numerically solve the coupled nonlinear partial differential equations,analyzing the effects of the Eckert number on heat and mass transfer.Various nanofluids containing Cu,Ag,Al_(2)O_(3),and TiO_(2) nanoparticles are examined to assess how external magnetic fields influence fluid behavior.Key parameters,including the nanoparticle volume fraction ϕ,magnetic parameter M,magnetic Prandtl number Prm,and Eckert number Ec,are evaluated for their impact on velocity,induced magnetic field,and heat transfer.Results indicate that increasing the magnetic parameter reduces velocity and magnetic field components in alumina-water nanofluids,while a higher nanoparticle volume fraction enhances the thermal boundary layer.Greater viscous dissipation(Ec)increases temperature,and Al_(2)O_(3) nanofluids exhibit higher speeds than Cu,Ag,and TiO_(2) due to density differences.Silver-water nanofluids,with their higher density,move more slowly.The SRM results closely align with those from Maple,confirming the method’s accuracy.展开更多
In this paper, we propose an iterative relaxation method for solving the Hamilton-Jacobi-Bellman-Isaacs equation(HJBIE) arising in deterministic optimal control of affine nonlinear systems. Local convergence of the me...In this paper, we propose an iterative relaxation method for solving the Hamilton-Jacobi-Bellman-Isaacs equation(HJBIE) arising in deterministic optimal control of affine nonlinear systems. Local convergence of the method is established under fairly mild assumptions, and examples are solved to demonstrate the effectiveness of the method. An extension of the approach to Lyapunov equations is also discussed. The preliminary results presented are promising, and it is hoped that the approach will ultimately develop into an efficient computational tool for solving the HJBIEs.展开更多
A modified exact Jacobian semidefinite programming(SDP)relaxation method is proposed in this paper to solve the Celis-Dennis-Tapia(CDT)problem using the Jacobian matrix of objective and constraining polynomials.In the...A modified exact Jacobian semidefinite programming(SDP)relaxation method is proposed in this paper to solve the Celis-Dennis-Tapia(CDT)problem using the Jacobian matrix of objective and constraining polynomials.In the modified relaxation problem,the number of introduced constraints and the lowest relaxation order decreases significantly.At the same time,the finite convergence property is guaranteed.In addition,the proposed method can be applied to the quadratically constrained problem with two quadratic constraints.Moreover,the efficiency of the proposed method is verified by numerical experiments.展开更多
This paper mainly proposes a new C-XSC （C- for eXtended Scientific Computing） software for the symmetric single step method and relaxation method for computing an enclosure for the solution set and compares the meth...This paper mainly proposes a new C-XSC （C- for eXtended Scientific Computing） software for the symmetric single step method and relaxation method for computing an enclosure for the solution set and compares the methods with others＇ and then makes some modifications and finally, examples illustrating the applicability of the proposed methods are given.展开更多
In this paper, the asynchronous versions of classical iterative methods for solving linear systems of equations are considered. Sufficient conditions for convergence of asynchronous relaxed processes are given for H-m...In this paper, the asynchronous versions of classical iterative methods for solving linear systems of equations are considered. Sufficient conditions for convergence of asynchronous relaxed processes are given for H-matrix by which nor only the requirements of [3] on coefficient matrix are lowered, but also a larger region of convergence than that in [3] is obtained.展开更多
The Boltzmann-Bhatnagar-Gross-Krook（BGK）model is investigated for its validity regarding the collision term approximation through relaxation evaluation. The evaluation is based on theoretical analysis and numerical ...The Boltzmann-Bhatnagar-Gross-Krook（BGK）model is investigated for its validity regarding the collision term approximation through relaxation evaluation. The evaluation is based on theoretical analysis and numerical comparison between the BGK and direct simulation Monte Carlo（DSMC） results for three specifically designed relaxation problems. In these problems, one or half component of the velocity distribution is characterized by another Maxwellian distribution with a different temperature. It is analyzed that the relaxation time in the BGK model is unequal to the molecular mean collision time. Relaxation of component distribution fails to involve enough contribution from other component distributions, which makes the BGK model unable to capture details of velocity distribution, especially when discontinuity exists in distribution. The BGK model,however, predicts satisfactory results including fluxes during relaxation when the temperature difference is small. Particularly, the model-induced error in the BGK model increases with the temperature difference, thus the model is more reliable for low-speed rarefied flows than for hypersonic flows.展开更多
The classical variational inequality problem with a Lipschitzian and strongly monotone operator on a nonempty closed convex subset in a real Hilbert space is studied. A new three-step relaxed hybrid steepest-descent m...The classical variational inequality problem with a Lipschitzian and strongly monotone operator on a nonempty closed convex subset in a real Hilbert space is studied. A new three-step relaxed hybrid steepest-descent method for this class of variational inequalities is introduced. Strong convergence of this method is established under suitable assumptions imposed on the algorithm parameters.展开更多
In this paper,we propose a new analysis framework to study the linear convergence of relaxed operator splitting methods,which can be viewed as an extension of the classic Krasnosel'skii-Mann iteration and Banach-P...In this paper,we propose a new analysis framework to study the linear convergence of relaxed operator splitting methods,which can be viewed as an extension of the classic Krasnosel'skii-Mann iteration and Banach-Picard contraction.As applications,we derive the linear convergence of the generalized proximal point algorithm and the relaxed forward-backward splitting method in a simple and elegant way.展开更多
基金Supported by the National Natural Science Foundation of China(Grant Nos.11871136,11801382,11971092)the Fundamental Research Funds for the Central Universities(Grant No.DUT19LK06)。
文摘The relaxation methods have served as very efficient tools for solving linear system and have many important applications in the field of science and engineering.In this paper,we study an efficient relaxation method based on the well-known Gauss-Seidel iteration method.Theoretical analysis shows our method can converge to the unique solution of the linear system.In addition,our method is applied to solve the saddle point problem and Page Rank problem,and the numerical results show our method is more powerful than the existent relaxation methods.
文摘By further generalizing Frommer's results in the sense of nonlinear multisplitting, we build a class of nonlinear multisplitting AOR-type methods, which covers many rather practical nonlinear multisplitting relaxation methods such as multisplitting AOR-Newton method, multisplitting AOR-chord method and multisplitting AOR-Steffensen method, etc.. Furthermore,a general convergence theorem for the nonlinear multisplitting AOR-type methods and the local convergence for the multisplitting AOR-Newton method are discussed in detail.A lot of numerical tests show that our new methods are feasible and satisfactory.
基金Subsidized by The Special Funds For Major State Basic Research Projects G1999032803.
文摘Asynchronous parallel multisplitting relaxation methods for solving large sparse linear complementarity problems are presented, and their convergence is proved when the system matrices are H-matrices having positive diagonal elements. Moreover, block and multi-parameter variants of the new methods, together with their convergence properties, are investigated in detail. Numerical results show that these new methods can achieve high parallel efficiency for solving the large sparse linear complementarity problems on multiprocessor systems.
基金supported by National Natural Science Foundation of China(NSFC 50376041)the Shu Guang Project of Shanghai Educational Development Foundation(04SG49)the DFG projects(grant Ri 533/7-1 and Ri 533/7-2)
文摘A new algorithm of the relaxation method is developed for the inversion of forward scattered light to obtain the size distribution of spherical particles. Numerical tests are performed for a laser particle analyzer using the Mie theory and the diffraction approximation. The algorithm efficiency, in the presence of experimental noises, is studied. The results show that the technique is fast in convergence, stable against random noise and insensitive to the distribution of particles and the initial trial distribution.
文摘Two main methods, inactive eiement method and quiet element method, to simulate the process of multilayer ：and multipass welding：were reviewed, and the shortcomings of both methods were diScussed as well Based on these analyses, a method called node dynamic relaxation method was put into forward to simulate the multilayer and multipass welding process, and the principle and application of this method were discussed in detail. The simulating results show that using the node dynamic relaxation method can decrease mesh distortion, improve calculation efficiency, and obtain good simulation results. This method can also be used in the field of simulation addition or removing materials in finite element analysis.
基金the National Natural Science Foundation of China(Nos.11871196,12071133 and 12071112)the China Postdoctoral Science Foundation(No.2017M622340)+1 种基金the Key Scientific and Technological Research Projects of Henan Province(Nos.202102210147 and 192102210114)the Science and Technology Climbing Program of Henan Institute of Science and Technology(No.2018JY01).
文摘This paper presents an efficient algorithm for globally solving a generalized linear fractional programming problem.For establishing this algorithm,we firstly construct a two-level linear relaxation method,and by utilizing the method,we can convert the initial generalized linear fractional programming problem and its subproblems into a series of linear programming relaxation problems.Based on the branch-and-bound framework and linear programming relaxation problems,a branch-and-bound algorithm is presented for globally solving the generalized linear fractional programming problem,and the computational complexity of the algorithm is given.Finally,numerical experimental results demonstrate the feasibility and efficiency of the proposed algorithm.
文摘The analysis of cable structures is one of the most challenging problems for civil and mechanical engineers.Because they have highly nonlinear behavior,it is difficult to find solutions to these problems.Thus far,different assumptions and methods have been proposed to solve such structures.The dynamic relaxation method(DRM)is an explicit procedure for analyzing these types of structures.To utilize this scheme,investigators have suggested various stiffness matrices for a cable element.In this study,the efficiency and suitability of six well-known proposed matrices are assessed using the DRM.To achieve this goal,16 numerical examples and two criteria,namely,the number of iterations and the analysis time,are employed.Based on a comprehensive comparison,the methods are ranked according to the two criteria.The numerical findings clearly reveal the best techniques.Moreover,a variety of benchmark problems are suggested by the authors for future studies of cable structures.
文摘We establish the convergence theories of the symmetric relaxation methods for the system of linear equations with symmetric positive definite coefficient matrix, and more generally, those of the unsymmetric relaxation methods for the system of linear equations with positive definite matrix.
文摘In this paper we propose some waveform relaxation (WR) methods for solving large systems of initial value problems. Nonlinear ODEs, linear ODEs, semi-explicit DAEs and linear DAEs are discussed. The accuracy increase for WR methods is investigated.
文摘This paper is concerned with the solvability and waveform relaxation methods of linear variable-coefficient differential-algebraic equations （DAEs）. Most of the previous works have been focused on linear variable-coefficient DAEs with smooth coefficients and data, yet no results related to the convergence rate of the corresponding waveform relaxation methods has been obtained. In this paper, we develope the solvability theory for the linear variable-coefficient DAEs on Legesgue square-integrable function space in both traditional and least squares senses, and determine the convergence rate of the waveform relaxation methods for solving linear variable-coefficient DAEs.
文摘Abstract In this paper,a class of generalized parallel matrix multisplitting relaxation methods for solving linear complementarity problems on the high speed multiprocessor systems is set up.This class of methods not only includes all the existing relaxation methods for the linear complementarity problems,but also yields a lot of novel ones in the sense of multisplitting.We establish the convergence theories of this class of generalized parallel multisplitting relaxation methods under the condition that the system matrix is an H matrix with positive diagonal elements.
文摘The purpose is to accurately predict the performance of foil bearing and achieve accurate results in the design of foil bearing structure.A new type of foil bearing with surface microstructure is used as experimental material.First,the lubrication mechanism of elastic foil gas bearing is analyzed.Then,the numerical solution process of the static bearing capacity and friction torque is analyzed,including the discretization of the governing equation of rarefied gas pressure based on the non-dimensional modified Reynolds equation and the over relaxation iteration method,the grid planning within the calculation range,the static solution of boundary parameters and static solution of the numerical process.Finally,the solution program is analyzed.The experimental data in National Aeronautics and Space Administration(NASA)public literature are compared with the simulation results of this exploration,so as to judge the accuracy of the calculation process.The results show that under the same static load,the difference between the minimum film thickness calculated and the test results is not obvious;when the rotor speed of the bearing is 60000 r/min,the influence of the boundary slip effect increases with the increase of the micro groove depth on the flat foil surface;when the eccentricity or the micro groove depth of the bearing increases,the bearing capacity will be strengthened.When the eccentricity is 6µm and 14µm,the viscous friction torque of the new foil bearing increases significantly with the increase of the depth of the foil micro groove,but when the eccentricity is 22µm,the viscous friction torque does not change with the change of the depth of the foil micro groove.It shows that the bearing capacity and performance of foil bearing are improved.
文摘This study explores free convective heat transfer in an electrically conducting nanofluid flow over a moving semi-infinite flat plate under the influence of an induced magnetic field and viscous dissipation.The velocity and magnetic field vectors are aligned at a distance from the plate.The Spectral Relaxation Method(SRM)is used to numerically solve the coupled nonlinear partial differential equations,analyzing the effects of the Eckert number on heat and mass transfer.Various nanofluids containing Cu,Ag,Al_(2)O_(3),and TiO_(2) nanoparticles are examined to assess how external magnetic fields influence fluid behavior.Key parameters,including the nanoparticle volume fraction ϕ,magnetic parameter M,magnetic Prandtl number Prm,and Eckert number Ec,are evaluated for their impact on velocity,induced magnetic field,and heat transfer.Results indicate that increasing the magnetic parameter reduces velocity and magnetic field components in alumina-water nanofluids,while a higher nanoparticle volume fraction enhances the thermal boundary layer.Greater viscous dissipation(Ec)increases temperature,and Al_(2)O_(3) nanofluids exhibit higher speeds than Cu,Ag,and TiO_(2) due to density differences.Silver-water nanofluids,with their higher density,move more slowly.The SRM results closely align with those from Maple,confirming the method’s accuracy.
文摘In this paper, we propose an iterative relaxation method for solving the Hamilton-Jacobi-Bellman-Isaacs equation(HJBIE) arising in deterministic optimal control of affine nonlinear systems. Local convergence of the method is established under fairly mild assumptions, and examples are solved to demonstrate the effectiveness of the method. An extension of the approach to Lyapunov equations is also discussed. The preliminary results presented are promising, and it is hoped that the approach will ultimately develop into an efficient computational tool for solving the HJBIEs.
基金Fundamental Research Funds for the Central Universities,China(No.2232019D3-38)Shanghai Sailing Program,China(No.22YF1400900)。
文摘A modified exact Jacobian semidefinite programming(SDP)relaxation method is proposed in this paper to solve the Celis-Dennis-Tapia(CDT)problem using the Jacobian matrix of objective and constraining polynomials.In the modified relaxation problem,the number of introduced constraints and the lowest relaxation order decreases significantly.At the same time,the finite convergence property is guaranteed.In addition,the proposed method can be applied to the quadratically constrained problem with two quadratic constraints.Moreover,the efficiency of the proposed method is verified by numerical experiments.
文摘This paper mainly proposes a new C-XSC （C- for eXtended Scientific Computing） software for the symmetric single step method and relaxation method for computing an enclosure for the solution set and compares the methods with others＇ and then makes some modifications and finally, examples illustrating the applicability of the proposed methods are given.
文摘In this paper, the asynchronous versions of classical iterative methods for solving linear systems of equations are considered. Sufficient conditions for convergence of asynchronous relaxed processes are given for H-matrix by which nor only the requirements of [3] on coefficient matrix are lowered, but also a larger region of convergence than that in [3] is obtained.
基金supported by the National Natural Science Foundation of China(91116013,11372325,and 11111120080)
文摘The Boltzmann-Bhatnagar-Gross-Krook（BGK）model is investigated for its validity regarding the collision term approximation through relaxation evaluation. The evaluation is based on theoretical analysis and numerical comparison between the BGK and direct simulation Monte Carlo（DSMC） results for three specifically designed relaxation problems. In these problems, one or half component of the velocity distribution is characterized by another Maxwellian distribution with a different temperature. It is analyzed that the relaxation time in the BGK model is unequal to the molecular mean collision time. Relaxation of component distribution fails to involve enough contribution from other component distributions, which makes the BGK model unable to capture details of velocity distribution, especially when discontinuity exists in distribution. The BGK model,however, predicts satisfactory results including fluxes during relaxation when the temperature difference is small. Particularly, the model-induced error in the BGK model increases with the temperature difference, thus the model is more reliable for low-speed rarefied flows than for hypersonic flows.
基金Project supported by the Key Science Foundation of Education Department of Sichuan Province of China (No.2003A081)Sichuan Province Leading Academic Discipline Project (No.SZD0406)
文摘The classical variational inequality problem with a Lipschitzian and strongly monotone operator on a nonempty closed convex subset in a real Hilbert space is studied. A new three-step relaxed hybrid steepest-descent method for this class of variational inequalities is introduced. Strong convergence of this method is established under suitable assumptions imposed on the algorithm parameters.
基金Supported by the National Natural Science Foundation of China(Grant Nos.1180145511871059+4 种基金11971238)China Postdoctoral Science Foundation(Grant Nos.2019M6634592020T130081)the Applied Basic Project of Sichuan Province(Grant No.2020YJ0111)the Open Project of Key Laboratory of School of Mathematical Sciences,Chongqing Normal University(Grant No.CSSXKFKTM202004)。
文摘In this paper,we propose a new analysis framework to study the linear convergence of relaxed operator splitting methods,which can be viewed as an extension of the classic Krasnosel'skii-Mann iteration and Banach-Picard contraction.As applications,we derive the linear convergence of the generalized proximal point algorithm and the relaxed forward-backward splitting method in a simple and elegant way.
