A new trust region algorithm for solving convex LC 1 optimization problem is presented.It is proved that the algorithm is globally convergent and the rate of convergence is superlinear under some reasonable assum...A new trust region algorithm for solving convex LC 1 optimization problem is presented.It is proved that the algorithm is globally convergent and the rate of convergence is superlinear under some reasonable assumptions.展开更多
In this paper we present a filter-trust-region algorithm for solving LC1 unconstrained optimization problems which uses the second Dini upper directional derivative. We establish the global convergence of the algorith...In this paper we present a filter-trust-region algorithm for solving LC1 unconstrained optimization problems which uses the second Dini upper directional derivative. We establish the global convergence of the algorithm under reasonable assumptions.展开更多
A trust-region algorithm is presented for a nonlinear optimization problem of equality-constraints. The characterization of the algorithm is using inexact gradient information. Global convergence results are demonstra...A trust-region algorithm is presented for a nonlinear optimization problem of equality-constraints. The characterization of the algorithm is using inexact gradient information. Global convergence results are demonstrated where the gradient values are obeyed a simple relative error condition.展开更多
A class of trust region methods for solving linear inequality constrained problems is proposed in this paper. It is shown that the algorithm is of global convergence.The algorithm uses a version of the two-sided proje...A class of trust region methods for solving linear inequality constrained problems is proposed in this paper. It is shown that the algorithm is of global convergence.The algorithm uses a version of the two-sided projection and the strategy of the unconstrained trust region methods. It keeps the good convergence properties of the unconstrained case and has the merits of the projection method. In some sense, our algorithm can be regarded as an extension and improvement of the projected type algorithm.展开更多
This paper presents a trust region two phase model algorithm for solving the equality and bound constrained nonlinear optimization problem. A concept of substationary point is given. Under suitable assumptions,the gl...This paper presents a trust region two phase model algorithm for solving the equality and bound constrained nonlinear optimization problem. A concept of substationary point is given. Under suitable assumptions,the global convergence of this algorithm is proved without assuming the linear independence of the gradient of active constraints. A numerical example is also presented.展开更多
A trust region algorithm for equality constrained optimization is given in this paper.The algorithm does not enforce strict monotonicity of the merit function for every iteration.Global convergence of the algorithm i...A trust region algorithm for equality constrained optimization is given in this paper.The algorithm does not enforce strict monotonicity of the merit function for every iteration.Global convergence of the algorithm is proved under the same conditions of usual trust region method.展开更多
With the rapid growth of Internet of Things(IoT)based models,and the lack amount of data makes cloud computing resources insufficient.Hence,edge computing-based techniques are becoming more popular in present research...With the rapid growth of Internet of Things(IoT)based models,and the lack amount of data makes cloud computing resources insufficient.Hence,edge computing-based techniques are becoming more popular in present research domains that makes data storage,and processing effective at the network edges.There are several advanced features like parallel processing and data perception are available in edge computing.Still,there are some challenges in providing privacy and data security over networks.To solve the security issues in Edge Computing,Hash-based Message Authentication Code(HMAC)algorithm is used to provide solutions for preserving data from various attacks that happens with the distributed network nature.This paper proposed a Trust Model for Secure Data Sharing(TM-SDS)with HMAC algorithm.Here,data security is ensured with local and global trust levels with the centralized processing of cloud and by conserving resources effectively.Further,the proposed model achieved 84.25%of packet delivery ratio which is better compared to existing models in the resulting phase.The data packets are securely transmitted between entities in the proposed model and results showed that proposed TM-SDS model outperforms the existing models in an efficient manner.展开更多
It is well known that trust region methods are very effective for optimization problems. In this article, a new adaptive trust region method is presented for solving uncon- strained optimization problems. The proposed...It is well known that trust region methods are very effective for optimization problems. In this article, a new adaptive trust region method is presented for solving uncon- strained optimization problems. The proposed method combines a modified secant equation with the BFGS updated formula and an adaptive trust region radius, where the new trust region radius makes use of not only the function information but also the gradient information. Under suitable conditions, global convergence is proved, and we demonstrate the local superlinear convergence of the proposed method. The numerical results indicate that the proposed method is very efficient.展开更多
A number of companies have employed Global Software Development (GSD) methodology as a useful tool for their software development practices. GSD is a contractual relationship between client and vendor organizations in...A number of companies have employed Global Software Development (GSD) methodology as a useful tool for their software development practices. GSD is a contractual relationship between client and vendor organizations in which a client outsources all or some part of its software development activities to a vendor. The vendor in return provides the agreed services in lieu of certain amount of remuneration. The main reasons to select the GSD technique include reduced cost, faster development and access to skilled manpower. Though GSD is emerging as an effective technique, but it suffers from many challenges like poor communication, lack of trust and coordination. These challenges pose serious risk to the smooth execution of the GSD projects. In this paper, we present a comparative study on GSD to highlight its merits and demerits. Our findings reveal that much of the research in this area has been focused on addressing issues faced by client organizations, however, vendor side in the GSD relationship is much ignored due to which this area is still immature;and, hence, further research work is required to be undertaken to address the issues faced by the vendor organizations.展开更多
The trust region method plays an important role in solving optimization problems. In this paper, we propose a new nonmonotone adaptive trust region method for solving unconstrained optimization problems. Actually, we ...The trust region method plays an important role in solving optimization problems. In this paper, we propose a new nonmonotone adaptive trust region method for solving unconstrained optimization problems. Actually, we combine a popular nonmonotone technique with an adaptive trust region algorithm. The new ratio to adjusting the next trust region radius is different from the ratio in the traditional trust region methods. Under some appropriate conditions, we show that the new algorithm has good global convergence and superlinear convergence.展开更多
In this paper, we propose a nonmonotone adap-tive trust-region method for solving symmetric nonlinear equations problems. The convergent result of the presented method will be estab-lished under favorable conditions. ...In this paper, we propose a nonmonotone adap-tive trust-region method for solving symmetric nonlinear equations problems. The convergent result of the presented method will be estab-lished under favorable conditions. Numerical results are reported.展开更多
In this paper, we propose and analyze a non-monotone trust region method with non-monotone line search strategy for unconstrained optimization problems. Unlike the traditional non-monotone trust region method, our alg...In this paper, we propose and analyze a non-monotone trust region method with non-monotone line search strategy for unconstrained optimization problems. Unlike the traditional non-monotone trust region method, our algorithm utilizes non-monotone Wolfe line search to get the next point if a trial step is not adopted. Thus, it can reduce the number of solving sub-problems. Theoretical analysis shows that the new proposed method has a global convergence under some mild conditions.展开更多
基金Supported by the National Natural Science Foundation of P.R.China(1 9971 0 0 2 ) and the Subject ofBeijing Educational Committ
文摘A new trust region algorithm for solving convex LC 1 optimization problem is presented.It is proved that the algorithm is globally convergent and the rate of convergence is superlinear under some reasonable assumptions.
基金Supported by CERG: CityU 101005 of the Government of Hong Kong SAR, Chinathe National Natural ScienceFoundation of China, the Specialized Research Fund of Doctoral Program of Higher Education of China (Grant No.20040319003)the Natural Science Fund of Jiangsu Province of China (Grant No. BK2006214)
文摘In this paper we present a filter-trust-region algorithm for solving LC1 unconstrained optimization problems which uses the second Dini upper directional derivative. We establish the global convergence of the algorithm under reasonable assumptions.
文摘A trust-region algorithm is presented for a nonlinear optimization problem of equality-constraints. The characterization of the algorithm is using inexact gradient information. Global convergence results are demonstrated where the gradient values are obeyed a simple relative error condition.
文摘A class of trust region methods for solving linear inequality constrained problems is proposed in this paper. It is shown that the algorithm is of global convergence.The algorithm uses a version of the two-sided projection and the strategy of the unconstrained trust region methods. It keeps the good convergence properties of the unconstrained case and has the merits of the projection method. In some sense, our algorithm can be regarded as an extension and improvement of the projected type algorithm.
文摘This paper presents a trust region two phase model algorithm for solving the equality and bound constrained nonlinear optimization problem. A concept of substationary point is given. Under suitable assumptions,the global convergence of this algorithm is proved without assuming the linear independence of the gradient of active constraints. A numerical example is also presented.
文摘A trust region algorithm for equality constrained optimization is given in this paper.The algorithm does not enforce strict monotonicity of the merit function for every iteration.Global convergence of the algorithm is proved under the same conditions of usual trust region method.
文摘With the rapid growth of Internet of Things(IoT)based models,and the lack amount of data makes cloud computing resources insufficient.Hence,edge computing-based techniques are becoming more popular in present research domains that makes data storage,and processing effective at the network edges.There are several advanced features like parallel processing and data perception are available in edge computing.Still,there are some challenges in providing privacy and data security over networks.To solve the security issues in Edge Computing,Hash-based Message Authentication Code(HMAC)algorithm is used to provide solutions for preserving data from various attacks that happens with the distributed network nature.This paper proposed a Trust Model for Secure Data Sharing(TM-SDS)with HMAC algorithm.Here,data security is ensured with local and global trust levels with the centralized processing of cloud and by conserving resources effectively.Further,the proposed model achieved 84.25%of packet delivery ratio which is better compared to existing models in the resulting phase.The data packets are securely transmitted between entities in the proposed model and results showed that proposed TM-SDS model outperforms the existing models in an efficient manner.
基金Supported by the National Natural Science Foundation of China （10231060）, the Special Research Found of Doctoral Program of Higher Education of China（200d0319003 ）, the Research Project of Xuzhou Institute of Technology（ XKY200622）.
基金Supported by the National Natural Science Foundation of China(11661009)the Guangxi Science Fund for Distinguished Young Scholars(2015GXNSFGA139001)+1 种基金the Guangxi Natural Science Key Fund(2017GXNSFDA198046)the Basic Ability Promotion Project of Guangxi Young and Middle-Aged Teachers(2017KY0019)
文摘It is well known that trust region methods are very effective for optimization problems. In this article, a new adaptive trust region method is presented for solving uncon- strained optimization problems. The proposed method combines a modified secant equation with the BFGS updated formula and an adaptive trust region radius, where the new trust region radius makes use of not only the function information but also the gradient information. Under suitable conditions, global convergence is proved, and we demonstrate the local superlinear convergence of the proposed method. The numerical results indicate that the proposed method is very efficient.
文摘A number of companies have employed Global Software Development (GSD) methodology as a useful tool for their software development practices. GSD is a contractual relationship between client and vendor organizations in which a client outsources all or some part of its software development activities to a vendor. The vendor in return provides the agreed services in lieu of certain amount of remuneration. The main reasons to select the GSD technique include reduced cost, faster development and access to skilled manpower. Though GSD is emerging as an effective technique, but it suffers from many challenges like poor communication, lack of trust and coordination. These challenges pose serious risk to the smooth execution of the GSD projects. In this paper, we present a comparative study on GSD to highlight its merits and demerits. Our findings reveal that much of the research in this area has been focused on addressing issues faced by client organizations, however, vendor side in the GSD relationship is much ignored due to which this area is still immature;and, hence, further research work is required to be undertaken to address the issues faced by the vendor organizations.
文摘The trust region method plays an important role in solving optimization problems. In this paper, we propose a new nonmonotone adaptive trust region method for solving unconstrained optimization problems. Actually, we combine a popular nonmonotone technique with an adaptive trust region algorithm. The new ratio to adjusting the next trust region radius is different from the ratio in the traditional trust region methods. Under some appropriate conditions, we show that the new algorithm has good global convergence and superlinear convergence.
文摘In this paper, we propose a nonmonotone adap-tive trust-region method for solving symmetric nonlinear equations problems. The convergent result of the presented method will be estab-lished under favorable conditions. Numerical results are reported.
文摘In this paper, we propose and analyze a non-monotone trust region method with non-monotone line search strategy for unconstrained optimization problems. Unlike the traditional non-monotone trust region method, our algorithm utilizes non-monotone Wolfe line search to get the next point if a trial step is not adopted. Thus, it can reduce the number of solving sub-problems. Theoretical analysis shows that the new proposed method has a global convergence under some mild conditions.
