In this paper, an equivalent relation among the reflexivity, weak sequential completeness and bounded completeness in full function space is given. Some results on weakly sequential compactness of subset and the prope...In this paper, an equivalent relation among the reflexivity, weak sequential completeness and bounded completeness in full function space is given. Some results on weakly sequential compactness of subset and the property （u） in substitution spaces are obtained.展开更多
Integral formulations are widely used for full-wave analysis of microstrip interconnects. A weak point of these formulations is the inclusion of the proper planar-layered Green’s Functions (GFs), because of their com...Integral formulations are widely used for full-wave analysis of microstrip interconnects. A weak point of these formulations is the inclusion of the proper planar-layered Green’s Functions (GFs), because of their computational cost. To overcome this problem, usually the GFs are decomposed into a quasi-dynamic term and a dynamic one. Under suitable approximations, the ?rst may be given in closed form, whereas the second is approximated. Starting from a general criterion for this decomposition, in this paper we derive some simple criteria for using the closed-form quasi-dynamic GFs instead of the complete GFs, with reference to the problem of evaluating the full-wave current distribution along microstrips. These criteria are based on simple relations between frequency, line length, dielectric thickness and permittivity. The layered GFs have been embedded into a full-wave transmission line model and the results are ?rst benchmarked with respect to a full-wave numerical 3D tool, then used to assess the proposed criteria.展开更多
This paper proposes a new full Nesterov-Todd(NT) step infeasible interior-point algorithm for semidefinite programming. Our algorithm uses a specific kernel function, which is adopted by Liu and Sun, to deduce the fea...This paper proposes a new full Nesterov-Todd(NT) step infeasible interior-point algorithm for semidefinite programming. Our algorithm uses a specific kernel function, which is adopted by Liu and Sun, to deduce the feasibility step. By using the step, it is remarkable that in each iteration of the algorithm it needs only one full-NT step, and can obtain an iterate approximate to the central path. Moreover, it is proved that the iterative bound corresponds with the known optimal one for semidefinite optimization problems.展开更多
In this paper, we propose a new infeasible interior-point algorithm with full NesterovTodd (NT) steps for semidefinite programming (SDP). The main iteration consists of a feasibility step and several centrality steps....In this paper, we propose a new infeasible interior-point algorithm with full NesterovTodd (NT) steps for semidefinite programming (SDP). The main iteration consists of a feasibility step and several centrality steps. We used a specific kernel function to induce the feasibility step. The analysis is more simplified. The iteration bound coincides with the currently best known bound for infeasible interior-point methods.展开更多
基金Supported by Specific Academic Discipline Project of Shanghai Municipal Education Commission (Grant No. A-3500-11-10)
文摘In this paper, an equivalent relation among the reflexivity, weak sequential completeness and bounded completeness in full function space is given. Some results on weakly sequential compactness of subset and the property （u） in substitution spaces are obtained.
文摘Integral formulations are widely used for full-wave analysis of microstrip interconnects. A weak point of these formulations is the inclusion of the proper planar-layered Green’s Functions (GFs), because of their computational cost. To overcome this problem, usually the GFs are decomposed into a quasi-dynamic term and a dynamic one. Under suitable approximations, the ?rst may be given in closed form, whereas the second is approximated. Starting from a general criterion for this decomposition, in this paper we derive some simple criteria for using the closed-form quasi-dynamic GFs instead of the complete GFs, with reference to the problem of evaluating the full-wave current distribution along microstrips. These criteria are based on simple relations between frequency, line length, dielectric thickness and permittivity. The layered GFs have been embedded into a full-wave transmission line model and the results are ?rst benchmarked with respect to a full-wave numerical 3D tool, then used to assess the proposed criteria.
基金Sponsored by the National Natural Science Foundation of China(Grant No.11461021)the Natural Science Basic Research Plan in Shaanxi Province of China(Grant No.2017JM1014)Scientific Research Project of Hezhou University(Grant Nos.2014YBZK06 and 2016HZXYSX03)
文摘This paper proposes a new full Nesterov-Todd(NT) step infeasible interior-point algorithm for semidefinite programming. Our algorithm uses a specific kernel function, which is adopted by Liu and Sun, to deduce the feasibility step. By using the step, it is remarkable that in each iteration of the algorithm it needs only one full-NT step, and can obtain an iterate approximate to the central path. Moreover, it is proved that the iterative bound corresponds with the known optimal one for semidefinite optimization problems.
文摘In this paper, we propose a new infeasible interior-point algorithm with full NesterovTodd (NT) steps for semidefinite programming (SDP). The main iteration consists of a feasibility step and several centrality steps. We used a specific kernel function to induce the feasibility step. The analysis is more simplified. The iteration bound coincides with the currently best known bound for infeasible interior-point methods.
