Neste trabalho, o modelo matemático do problema de fluxo de potência ótimo básico não linear é analisado e manipulado algebricamente para obter um modelo de programação convexa,...
详细信息
Neste trabalho, o modelo matemático do problema de fluxo de potência ótimo básico não linear é analisado e manipulado algebricamente para obter um modelo de programação convexa, do tipo cônico de segunda ordem. O conceito de envelopes convexos é apresentado para tratar a não linearidade e não convexidade da restrição trigonométrica inversa que surge ao escrever o modelo de FPO como um modelo cônico. Aplicando duas proposições apresentadas neste trabalho a restrição trigonométrica é resolvida em um pré-processamento por um solver de otimalidade local, neste caso o KNITRO, que enumera todas as possibilidades dos pontos de KKT para obter os envelopes convexos e tornar o modelo de FPO totalmente convexo. O modelo é implementado no AMPL e é resolvido com solvers de otimalidade global com sistemas testes da literatura, nesta tese usam-se os sistemas testes IEEE 14, 30, 57 e 118 barras. Os resultados obtidos são validados comparando-os com resultados fornecidos pelo Matpower, que é um simulador para FPO. Como contribuição desta tese, o modelo convexo de FPO obtido é utilizado como exemplo de aplicações no problema de despacho ótimo de potência ativa e reativa, considerando competições via programação binível. São apresentados dois modelos biníveis e dois modelos uníveis. O modelo iterativo convexo utiliza-se do modelo proposto de FPO convexo e as não linearidades são convexificadas fazendo uso dos envelopes de McCormick. O conceito de dualidade forte é empregado afim de obter um modelo unível convexo. Os modelos biníveis e uníveis são implementados em AMPL e resolvidos utilizando solvers de otimalidade local e global, utilizando os mesmos sistemas testes IEEE do modelo cônico e ainda acrescentando mais dois sistemas testes, um de 2 barras e outro de 8 barras. Os principais resultados obtidos com os quatro modelos de despacho ótimo de potência ativa e reativa propostos são apresentados e *** this work, the basic nonlinear mathematical model for the optimal power f
In this paper a priori estimation method is presented for calculating solution of convex optimization problems (COP) with some equality and/or inequality constraints by so-called Newton type homotopy method. The homot...
详细信息
In this paper a priori estimation method is presented for calculating solution of convex optimization problems (COP) with some equality and/or inequality constraints by so-called Newton type homotopy method. The homotopy method is known as an efficient algorithm which can always calculate solution of nonlinear equations under a certain mild condition. Although, in general, it is difficult to estimate a priori computational complexity of calculating solution by the homotopy method. In the presented papers, a sufficient condition is considered for linear homotopy, under which an upper bound of the complexity can be estimated a priori. For the condition it is seen that Urabe type convergence theorem plays an important role. In this paper, by introducing the results, it is shown that under a certain condition a global minimum of COP can be always calculated, and that computational complexity of the calculation can be a priori estimated. Suitability of the estimation for analysing COP is also discussed.
In this paper, minimization problem with a separable strictly convex objective function subject to several linear equality constraints and bounds on the variables (box constraints) is considered. Such problems arise i...
详细信息
In this paper, minimization problem with a separable strictly convex objective function subject to several linear equality constraints and bounds on the variables (box constraints) is considered. Such problems arise in manufacturing, facility location, resource allocation, engineering and economic applications, etc. A necessary and sufficient condition (characterization) is proved for a feasible solution to be the (unique) optimal solution of the considered problem. Primal-dual analysis of the proposed approach is made. Examples of some important separable strictly convex objective functions for the problem under consideration are presented.
Clinical trials have shown that hyperthermia is a potent adjuvant to conventional cancer treatments, but the temperatures currently achieved in the clinic are still suboptimal. Hyperthermia treatment planning simulati...
详细信息
Clinical trials have shown that hyperthermia is a potent adjuvant to conventional cancer treatments, but the temperatures currently achieved in the clinic are still suboptimal. Hyperthermia treatment planning simulations have potential to improve the heating profile of phased-array applicators. An important open challenge is the development of an effective optimization procedure that enables uniform heating of the target region while keeping temperature below a threshold in healthy tissues. In this work, we analyzed the effectiveness and efficiency of a recently proposed optimization approach, i.e. focusing via constrained power optimization (FOCO), using 3D simulations of twelve clinical patient specific models. FOCO performance was compared against a clinically used particle swarm based optimization approach. Evaluation metrics were target coverage at the 25% iso-SAR level, target hotspot quotient, median target temperature (T50) and computational requirements. Our results show that, on average, constrained power focusing performs slightly better than the clinical benchmark (Delta T50 = +0.05 degrees C), but outperforms this clinical benchmark for large target volumes (>40 cm(3), Delta T50 = +0.39 degrees C). In addition, the results are achieved in a shorter time ( - 44%) and are repeatable because the approach is formulated as a convex optimization problem.
Minimizing queue waiting time in multi-class multi-server systems, where the service time depends both on the job type and the server type, has wide applications in transportation systems such as emergency networks an...
详细信息
Minimizing queue waiting time in multi-class multi-server systems, where the service time depends both on the job type and the server type, has wide applications in transportation systems such as emergency networks and taxi networks, service systems such as call centers, and distributed computing platforms. However, the optimal dynamic policy for this problem is not known and remains a hard open problem. In our approach, we develop a math program to model a static variant of this routing problem and use the solution from this math program to construct several novel dynamic policies. In three categories, namely, (i) policies that do not block jobs, (ii) policies that block jobs statically (i.e., blocking jobs using a predetermined blocking probability), and (ii) policies that block jobs dynamically (i.e., blocking jobs when all feasible servers are busy), we compare the performance of our policies with Fastest-Server-First (FSF), a well-known routing policy for such problems in practice and in the literature. Our experiments show that our proposed overflow dynamic routing policies outperform FSF and its extensions, FSFStaticBlock and FSFDynamicBlock. Moreover, to showcase our methodology, we apply our proposed policies to the problem of assigning fire incidents in Irvine, CA, to fire stations.
A separable convex continuous knapsack problem with a single equality constraint and bounded variables is considered in this paper. Necessary and sufficient condition (characterization) for a feasible solution to be a...
详细信息
A separable convex continuous knapsack problem with a single equality constraint and bounded variables is considered in this paper. Necessary and sufficient condition (characterization) for a feasible solution to be an optimal solution to this problem is stated, and characterization theorem in terms of a relaxed problem is formulated and proved. Versions of this problem with a single inequality constraint of the form "less than or equal to" and "greater than or equal to" are also considered, and sufficient conditions for solving these problems are stated and proved, based on the characterization theorem for the original problem. Examples of some convex separable objective functions for the considered problems are presented.
Densest subgraph discovery (DSD) is a fundamental topic in graph mining. It has been extensively studied in the literature and has found many real applications in a wide range of fields, such as biology, finance, and ...
详细信息
Densest subgraph discovery (DSD) is a fundamental topic in graph mining. It has been extensively studied in the literature and has found many real applications in a wide range of fields, such as biology, finance, and social networks. As a typical problem of DSD, the k-clique densest subgraph (CDS) problem aims to detect a subgraph from a graph, such that the ratio of the number of k-cliques over the number of its vertices is maximized. This problem has received plenty of attention in the literature, and is widely used in identifying larger ''near-cliques''. Existing CDS solutions, either k-core or convex programming based solutions, often need to enumerate almost all the k-cliques, which is very inefficient because real-world graphs usually have a vast number of k-cliques. To improve the efficiency, in this paper, we propose a novel framework based on the Frank-Wolfe algorithm, which only needs k-clique counting, rather than k-clique enumeration, where the former one is often much faster than the latter one. Based on the framework, we develop an efficient approximation algorithm, by employing the state-of-the-art k-clique counting algorithm and proposing some optimization techniques. We have performed extensive experimental evaluation on 14 real-world large graphs and the results demonstrate the high efficiency of our algorithms. Particularly, our algorithm is up to seven orders of magnitude faster than the state-of-the-art algorithm with the same accuracy guarantee.
Backgroud: The uncertainty associated with renewable generation and loads imposes various challenges for the economic operation of microgrids. On the residential side, energy storage systems are implemented with high ...
详细信息
Backgroud: The uncertainty associated with renewable generation and loads imposes various challenges for the economic operation of microgrids. On the residential side, energy storage systems are implemented with high expectations to enhance photovoltaic power consumption and electricity price arbitrage. Aims: This paper proposes an expectation-oriented stochastic model for optimal energy management of household batteries to cope with the uncertain electricity generation and consumption. Materials & Methods: The exact cost expectation of daily operation is formulated as an alternative to the conventional scenario-based average approximation. A predictive control-based battery scheduling mechanism is developed further to apply the proposed model to intraday energy storage management. Results: Simulation results validate the convexity of the proposed model. Discussion: Although nonlinear in nature, the resultant optimization problem is proven to be convex, which ensures computable global optimal solutions for the proposed model. Conclusion: Simulation results demonstrate the effectiveness of the proposed scheduling strategy compared with existing methods.
We propose a stochastic programming approach for a static origin-destination (OD) reconstruction problem. We focus on the reconstruction of route flows such that the likelihood function of route flows is maximized. Th...
详细信息
We propose a stochastic programming approach for a static origin-destination (OD) reconstruction problem. We focus on the reconstruction of route flows such that the likelihood function of route flows is maximized. The route volumes are assumed to follow exponential families that are known or estimated in advance. The consideration of the joint distribution function of route flows eliminates the route selection from the model, as the route choice patterns are embedded in the distribution of the route flows. We assume that additional information regarding the traffic counts (i.e., node counts, link counts, and turn counts) is available. Finally, solution methodologies for different stochastic programmings are proposed: barrier method and Primal-dual interior point method for Quadratic programming and convex programming respectively. We compared the proposed stochastic models with the entropy approach. Experimental results indicate that the inclusion of traffic-count information in the stochastic model significantly improves the accuracy of OD reconstruction if we can predict the correct distribution of route flows. Meanwhile the entropy approach requires the inclusion of the additional information on the true volumes of route flows to achieve a similar level of performance. We apply the proposed algorithm to the bus transit system of Seoul, Korea using bus-card data. Compared with the real OD volumes, the reconstruction is fairly accurate.
We address the problem of multi-agent partition-based convex optimization which arises, for example, in robot localization problems and in regional state estimation in smart grids. More specifically, the global cost f...
详细信息
We address the problem of multi-agent partition-based convex optimization which arises, for example, in robot localization problems and in regional state estimation in smart grids. More specifically, the global cost function is the sum of locally coupled cost functions that depend only on each agent variables and their neighbors' variables. Inspired by a generalized gradient descent strategy, namely the Block Jacobi iteration, we propose an algorithm amenable to a scalable distributed implementation, i.e., each agent eventually computes only the optimal values for its own variables via local communication with its neighbors. In particular, we provide sufficient conditions for global and semi-global exponential stability for the proposed algorithms even in the presence of lossy communications and asynchronous updates. The theoretical analysis relies on novel tools on Lyapunov theory based on separation of time scales and averaging theory for discrete-time systems. Finally, the proposed algorithm is numerically tested on the IEEE 123 nodes distribution feeder in the context of multi-area robust state estimation of smart grids in the presence of measurement outliers. (C) 2019 Elsevier Ltd. All rights reserved.
暂无评论