scholarly journals An inner convex approximation algorithm for BMI optimization and applications in control

Author(s):  
Quoc Tran Dinh ◽  
Wim Michiels ◽  
Sebastien Gros ◽  
Moritz Diehl
2021 ◽  
Vol 9 ◽  
Author(s):  
Tao Zhang ◽  
Yunfei Mu ◽  
Xiaoyu Wang ◽  
Youjun Deng ◽  
Yi Song ◽  
...  

The optimal operation model of AC/DC distribution network with energy router (ER) is essentially a nonconvex nonlinear programming (NLP) problem. In order to improve the feasibility of solving the model, a convex approximation algorithm is proposed in this work. The steady-state model of ER is developed with considering the loss characteristics and multiport coordinated control strategy. It is embedded in the optimization formulations of AC/DC network as basic operating equations. Then, using second-order cone relaxation technology, the power flow equations of AC and DC distribution networks are convexly relaxed. On this basis, the highly nonlinear operating model of ER is linearized by introducing a successive approximation approach. Therefore, the original NLP problem is transformed into the convex programming problem and the solution efficiency is improved. Meanwhile, an iterative solution algorithm is developed to ensure the accuracy of the convex approximation approach. Simulation results verify the feasibility and efficiency of the proposed algorithm.


Author(s):  
Hemant Chickermane ◽  
Hae Chang Gea

Abstract To reduce the computational cost of structural optimization problems, a common procedure is to generate a sequence of convex, approximate subproblems and solve them in an iterative fashion. In this paper, a new local function approximation algorithm is proposed to formulate the subproblems. This new algorithm, called Generalized Convex Approximation (GCA), uses the sensitivity information of the current and previous design points to generate a sequence of convex, separable subproblems. This algorithm gives very good local approximations and leads to faster convergence for structural optimization problems. Several numerical results of structural optimization problems are presented.


2009 ◽  
Vol 34 (12) ◽  
pp. 1467-1474
Author(s):  
Zhe LV ◽  
Fu-Li WANG ◽  
Yu-Qing CHANG ◽  
Yang LIU

2019 ◽  
Vol 41 (15) ◽  
pp. 4380-4386
Author(s):  
Tu Xianping ◽  
Lei Xianqing ◽  
Ma Wensuo ◽  
Wang Xiaoyi ◽  
Hu Luqing ◽  
...  

The minimum zone fitting and error evaluation for the logarithmic curve has important applications. Based on geometry optimization approximation algorithm whilst considering geometric characteristics of logarithmic curves, a new fitting and error evaluation method for the logarithmic curve is presented. To this end, two feature points, to serve as reference, are chosen either from those located on the least squares logarithmic curve or from amongst measurement points. Four auxiliary points surrounding each of the two reference points are then arranged to resemble vertices of a square. Subsequently, based on these auxiliary points, a series of auxiliary logarithmic curves (16 curves) are constructed, and the normal distance and corresponding range of values between each measurement point and all auxiliary logarithmic curves are calculated. Finally, by means of an iterative approximation technique consisting of comparing, evaluating, and changing reference points; determining new auxiliary points; and constructing corresponding auxiliary logarithmic curves, minimum zone fitting and evaluation of logarithmic curve profile errors are implemented. The example results show that the logarithmic curve can be fitted, and its profile error can be evaluated effectively and precisely using the presented method.


2020 ◽  
Vol 287 ◽  
pp. 77-84
Author(s):  
Pengcheng Liu ◽  
Zhao Zhang ◽  
Xianyue Li ◽  
Weili Wu

Sign in / Sign up

Export Citation Format

Share Document