A potential reduction algorithm is proposed for optimization of a convex function subject to linear constraints.At each step of the algorithm,a system of linear equations is solved to get a search direction and the Ar...A potential reduction algorithm is proposed for optimization of a convex function subject to linear constraints.At each step of the algorithm,a system of linear equations is solved to get a search direction and the Armijo's rule is used to determine a stepsize.It is proved that the algorithm is globally convergent.Computational results are reported.展开更多
In this paper we introduce a primal-dual potential reduction algorithm for positive semi-definite programming. Using the symetric preserving scalings for both primal and dual interior matrices, we can construct an alg...In this paper we introduce a primal-dual potential reduction algorithm for positive semi-definite programming. Using the symetric preserving scalings for both primal and dual interior matrices, we can construct an algorithm which is very similar to the primal-dual potential reduction algorithm of Huang and Kortanek [6] for linear programming. The complexity of the algorithm is either O(nlog(X0 · S0/ε) or O(nlog(X0· S0/ε) depends on the value of ρ in the primal-dual potential function, where X0 and S0 is the initial interior matrices of the positive semi-definite programming.展开更多
Presents a regular splitting and potential reduction method for solving a quadratic programming problem with box constraints. Discussion on the regular splitting and potential reduction algorithm; Complexity analysis ...Presents a regular splitting and potential reduction method for solving a quadratic programming problem with box constraints. Discussion on the regular splitting and potential reduction algorithm; Complexity analysis of the algorithm; Analysis of the complexity bound on obtaining an approximate solution.展开更多
为了给“双碳”目标下我国交通运输行业发展路径及政策制定提供学术参考,基于对数平均迪氏指数法(Logarithmic Mean Divisia Index, LMDI),选取交通运输碳排放系数、运输方式结构、客货运结构和换算周转量4个因素定量分析了2010—2020...为了给“双碳”目标下我国交通运输行业发展路径及政策制定提供学术参考,基于对数平均迪氏指数法(Logarithmic Mean Divisia Index, LMDI),选取交通运输碳排放系数、运输方式结构、客货运结构和换算周转量4个因素定量分析了2010—2020年间我国交通运输行业碳排放变化的主要机理,并结合与美国、日本、德国等已达峰国家相应驱动因素的类比分析,提出我国交通运输行业面向“双碳”目标的路径建议与实现措施。研究结果表明:交通运输碳排放系数、运输方式结构、换算周转量是驱动我国交通运输行业碳排放的关键因素,2010—2020年的贡献率均值分别为24.8%, 27.2%和42.0%,故需要从这3个因素入手,制定针对性的政策来实现交通运输行业“双碳”目标;客货运结构对我国交通运输行业“双碳”目标的影响较弱,2010—2020年的贡献率均值为6.0%,即总周转量中客运和货运占比对我国交通运输行业碳排放的影响不大,但2020年由于新冠疫情的影响,客货运结构对我国交通运输行业碳排放的贡献率升高至43.3%,需要重点关注疫情时期的这一新变化。展开更多
文摘A potential reduction algorithm is proposed for optimization of a convex function subject to linear constraints.At each step of the algorithm,a system of linear equations is solved to get a search direction and the Armijo's rule is used to determine a stepsize.It is proved that the algorithm is globally convergent.Computational results are reported.
基金This research was partially supported by a fund from Chinese Academy of Science,and a fund from the Personal Department of the State Council.It is also sponsored by scientific research foundation for returned overseas Chinese Scholars,State Education
文摘In this paper we introduce a primal-dual potential reduction algorithm for positive semi-definite programming. Using the symetric preserving scalings for both primal and dual interior matrices, we can construct an algorithm which is very similar to the primal-dual potential reduction algorithm of Huang and Kortanek [6] for linear programming. The complexity of the algorithm is either O(nlog(X0 · S0/ε) or O(nlog(X0· S0/ε) depends on the value of ρ in the primal-dual potential function, where X0 and S0 is the initial interior matrices of the positive semi-definite programming.
基金This research supported partially by The National Natural Science Foundation of China-19771079 and 19601035State Key Laboratory of Scientific and Engineering Computing.
文摘Presents a regular splitting and potential reduction method for solving a quadratic programming problem with box constraints. Discussion on the regular splitting and potential reduction algorithm; Complexity analysis of the algorithm; Analysis of the complexity bound on obtaining an approximate solution.
基金Supported by the China Nature Science Foundation(41071270)the Natural Science Fund of Hubei Province(2010CDB03305)+2 种基金the Open Fund of Hubei Province Key Laboratory of Systems Science in Metallurgical Process(C201007)the Wuhan Chenguang Program(201150431096)the Open Fund of State Key Laboratory of Satellite Ocean Environment Dynamics(SOED1102)
