The definition of the ascending subgraph decomposition was given by Alavi. It has been conjectured that every graph of positive size has an ascending subgraph decomposition. In this paper it is proved that the regular...The definition of the ascending subgraph decomposition was given by Alavi. It has been conjectured that every graph of positive size has an ascending subgraph decomposition. In this paper it is proved that the regular graphs under some conditions do have an ascending subgraph decomposition.展开更多
In this paper, a new Wolfe-type line search and a new Armijo-type line searchare proposed, and some global convergence properties of a three-term conjugate gradient method withthe two line searches are proved.
Recently, double projection methods for solving variational inequalities havereceived much attention due to their fewer projection times at each iteration. In this paper, weunify these double projection methods within...Recently, double projection methods for solving variational inequalities havereceived much attention due to their fewer projection times at each iteration. In this paper, weunify these double projection methods within two unified frameworks, which contain the existingdouble projection methods as special cases. On the basis of this unification, theoretical andnumerical comparison between these double projection methods is presented.展开更多
This paper proposes a sufficient condition, if the properties of the bilevel programming satisfied the condition, we can solve the bilevel programming by solving single level programming. It becomes easy and simple to...This paper proposes a sufficient condition, if the properties of the bilevel programming satisfied the condition, we can solve the bilevel programming by solving single level programming. It becomes easy and simple to solve the bilevel programming.展开更多
文摘The definition of the ascending subgraph decomposition was given by Alavi. It has been conjectured that every graph of positive size has an ascending subgraph decomposition. In this paper it is proved that the regular graphs under some conditions do have an ascending subgraph decomposition.
基金This research is supported by the National Natural Science Foundation of China(10171055).
文摘In this paper, a new Wolfe-type line search and a new Armijo-type line searchare proposed, and some global convergence properties of a three-term conjugate gradient method withthe two line searches are proved.
基金This work is supported by the Natural Science Foundation of China (Grant No. 10171055, 10231060).
文摘Recently, double projection methods for solving variational inequalities havereceived much attention due to their fewer projection times at each iteration. In this paper, weunify these double projection methods within two unified frameworks, which contain the existingdouble projection methods as special cases. On the basis of this unification, theoretical andnumerical comparison between these double projection methods is presented.
文摘This paper proposes a sufficient condition, if the properties of the bilevel programming satisfied the condition, we can solve the bilevel programming by solving single level programming. It becomes easy and simple to solve the bilevel programming.
