Underground parking can effectively use the underground space of the city and alleviate the difficulty of parking in the city. The main structure of the large-span wellbore underground parking is composed of circular ...Underground parking can effectively use the underground space of the city and alleviate the difficulty of parking in the city. The main structure of the large-span wellbore underground parking is composed of circular plate, side wall and roof. In this paper, a three-dimensional finite element analysis model of the large-span underground parking structure is built based on practical project case, and the whole structure is analyzed by considering the seismic action. Through finite element structure analysis, the large-span roof structure system is optimized, which not only brings convenience to the construction, but also optimizes the project quantity and reduces the cost. At the same time through the analysis we can know that the stress structure system and seismic performance of circular wellbore underground parking is good.展开更多
In the present paper we present a class of polynomial primal-dual interior-point algorithms for semidefmite optimization based on a kernel function. This kernel function is not a so-called self-regular function due to...In the present paper we present a class of polynomial primal-dual interior-point algorithms for semidefmite optimization based on a kernel function. This kernel function is not a so-called self-regular function due to its growth term increasing linearly. Some new analysis tools were developed which can be used to deal with complexity ＂analysis of the algorithms which use analogous strategy in [5] to design the search directions for the Newton system. The complexity bounds for the algorithms with large- and small-update methodswere obtained, namely,O（qn^（p＋q/q（P＋1）log n/ε and O（q^2√n）log n/ε,respectlvely.展开更多
A class of polynomial primal-dual interior-point algorithms for second-order cone optimization based on a new parametric kernel function, with parameters p and q, is presented. Its growth term is between linear and qu...A class of polynomial primal-dual interior-point algorithms for second-order cone optimization based on a new parametric kernel function, with parameters p and q, is presented. Its growth term is between linear and quadratic. Some new tools for the analysis of the algorithms are proposed. The complexity bounds of O（√Nlog N log N/ε） for large-update methods and O（√Nlog N/ε） for smallupdate methods match the best known complexity bounds obtained for these methods. Numerical tests demonstrate the behavior of the algorithms for different results of the parameters p and q.展开更多
文摘Underground parking can effectively use the underground space of the city and alleviate the difficulty of parking in the city. The main structure of the large-span wellbore underground parking is composed of circular plate, side wall and roof. In this paper, a three-dimensional finite element analysis model of the large-span underground parking structure is built based on practical project case, and the whole structure is analyzed by considering the seismic action. Through finite element structure analysis, the large-span roof structure system is optimized, which not only brings convenience to the construction, but also optimizes the project quantity and reduces the cost. At the same time through the analysis we can know that the stress structure system and seismic performance of circular wellbore underground parking is good.
文摘In the present paper we present a class of polynomial primal-dual interior-point algorithms for semidefmite optimization based on a kernel function. This kernel function is not a so-called self-regular function due to its growth term increasing linearly. Some new analysis tools were developed which can be used to deal with complexity ＂analysis of the algorithms which use analogous strategy in [5] to design the search directions for the Newton system. The complexity bounds for the algorithms with large- and small-update methodswere obtained, namely,O（qn^（p＋q/q（P＋1）log n/ε and O（q^2√n）log n/ε,respectlvely.
文摘A class of polynomial primal-dual interior-point algorithms for second-order cone optimization based on a new parametric kernel function, with parameters p and q, is presented. Its growth term is between linear and quadratic. Some new tools for the analysis of the algorithms are proposed. The complexity bounds of O（√Nlog N log N/ε） for large-update methods and O（√Nlog N/ε） for smallupdate methods match the best known complexity bounds obtained for these methods. Numerical tests demonstrate the behavior of the algorithms for different results of the parameters p and q.
