Parallel synchronous algorithm for nonlinear fixed point problems.
Addou, Ahmed, Benahmed, Abdenasser (2005)
International Journal of Mathematics and Mathematical Sciences
Similarity:
Addou, Ahmed, Benahmed, Abdenasser (2005)
International Journal of Mathematics and Mathematical Sciences
Similarity:
Zhang, J., Huang, X.X. (2010)
Journal of Inequalities and Applications [electronic only]
Similarity:
Jianghua, Fan, Xiaoguo, Wang (2007)
Abstract and Applied Analysis
Similarity:
Zhensheng Yu, Qiang Li (2009)
Applications of Mathematics
Similarity:
By using some NCP functions, we reformulate the extended linear complementarity problem as a nonsmooth equation. Then we propose a self-adaptive trust region algorithm for solving this nonsmooth equation. The novelty of this method is that the trust region radius is controlled by the objective function value which can be adjusted automatically according to the algorithm. The global convergence is obtained under mild conditions and the local superlinear convergence rate is also established...
Jingyong Tang, Guoping He, Li Dong, Liang Fang (2012)
Applications of Mathematics
Similarity:
In this paper, we present a new one-step smoothing Newton method for solving the second-order cone programming (SOCP). Based on a new smoothing function of the well-known Fischer-Burmeister function, the SOCP is approximated by a family of parameterized smooth equations. Our algorithm solves only one system of linear equations and performs only one Armijo-type line search at each iteration. It can start from an arbitrary initial point and does not require the iterative points to be...
Noor, Muhammad Aslam, Wang, Yi Ju, Xiu, Naihua (2002)
JIPAM. Journal of Inequalities in Pure & Applied Mathematics [electronic only]
Similarity:
Jingyong Tang, Li Dong, Liang Fang, Li Sun (2015)
Applications of Mathematics
Similarity:
The smoothing-type algorithm is a powerful tool for solving the second-order cone programming (SOCP), which is in general designed based on a monotone line search. In this paper, we propose a smoothing-type algorithm for solving the SOCP with a non-monotone line search. By using the theory of Euclidean Jordan algebras, we prove that the proposed algorithm is globally and locally quadratically convergent under suitable assumptions. The preliminary numerical results are also reported which...
Tawhid, M. (2009)
JIPAM. Journal of Inequalities in Pure & Applied Mathematics [electronic only]
Similarity: