In order to overcome the difficulties caused by singular optima, in the present paper, a new method for the solutions of structural topology optimization problems is proposed. The distinctive feature of this method is...In order to overcome the difficulties caused by singular optima, in the present paper, a new method for the solutions of structural topology optimization problems is proposed. The distinctive feature of this method is that instead of solving the original optimization problem directly, we turn to seeking the solutions of a sequence of approximated problems which are formulated by relaxing the constraints of the original problem to some extent. The approximated problem can be solved efficiently by employing the algorithms developed for sizing optimization problems because its solution is not singular. It can also be proved that when the relaxation parameter is tending to zero, the solution of the approximated problem will converge to the solution of the original problem uniformly. Numerical examples illustrate the effectiveness and validity of the present approach. Results are also compared with those obtained by traditional methods.展开更多
In this paper,we study linear bilevel programming without the assumption that the reaction set of the follower is a singleton.Several properties of the feasible region of the leader are presented.A new solution concep...In this paper,we study linear bilevel programming without the assumption that the reaction set of the follower is a singleton.Several properties of the feasible region of the leader are presented.A new solution concept is introduced to deal with the uncertainty resulting from multiple potential reactions of the follower.To solve a bilevel program with multiple potential reactions,we propose,meadod to transform the original problem into a bilevel programming proproblem which can be solved by some known algorithms.展开更多
In this paper, we obtain some other properties of the majorly efficient points and solutions of the multiobjective optimization presellted in two previous papers of Hu. By decomposing the major cone, which is non-poin...In this paper, we obtain some other properties of the majorly efficient points and solutions of the multiobjective optimization presellted in two previous papers of Hu. By decomposing the major cone, which is non-pointed, non-convex and non-closed into a finite union of disjoint strictly supported pointed convex cones, we discuss the continuous perturbations of the decision space. Several sufficient conditions for the continuity of the sets of majorly efficiellt points and solutions are given.展开更多
An example is presented to show that it is unable to find any numerical Kakutani fixed point with vector labelling algorithms sometimes, and two sufficient conditions of finding numerical Kakutani fixed points are est...An example is presented to show that it is unable to find any numerical Kakutani fixed point with vector labelling algorithms sometimes, and two sufficient conditions of finding numerical Kakutani fixed points are established.展开更多
A new simplicial homtopy algorithm is presented for computing the Leray-Schauder fixed points as well as Merrill fixed points and Eaves fixed points. Moreover, a coercivity condition to guarantee the computation proce...A new simplicial homtopy algorithm is presented for computing the Leray-Schauder fixed points as well as Merrill fixed points and Eaves fixed points. Moreover, a coercivity condition to guarantee the computation proceeding in a bounded region is given.展开更多
基金The project supported by the National Natural Science Foundation of China under project No.19572023
文摘In order to overcome the difficulties caused by singular optima, in the present paper, a new method for the solutions of structural topology optimization problems is proposed. The distinctive feature of this method is that instead of solving the original optimization problem directly, we turn to seeking the solutions of a sequence of approximated problems which are formulated by relaxing the constraints of the original problem to some extent. The approximated problem can be solved efficiently by employing the algorithms developed for sizing optimization problems because its solution is not singular. It can also be proved that when the relaxation parameter is tending to zero, the solution of the approximated problem will converge to the solution of the original problem uniformly. Numerical examples illustrate the effectiveness and validity of the present approach. Results are also compared with those obtained by traditional methods.
文摘In this paper,we study linear bilevel programming without the assumption that the reaction set of the follower is a singleton.Several properties of the feasible region of the leader are presented.A new solution concept is introduced to deal with the uncertainty resulting from multiple potential reactions of the follower.To solve a bilevel program with multiple potential reactions,we propose,meadod to transform the original problem into a bilevel programming proproblem which can be solved by some known algorithms.
文摘In this paper, we obtain some other properties of the majorly efficient points and solutions of the multiobjective optimization presellted in two previous papers of Hu. By decomposing the major cone, which is non-pointed, non-convex and non-closed into a finite union of disjoint strictly supported pointed convex cones, we discuss the continuous perturbations of the decision space. Several sufficient conditions for the continuity of the sets of majorly efficiellt points and solutions are given.
文摘An example is presented to show that it is unable to find any numerical Kakutani fixed point with vector labelling algorithms sometimes, and two sufficient conditions of finding numerical Kakutani fixed points are established.
文摘A new simplicial homtopy algorithm is presented for computing the Leray-Schauder fixed points as well as Merrill fixed points and Eaves fixed points. Moreover, a coercivity condition to guarantee the computation proceeding in a bounded region is given.
