We propose a novel inverse-free neurodynamic approach (NIFNA) for solving absolute value equations (AVE). The NIFNA guarantees global convergence and notably improves convergence speed by achieving fixed-time converge...We propose a novel inverse-free neurodynamic approach (NIFNA) for solving absolute value equations (AVE). The NIFNA guarantees global convergence and notably improves convergence speed by achieving fixed-time convergence. To validate the theoretical findings, numerical simulations are conducted, demonstrating the effectiveness and efficiency of the proposed NIFNA.展开更多
Based on concave function, the problem of finding the sparse solution of absolute value equations is relaxed to a concave programming, and its corresponding algorithm is proposed, whose main part is solving a series o...Based on concave function, the problem of finding the sparse solution of absolute value equations is relaxed to a concave programming, and its corresponding algorithm is proposed, whose main part is solving a series of linear programming. It is proved that a sparse solution can be found under the assumption that the connected matrixes have range space property(RSP). Numerical experiments are also conducted to verify the efficiency of the proposed algorithm.展开更多
The system of generalized absolute value equations(GAVE)has attracted more and more attention in the optimization community.In this paper,by introducing a smoothing function,we develop a smoothing Newton algorithm wit...The system of generalized absolute value equations(GAVE)has attracted more and more attention in the optimization community.In this paper,by introducing a smoothing function,we develop a smoothing Newton algorithm with non-monotone line search to solve the GAVE.We show that the non-monotone algorithm is globally and locally quadratically convergent under a weaker assumption than those given in most existing algorithms for solving the GAVE.Numerical results are given to demonstrate the viability and efficiency of the approach.展开更多
Recently,Yu et al.presented a modified fixed point iterative(MFPI)method for solving large sparse absolute value equation(AVE).In this paper,we consider using accelerated overrelaxation(AOR)splitting to develop the mo...Recently,Yu et al.presented a modified fixed point iterative(MFPI)method for solving large sparse absolute value equation(AVE).In this paper,we consider using accelerated overrelaxation(AOR)splitting to develop the modified fixed point iteration(denoted by MFPI-JS and MFPI-GSS)methods for solving AVE.Furthermore,the convergence analysis of the MFPI-JS and MFPI-GSS methods for AVE are also studied under suitable restrictions on the iteration parameters,and the functional equation between the parameter T and matrix Q.Finally,numerical examples show that the MFPI-JS and MFPI-GSS are efficient iteration methods.展开更多
This paper is concerned with solving some structured multi-linear systems, which are called tensor absolute value equations. This kind of absolute value equations is closely related to tensor complementarity problems ...This paper is concerned with solving some structured multi-linear systems, which are called tensor absolute value equations. This kind of absolute value equations is closely related to tensor complementarity problems and is a generalization of the well-known absolute value equations in the matrix case. We prove that tensor absolute value equations are equivalent to some special structured tensor complementary problems. Some sufficient conditions are given to guarantee the existence of solutions for tensor absolute value equations. We also propose a Levenberg-Marquardt-type algorithm for solving some given tensor absolute value equations and preliminary numerical results are reported to indicate the efficiency of the proposed algorithm.展开更多
In this paper,we consider the tensor absolute value equations(TAVEs),which is a newly introduced problem in the context of multilinear systems.Although the system of the TAVEs is an interesting generalization of matri...In this paper,we consider the tensor absolute value equations(TAVEs),which is a newly introduced problem in the context of multilinear systems.Although the system of the TAVEs is an interesting generalization of matrix absolute value equations(AVEs),the well-developed theory and algorithms for the AVEs are not directly applicable to the TAVEs due to the nonlinearity(or multilinearity)of the problem under consideration.Therefore,we first study the solutions existence of some classes of the TAVEs with the help of degree theory,in addition to showing,by fixed point theory,that the system of the TAVEs has at least one solution under some checkable conditions.Then,we give a bound of solutions of the TAVEs for some special cases.To find a solution to the TAVEs,we employ the generalized Newton method and report some preliminary results.展开更多
On one hand,to find the sparsest solution to the system of linear equations has been a major focus since it has a large number of applications in many areas;and on the other hand,the system of absolute value equations...On one hand,to find the sparsest solution to the system of linear equations has been a major focus since it has a large number of applications in many areas;and on the other hand,the system of absolute value equations(AVEs)has attracted a lot of attention since many practical problems can be equivalently transformed as a system of AVEs.Motivated by the development of these two aspects,we consider the problem to find the sparsest solution to the system of AVEs in this paper.We first propose the model of the concerned problem,i.e.,to find the solution to the system of AVEs with the minimum l0-norm.Since l0-norm is difficult to handle,we relax the problem into a convex optimization problem and discuss the necessary and sufficient conditions to guarantee the existence of the unique solution to the convex relaxation problem.Then,we prove that under such conditions the unique solution to the convex relaxation is exactly the sparsest solution to the system of AVEs.When the concerned system of AVEs reduces to the system of linear equations,the obtained results reduce to those given in the literature.The theoretical results obtained in this paper provide an important basis for designing numerical method to find the sparsest solution to the system of AVEs.展开更多
In this paper,based on the previous published work by Ke et al.(2019)and Li et al.(2022),by using the matrix splitting technique,generalized fixed point iteration method(GFPI)is established to solve the absolute value...In this paper,based on the previous published work by Ke et al.(2019)and Li et al.(2022),by using the matrix splitting technique,generalized fixed point iteration method(GFPI)is established to solve the absolute value equation(AVE).The proposed method not only includes SOR-like method,FPI method,MFPI method and so on,but also generates some special versions.Some convergence conditions of the proposed method with different iteration error norms are presented.Furthermore,methods corresponding to other splitting methods are studied in detail.The effectiveness and feasibility of the proposed method are confirmed by some numerical experiments.展开更多
文摘We propose a novel inverse-free neurodynamic approach (NIFNA) for solving absolute value equations (AVE). The NIFNA guarantees global convergence and notably improves convergence speed by achieving fixed-time convergence. To validate the theoretical findings, numerical simulations are conducted, demonstrating the effectiveness and efficiency of the proposed NIFNA.
文摘Based on concave function, the problem of finding the sparse solution of absolute value equations is relaxed to a concave programming, and its corresponding algorithm is proposed, whose main part is solving a series of linear programming. It is proved that a sparse solution can be found under the assumption that the connected matrixes have range space property(RSP). Numerical experiments are also conducted to verify the efficiency of the proposed algorithm.
基金supported by the Natural Science Foundation of Fujian Province(Grant No.2021J01661)by the National Natural Science Foundation of China(Grant No.11901024)+5 种基金supported by the National Natural Science Foundation of China(Grant No.12201275)by the Ministry of Education in China of Humanities and Social Science Project(Grant No.21YJCZH204)by the Liaoning Provincial Department of Education(Grant No.JYTZD2023072)supported by the National Natural Science Foundation of China(Grant No.12131004)by the Ministry of Science and Technology of China(Grant No.2021YFA1003600)supported by the National Key Research and Development Program of China(Grant No.2019YFC0312003).
文摘The system of generalized absolute value equations(GAVE)has attracted more and more attention in the optimization community.In this paper,by introducing a smoothing function,we develop a smoothing Newton algorithm with non-monotone line search to solve the GAVE.We show that the non-monotone algorithm is globally and locally quadratically convergent under a weaker assumption than those given in most existing algorithms for solving the GAVE.Numerical results are given to demonstrate the viability and efficiency of the approach.
基金supported by the National Natural Science Foundation of China (Grant 12371378)by the Natural Science Foundation of Fujian Province (Grant 2023J011127).
文摘Recently,Yu et al.presented a modified fixed point iterative(MFPI)method for solving large sparse absolute value equation(AVE).In this paper,we consider using accelerated overrelaxation(AOR)splitting to develop the modified fixed point iteration(denoted by MFPI-JS and MFPI-GSS)methods for solving AVE.Furthermore,the convergence analysis of the MFPI-JS and MFPI-GSS methods for AVE are also studied under suitable restrictions on the iteration parameters,and the functional equation between the parameter T and matrix Q.Finally,numerical examples show that the MFPI-JS and MFPI-GSS are efficient iteration methods.
基金supported by National Natural Science Foundation of China (Grant Nos. 11671220, 11401331, 11771244 and 11271221)the Nature Science Foundation of Shandong Province (Grant Nos. ZR2015AQ013 and ZR2016AM29)the Hong Kong Research Grant Council (Grant Nos. PolyU 501913,15302114, 15300715 and 15301716)
文摘This paper is concerned with solving some structured multi-linear systems, which are called tensor absolute value equations. This kind of absolute value equations is closely related to tensor complementarity problems and is a generalization of the well-known absolute value equations in the matrix case. We prove that tensor absolute value equations are equivalent to some special structured tensor complementary problems. Some sufficient conditions are given to guarantee the existence of solutions for tensor absolute value equations. We also propose a Levenberg-Marquardt-type algorithm for solving some given tensor absolute value equations and preliminary numerical results are reported to indicate the efficiency of the proposed algorithm.
基金supported by National Natural Science Foundation of China(Grant Nos.11571087 and 11771113)Natural Science Foundation of Zhejiang Province(Grant No.LY17A010028)supported by the Hong Kong Research Grant Council(Grant Nos.PolyU 15302114,15300715,15301716 and 15300717)。
文摘In this paper,we consider the tensor absolute value equations(TAVEs),which is a newly introduced problem in the context of multilinear systems.Although the system of the TAVEs is an interesting generalization of matrix absolute value equations(AVEs),the well-developed theory and algorithms for the AVEs are not directly applicable to the TAVEs due to the nonlinearity(or multilinearity)of the problem under consideration.Therefore,we first study the solutions existence of some classes of the TAVEs with the help of degree theory,in addition to showing,by fixed point theory,that the system of the TAVEs has at least one solution under some checkable conditions.Then,we give a bound of solutions of the TAVEs for some special cases.To find a solution to the TAVEs,we employ the generalized Newton method and report some preliminary results.
基金This work was supported in part by the National Natural Science Foundation of China(Nos.11171252,11201332 and 11431002).
文摘On one hand,to find the sparsest solution to the system of linear equations has been a major focus since it has a large number of applications in many areas;and on the other hand,the system of absolute value equations(AVEs)has attracted a lot of attention since many practical problems can be equivalently transformed as a system of AVEs.Motivated by the development of these two aspects,we consider the problem to find the sparsest solution to the system of AVEs in this paper.We first propose the model of the concerned problem,i.e.,to find the solution to the system of AVEs with the minimum l0-norm.Since l0-norm is difficult to handle,we relax the problem into a convex optimization problem and discuss the necessary and sufficient conditions to guarantee the existence of the unique solution to the convex relaxation problem.Then,we prove that under such conditions the unique solution to the convex relaxation is exactly the sparsest solution to the system of AVEs.When the concerned system of AVEs reduces to the system of linear equations,the obtained results reduce to those given in the literature.The theoretical results obtained in this paper provide an important basis for designing numerical method to find the sparsest solution to the system of AVEs.
基金Supported by the National Natural Science Foundation of China(Grant No.12371378)the Natural Science Foundation of Fujian Province(Grant No.2024J01980)。
文摘In this paper,based on the previous published work by Ke et al.(2019)and Li et al.(2022),by using the matrix splitting technique,generalized fixed point iteration method(GFPI)is established to solve the absolute value equation(AVE).The proposed method not only includes SOR-like method,FPI method,MFPI method and so on,but also generates some special versions.Some convergence conditions of the proposed method with different iteration error norms are presented.Furthermore,methods corresponding to other splitting methods are studied in detail.The effectiveness and feasibility of the proposed method are confirmed by some numerical experiments.
