IEEE TRANSACTIONS ON POWER SYSTEMS 1

Size: px
Start display at page:

Download "IEEE TRANSACTIONS ON POWER SYSTEMS 1"

Transcription

1 TRANSACTIONS ON POWER SYSTEMS 1 Solving Multi-Objective Economic Dispatch Problem Via Semidefinite Programming Abimbola M Jubril, Member,, Olusola A Komolafe, Member,, and Kehinde O Alawode, Student Member, Abstract This paper presents a solution for multi-objective economic dispatch problem with transmission losses semidefinite programming (SDP) formulation The vector objective is reduced to an equivalent scalar objective through the weighted sum method The resulting optimization problem is formulated as a convex optimization via SDP relaxation The convex optimization problem was solved to obtain Pareto-optimal solutions The diversity of the solution set was improved by a nonlinear selection of the weight factor Simulations were performed on 30-bus, 57-bus, and 118-bus test systems to investigate the effectiveness of the proposed approach Solutions were compared to those from one of the wellknown evolutionary methods Results show that SDP has an inherently good convergence property and a lower but comparable diversity property Index Terms Economic dispatch, multi-objective optimization, semidefinite programming (SDP), weighted sum method I INTRODUCTION MODERN electric power systems are large, geographically distributed, yet highly interconnected In the process of transmitting the generated power, an estimated 4% of the total energy produced is lost [1] The economic viability of power systems, especially in a competitive energy market [2], demands an optimum mix of all of the parameters that influence power generation and transmission An approach to achieving this optimum is to include the transmission losses as one of the objectives in the economic dispatch (ED) problem Thus, the economic dispatch problem becomes a multi-objective optimization in which the fuel cost and the transmission losses are minimized In general, multi-objective optimization problems are solved by reducing them to a scalar equivalent This is achieved by aggregating the objective functions into a single function The weighted sum method [3], [4] is a well-known technique to reduce a multi-objective optimization problem to a scalar equivalent Some shortcomings of this method include the inability to capture nonconvex portion of the Pareto surface and the nonuniform distribution of the solution point with even variation of the weight factors [5] In [6], the -constrained method was developed to overcome the problem of finding points on the nonconvex portion of the Pareto front However, this entails a high computation cost and has a tendency to find weakly Pareto Manuscript received July 16, 2010; revised January 11, 2011, June 21, 2011, December 05, 2011, May 14, 2012; accepted February 03, 2013 Paper no TPWRS A M Jubril and O A Komolafe are with Obafemi Awolowo University, Ile-Ife, Nigeria ( ajubril@oauifeedung; okomolaf@oauifeedung) K O Alavode is with the Department of Electronic and Electrical Engineering, Osun State University, Osogbo, Nigeria ( koalawode@ieeeorg) Digital Object Identifier /TPWRS optimal points The goal attainment method [4], [7] has also been reported to find weakly Pareto optimal points and, in some cases, inferior solutions [8] The normal boundary intersection (NBI) method [9] generates very uniform approximate solution set but is unable to find globally (or ideal) Pareto-optimal points [10] In [11], game theory is applied to solve the multi-objective power problem, and more contemporary techniques are based on evolutionary algorithms (for more details, see [12] and the references therein) In this paper, the weighted sum method is adopted because of its simplicity and applicability to vector optimization problems [13] Furthermore, appropriate choice of weights can provide a better capture of the Pareto surface [14], [15] Most optimization problems in power systems have polynomial objective functions and constraints [16], [17], which can be formulated into a semidefinite program However, they are generally nonconvex, and finding a direct solution is somewhat difficult The semidefinite programming (SDP) relaxation method simplifies and allows nonconvex problems to be solved by convex optimization techniques It provides an easily computable lower bound of the minimum value [18] There are examples of the application of the SDP formulation to the ED and optimal power flow problems [19] [24] A Motivation The ideal Pareto front is not known apriori Therefore, the Pareto solution set generated by any algorithm is considered as an estimate of the ideal Pareto set Most multi-objective evolutionary algorithms are population-based and can generate the Pareto front estimate in a single run Due to the stochastic nature of evolutionary algorithms, the attainment of the ideal Pareto front may be difficult or even impossible In comparison, the SDP-based weighted sum is not a population-based algorithm and will require several runs to generate an estimate of the Pareto set However, the SDP formulation is convex and will provide globally optimum Pareto solutions when the relaxation is tight B Contributions The contributions of this paper can be summarized as follows The convex combination of the components of the vector objective reduces the multi-objective ED problem to the single case Such single-objective ED problems were considered in [19], [21] [24] As SDP has not been applied to the multi-objective ED problem, this paper extends the SDP to solve such occurrences The weighted sum method has been limited to problems that are convex because of the difficulty in capturing solution points on the nonconvex portion of the Pareto /$

2 2 TRANSACTIONS ON POWER SYSTEMS front The SDP relaxation of nonconvex problems results in a convex approximate In this paper, the weighted sum method is applied to the resulting convex problem and guarantees the capture of the entire Pareto front The weighted sum method has not been able to produce a uniform spread of points on the convex Pareto front with an even spread of the weight factor [5] A nonlinear weight selection method that controls and improve the spread of the Pareto points is presented The remainder of this paper is organized as follows The multi-objective dispatch problem is described in Section II A brief description of the SDP and the SDP formulation of the problem through semidefinite relaxations are presented in Sections III and IV, respectively In Section V, the analysis of the multi-objective optimization problem is considered, and some performance metrics used in this paper are briefly discussed Section VI considers the reduction of the multi-objective problem into its scalar equivalent using the method of weighted sum of objectives The nonlinear selection of the weight vector to achieve greater control of the distribution of the generated solutions is presented in Section VII In Section VIII, the effectiveness of the proposed approach is evaluated, and concluding remarks are provided in Section IX II PROBLEM STATEMENT Let be the number of generating units in a power system, and denote the th generator by The power generatedbythe th generator is The multi-objective economic dispatch problem with transmission losses can be formulated as follows:, the decision variable, is the vector of the generated power; is the fuel cost objective, is the total transmission loss objective, and and are the generation capacity and power balance, inequality and equality constraints, respectively A Problem Objectives 1) Total Fuel Cost, : The generator costs are represented by quadratic functions The total fuel cost in running the generating units can be expressed as is the real power output of the th plant, and, and are the fuel cost coefficients of that plant In matrix form, the total fuel cost can be written as (1) (2) (3) 2) Total Transmission Losses, : The total transmission losses of the system is expressed by Kron s loss formula Equation(4)canbewritteninmatrixformas arekron slosscoefficients B Problem Constraints 1) Generation Capacity Constraints: The real power output of each generating unit is constrained between the upper and the lower limits as follows: This defines the inequality constraint 2) Power Balance Constraint: The power balance constraint is given by and in matrix form as is the total load demand and is a -dimensional vector of all ones This defines the equality constraint III SEMIDEFINITE PROGRAMMING SDP is a convex optimization method that generalizes the LP by replacing the vector variables with matrix variables [18], [25], [26] Furthermore, the elementwise nonnegativity condition is replaced with the positive semidefiniteness of the matrices In the SDP formulation adopted in this paper, the primal SDP is defined as the optimization problem (4) (5) (6) (7) (8) (9)

3 JUBRIL et al: SOLVING MULTIOBJECTIVE ECONOMIC DISPATCH PROBLEM VIA SDP 3 and the associated dual SDP is to find the solution It is possible to write each of the quadratic expressions in their matrix quadratic equivalents: (10) is the decision variable, and In the notation adopted in this paper, denotes the set of all symmetric matrices in The constraint in (10) is a linear matrix inequality (LMI) of the form The vector is the decision variable and In(9) and (10), the inner product between two vectors is defined as, and the inner product between two matrices is defined as The symbol denotes positive semidefiniteness, ie, if Furthermore, and are the optimal values of (9) and (10), respectively More details on SDP can be found in [27] In the LP formulation, duality is very strong and both primal and dual programs always give the same result On the other hand, the duality results in SDP are weaker, resulting in a duality gap In this situation, the result of one program yields a bound on the optimal value of the other However, if the problem satisfies Slater s condition, the two programs give the same result, thus closing the duality gap [26] An efficient interior point method exists for the solution of the primal/dual program [16], [28], [29] A SDP Relaxation Given a minimization problem (11) for which an estimate or a bound on the optimal value suffices, the feasible set may be increased from to such that The relaxed problem becomes (12) with The reformulation of the problem (11) as (12) forms the basis of SDP relaxation In essence, SDP relaxation consists of linearization and replacement of restrictive equality constraints with inequality constraints As an illustration, consider the relaxation of the universal combinatorial problem (in the form of the quadratically constrained quadratic program [QCQP]) [30], [31] (14) Using Shor s relaxation [18], a good lower bound can be computed for (13) by solving the SDP, The dual of Shor s SDP relax- ation is (15) (16) The last constraint in (16) represents the relaxation of the constraint as IV SDP RELAXATION OF THE PROBLEM The vector optimization ED problem can be decomposed into a number of single-objective ED problems The component objective functions are represented by quadratic functions, and each of these is minimized over the feasible set definedbythe equality and the inequality constraints Each of the nonlinear objective functions is linearized through the substitution of the SDP variable and the equality constraints The first single-objective ED problem in (1) is the classical ED problem (17) The second ED problem, which minimizes the total transmission losses, is given as (18) By writing and substituting in (3), the ED problem in (17) can be reduced to the form (13) with and Each of the quadratic functions is convex if ; however, if, the problem is nonconvex and it is difficult (19)

4 4 TRANSACTIONS ON POWER SYSTEMS In the same manner, the second ED problem in (18) is reduced to the form (20) These two single-objective ED problems can be combined and converted back to a vector objective ED problem of the form between the generated solution set and the ideal Pareto front Diversity measures the extent of the coverage and the uniformity of distribution of the solutions [32] The two properties are somewhat conflicting and are rarely satisfied simultaneously by the solution of any multi-objective optimization algorithm The convergence of two solution sets can be estimated by superimposing their Pareto fronts and considering the dominance property of the generated Pareto sets In [33], the set coverage metric was suggested to evaluate convergence The set coverage metric between two sets of solution sets and, denoted by, calculates the proportion of solutions in, which are weakly dominated by solutions of : (25) V MULTI-OBJECTIVE OPTIMIZATION (21) A general multi-objective optimization problem consists of a number of objectives to be optimized simultaneously and is associated with a number of equality and inequality constraints It can be formulated as follows: (22) is the feasible region in the decision space, is the th objective function, is a decision vector, is the number of the objectives, and and are the inequality and the equality constraints, respectively In a single-objective optimization problem, the optimal solution is that value such that no other value gives a better objective value However, in a multi-objective optimization problem, there is no unique optimal solution Rather, there is a set of optimal solutions that are non inferior to any other in the set A vector is said to dominate another vector (denoted by ) if and only if is partially less than This can be expressed as (23) (24) A solution is said to be Pareto optimal ifandonlyif there is no for which A Performance Metrics Generally, two important properties are used when comparing different multi-objective algorithms, namely, convergence and diversity Convergence is a measure of the relative closeness When,allmembersof are weakly dominated by However, implies that no member of is weakly dominated by It is possible that, always Hence, both and must be calculated to ascertain the members of that are dominated by and vice versa A metric that estimates the extent or the maximum spread of the Pareto front is given in [32] It is defined as the Euclidean distance between the extreme function values observed in the nondominated solution set and given by (26) is the number of objectives The spacing metric (denoted as ) is a measure of diversity of the generated solution set It considers how uniformly distributed or equidistantly spaced the solution points are along the Pareto front [34], [32] It is given by (27) (28) and is the mean value of all The Pareto front yielding a smaller value of spacing metric is considered to have a better diversity A zero value implies that all members of the generated set are equidistantly spaced VI WEIGHTED SUM METHOD Consider the weight vector,the vector objective function, and the map The weighted sum method derives the scalar objective, through a convex combination of the objectives Thus (29)

5 JUBRIL et al: SOLVING MULTIOBJECTIVE ECONOMIC DISPATCH PROBLEM VIA SDP 5 TABLE I VARIATION OF SLOPE WITH Fig 1 Weighted sum method representation is the number of objectives and (30) This transforms the vector optimization to a scalar of the form (31) This process maps the -dimensional objective space onto the positive real line, and all the optimal (non-dominated) points aremappedtothesamepointontheline More specifically, consider the bi-objective problem with ; (29) and (30), respectively, reduce to (32) (33) If the vectors are expressed in polar coordinate forms as shown in Fig 1, (32) can be written as (34),and The minimum points (equivalently, the Pareto points) of the map can be found at points the weight vector is orthogonal to the objective vector,ie, or Note that, for every weight and are determined, and the scalar optimization problem reduces to finding in the direction such that is minimum If the weight vector is parameterized by,suchthat and, then the slope of is given as and the slope sensitivity as (35) TABLE II VARIATION OF SLOPE SENSITIVITY WITH The relative change of the slope of and the slope sensitivity with respect to change in the parameter for the standard weighted sum (SP) are shown in the second column of Tables I and II, respectively Table I shows that a change in the value of from0to01 results in a change in the value of slope from to 90 This implies that slope values between and 90 are missed; therefore, all solution points in that section of the tradeoff curve will not be captured This change in slope can be considered as the sensitivity of the scalarization process to capture solution points on the Pareto surface For values of closeto0,intableii,the slope is very sensitive to very small change in,andforvalues of close to 1, the sensitivity is close to 1 This was noted in [35] to be the source of deficiencies of linear weight selection, resulting in the omission of Pareto points in the first and the clustering of Pareto points in the second This motivates the idea of reducing these effects by controlling the slope sensitivity VII WEIGHT SELECTION ADAPTATION IN WEIGHTED SUM METHOD (36) The weight vector in the weighted sum method is constrained along the line (as SP), and as varies from 0 to 1,

6 6 TRANSACTIONS ON POWER SYSTEMS varies between 1 and However, if the weight vector is constrained to the unit circle as (37) the slope becomes (38) and the slope sensitivity can be written as (39) values around 1 This fast change leads to high spacing distance between the generated optimal points, while the very low sensitivity leads to the clustering effect in the resulting solutions The nonlinear weight selection gives a higher sensitivity and provides for further sensitivity improvement through the free parameter It can be observed that, as gets close to 1, the slope sensitivity tends to approach The additional free parameter can be manipulated in the search of the solution points and facilitates the control of the slope of the weight factor such that clustered points can be spread out There is also an improvement in the computational efficiency of the method A slight improvement over the standard weighted sum method can be observed when the sensitivities are compared (see the third column of Table I) This is due to the factor in (39), and more solution points can be found Note that the weight constraint is not satisfied; hence, it cannot be considered as a weighted sum method Consider setting and This will constrain to a unit circle while satisfying the weight constraint The slope and its sensitivity can now be written as (40) (41) To provide greater control over the slope sensitivity, a weight selection such that is constrained on the surface of an ellipsoid (ELP) is proposed Let Substituting in (33) gives the equation of the ellipsoid For number of objectives, an ellipsoid is defined as (42) (43) (44), are the axes of the ellipsoid Setting and in (43), the slope becomes and the slope sensitivity is given by (45) (46) A comparison of results in Tables I and II shows an improvement in slope sensitivity as one changes from weights constrained along the line, (SP), to those constrained on a unit circle (UC) and on an ellipsoid (ELP) It is interesting to observe that the rate of change of the slope with weight parameter change is monotonically decreasing: a very fast change for initial values of and almost zero change for VIII SIMULATION RESULTS AND DISCUSSIONS In this study, the standard 30-bus, 57-bus, and 118-bus test systems were considered to investigate the effectiveness of the proposed approach The cost coefficients, power generation limits, and details of the bus and line data can be found in [12], [36] and, [37], respectively The SDP problem was converted into the standard primal/dual form using YALMIP parser [38] and solved with SeDuMi [39], an SDP solver The problems were initially solved for the ideal minimum points with each of the single objectives These values at the minimum points were used in the determination of the maximum spread of the algorithm The problem was then solved using the standard weighted sum method Two cases were investigated: Case 1) investigation of the effect of on the quality of Pareto generation Case 2) comparison of the solutions from SDP and the Nondominated Sorting Genetic Algorithm II (NSGA-II) A Case 1 Generation of Pareto points for different values of was considered To explore the effect of changes in and compare different cases, 50 runs were carried out for each parameter value Detailed results for the 57-bus test system only are presented here due to space constraints The Pareto curves for values of 1,5,and10areshowninFig2With, only a few distinct points were generated from 50 runs This implies that different runs with different values of gave very close values This is a waste of computational effort These points spread out as is increased As the value of is further increased, a progressive improvement in the distribution of the Pareto points is observed, and the clustering of the solution points disappeared However, it was also observed that the solutions near the lower extreme point are not captured As the value of is increased from 1, more points are missed from the lower extreme point This inability to capture the lower extreme point of the Pareto and other solution points in its neighborhood resulted in the increased power recorded for most of the generating units in the third and fourth columns of Tables III and IV This is observed to be due to the expression for in (43) in terms of as (47) Therefore, and, implies that the extreme solution point defined by and those close to it are missed This results in the reduction of the extent of the Pareto

7 JUBRIL et al: SOLVING MULTIOBJECTIVE ECONOMIC DISPATCH PROBLEM VIA SDP 7 Fig 2 Effect of variation of on the Pareto front (a) (b) (c) TABLE III BEST SOLUTIONS FOR FUEL COST (57-BUS) TABLE IV BEST SOLUTIONS FOR TRANSMISSION LOSSES (57-BUS) TABLE V SOLVER TIME AND ITERATIONS FOR DIFFERENT TEST SYSTEMS set generated as the value of is increased This effect can be removed by combining solution sets generated with two different values of, one large value and one small value close to 1 The time taken by the solver and the number of iterations for each run for various problem sizes are given in Table V An exponential increase in the solver time with system size can be observed This shows a weakness of SDP in handling large systems B Case 2 The multi-objective dispatch problem was also solved with the Nondominated Sorting Genetic Algorithm II (NSGA-II) using the three test systems Fig 3 gives a visual comparison of Pareto fronts obtained by NSGA-II (population size of 50) and SDP with different values of used (50 runs for each value) for the 57-bus test system While SDP was able to capture the upper extreme point for the different values of, NSGA-II could not capture it On the other hand, as the value of is increased, the inability of the SDP approach to capture the lower extreme point, and solution points close to it, can be noted This leads to the reduction of the extent parameter,,in all the problems considered (eg, when increased to 10) Tables III and IV show the best solutions obtained by both the NSGA-II and the SDP approaches for minimization of fuel cost and transmission losses, respectively, in bold numerals The corresponding values in the other objective are also given The movement of the lower extreme point from its ideal value as the value of increases is seen in the best fuel cost obtained by the SDP method that increases with in Table III From Table IV, it can be seen that the SDP (S) approach returned a lower value for transmission losses than NSGA-II (NS) A summary of the results for the three systems considered is presented in Table VI Tables VII IX show the results of the set coverage, spacing, and extent metrics for comparing the performance of both the NSGA-II and the SDP approaches in the 30-bus, 57-bus, and 118-bus test cases, respectively Values for the set coverage metric indicate that the SDP approach yielded solutions with better convergence properties than NSGA-II, with convergence improving as the value of is increased The spacing metric values show that the solutions obtained by NSGA-II are more uniformly distributed than those of SDP However, as the value of increases, the distribution of the SDP-obtained solution sets along the Pareto front improves SDP also yielded solution sets with better extent metric values than NSGA-II, although a decrease in value is observed as is increased Looking at Tables VII, VIII, and IX, an increase in the set coverage with is observed, but for, for the 118-bus system, a reduction is noted This is explained as follows By the definition of dominance, for a comparison of two solution points, one of their function values must remain the same The relative values of the other function value determine which of

8 8 TRANSACTIONS ON POWER SYSTEMS Fig 3 Case 2: Pareto front comparison for 57-bus system (a) NSGA-II and (b) NSGA-II and (c) NSGA-II and TABLE VI SUMMARY OF BEST SOLUTION FOR THE TEST SYSTEMS TABLE VII PERFORMANCE METRICS (30-BUS) TABLE VIII PERFORMANCE METRICS (57-BUS) TABLE IX PERFORMANCE METRICS (118-BUS) the solutions dominates In general, as increases, the spacing metric decreases This increases the number of points that can be compared as defined in (25) Also, due to (47), increasing reduces the extent metric of the SDP-generated Pareto front However, as the extent of the Pareto front of the NSGA-II is constant, the reduction of the SDP extent reduces the number of points that can be compared The combination of these two effects on the number of points to be compared determines the effect of on the set coverage Initially, an increase in the set coverage is observed as is increased This is due to the dominating increasing effect of the spacing metric on the set coverage metric over the decreasing effect of the extent metric on the set coverage As the value of is further increased, an optimal point is reached beyond which an increase in causes a decrease in the set coverage Increasing beyond this point will cause a reduction in the set coverage This is due to the dominating reducing effect of decreasing extent The optimal point the highest set coverage is achieved differs for different systems We observed, for the test systems considered, that the value of around which this was attained for the 30-bus system is 175; for the 57-bus system, 10; and for the 118-bus, 75 IX CONCLUSION This paper formulated a multi-objective economic dispatch problem with transmission losses as a convex optimization problem using SDP relaxation technique The difficulties of the weighted sum method in handling a nonconvex Pareto front were obviated by a nonlinear selection of weight factors The nonlinear weight selection helped to reduce the clustering of solution points on the Pareto surface, thus providing a more uniform distribution There is the added improvement in the use of computational resource A numerical example based on standard data set showed that the proposed formulation is efficient Comparison with the NSGA-II showed that the SDP-based approach possesses comparable diversity property and better convergence property The formulation provided in this paper can be extended to other power system problems, as polynomial objectives were considered

9 JUBRIL et al: SOLVING MULTIOBJECTIVE ECONOMIC DISPATCH PROBLEM VIA SDP 9 REFERENCES [1] A M L da Silva and J G de Carvalho Costa, Transmission loss allocation: Part I Single energy market, Trans Power Syst, vol 18, no 4, pp , Nov 2003 [2] DDochain,WMarquardt,SCWon,OMalik,MKinnaert,and J Lunze, Monitoring and control of process and power systems: Adapting to environmental challenges, increasing competitivity and changing customer and consumer demands, in Proc 17th World Congress, Jul 2008, pp [3] F Milano, C A Canizares, and M Invernizzi, Multi-objective optimization for pricing system security in electricity markets, Trans Power Syst, vol 18, no 2, pp , May 2003 [4] W D Rosehart, C A Canizares, and V H Quintana, Multi-objective optimal power flow to evaluate voltage security costs in power networks, Trans Power Syst, vol 18, no 1, pp , Mar 2003 [5]IDasandJEDennis, Closerlookatdrawbacksofminimizing weighted sums of objectives for pareto set generation in multicriteria optimization problems, Structural Optimization, vol 14, pp 63 69, 1997 [6] Y L Chen and C C Liu, Multiobjective var planning using the goal attainment method, in Proc Gen, Transm Distrib,Mar1994, vol 141, pp [7] A Berizzi, C Bovo, and M Innorta, Multi-objective optimization techniques applied to modern power systems, in Proc E Power Eng Soc, 2001, vol 3, pp [8] J G Lin, On multiple-objective design optimization by goal methods, in Proc Amer Control Conf, Boston, MA, USA, Jun 1991, pp [9] C Roman and W Rosehart, Evenly distributed pareto points in multiobjective optimal power flow, Trans Power Syst, vol 21, no 2, pp , May 2006 [10] I Das and J E Dennis, Normal boundary intersection: A new method for generating the pareto surface in nonlinear multicriteria optimization problems, SIAM J Optim, vol 8, no 3, pp , 1998 [11] A Orths, A Schmitt, and Z A Styczynski, Multi-criteria optimization methods for planning and operation of electrical energy, Electrical Engineering(Archiv for Elektrotechnik), vol 83, no 5 6, pp , 2001 [12] M A Abido, Multiobjective evolutionary algorithms for electric power dispatch problem, Trans Evol Comput, vol10,no3, pp , 2006 [13] L A Zadeh, Optimality and non-scalar-valued performance criteria, Trans Automat Control, vol AC-8, pp 59 60, 1963 [14] T W Athan and P Y Papalambros, A note on weighted criteria methods for compromise solutions in multi-objective optimization, Eng Opt, vol 27, pp , 1996 [15] M A Gennert and A L Yuille, Determining the optimal weights in multiple objective function optimization, in Proc 2nd Int Conf Comput Vis, Los Alamos, CA, USA, Sep 1998, pp [16] I A Farhat and M E El-Hawary, Interior point methods application in optimum operational scheduling of electric power systems, IET Gener Transm Distrb, vol 3, no 11, pp , 2009 [17] J B Lasserre, Global optimization with polynomials and the problem of moments, SIAM J Optim, vol 11, no 3, pp , 2001 [18] S Boyd and L Vandenberghe, Semidefinite programming relaxations of non-convex problems in control and combinatorial optimization, in Communications, Computation, Control and Signal Processing: A Tribute to Thomas Kailath, A Paulraj, V Roychowdhuri, and C Schaper, Eds Boston, MA, USA: Kluwer, 1997, ch 15, pp [19] M Madrigal and H Quintana, Semidefinite programming relaxations for 0,1 power dispatch problems, in Proc Power Eng Soc Summer Meeting Conf, Edmonton, AB, Canada, July 1999, pp [20] R Fuentes-Loyola and V H Quintana, Medium-term hydothermal coordination by semidefinite programming, Trans Power Syst, vol 18, no 4, pp , Nov 2003 [21] X Bai, H Wei, K Fujisawa, and Y Wang, Semidefinite programming for optimal power flow problem, Int J Electr Power Energy Syst, vol 30, pp , 2008 [22] B C Lesieutre, D K Molzahn, A R Borden, and C L DeMarco, Examining the limits of the application of semidefinite programming to power flow problems, in Proc 49th Annual Allerton Conf, Allerton House, IL, USA, Sep 2011, pp [23] R A Jabr, Solution to economic dispatching with disjoint feasible regions via semidefinite programming, Trans Power Syst, vol 27, no 1, pp , Feb 2012 [24] J Lavaei and S H Low, Zero duality gap in optimal power flow problem, Trans Power Syst, vol 27, no 1, pp , Feb 2012 [25] J-B Lasserre and T Prieto-Rumeau, SDP vs lp relaxations for the moment approach in some performance evaluation problems, Stochastic Models, vol 20, no 4, pp , 2004 [26] L Tunçel, On the Slater Condition for the SDP Relaxations of Nonconvex Sets, Univ of Waterloo, Waterloo, ON, Canada, Tech Rep CORR , Feb 2000 [27] L Vandenberghe and S Boyd, Semidefinite programming, SIAM Rev, vol 38, pp 49 95, 1996 [28] F Alizadeh, Interior point methods in semidefinite programming with application to combinatorial optimization, SIAM J Optim, vol 5, pp 13 51, 1995 [29] A S Nemirovski and M J Todd, Interior-point methods for optimization, Acta Numerica, pp , 2008 [30] B Stephen and L Vandenberghe, Convex Optimization New York, NY, USA: Cambridge Univ, 2004 [31] S Boyd, L E Ghaoui, E Feron, and V Balakrishnan, LinearMatrix Inequalities in Systems and Control Theory Philadelphia, PA, USA: SIAM, 1994 [32] K Deb, Multi Objective Optimization Using Evolutionary Algorithm New York, NY, USA: Wiley, 2004 [33] E Zitzler, Evolutionary algorithms for multiobjective optimization: Methods and applications, PhD dissertation, Swiss Fed Inst Technol (ETH), Zurich, Switzerland, 1999[Pls provide the department for which this dissertation was prepared] [34] J Schott, Fault tolerant design using single and multi-criteria genetic algorithms, Master s thesis, Mass Inst Technol, Boston, MA, USA, 1995[Pls provide the department for which this thesis was prepared] [35] A Messac, E Melachrinoudis, and C P Sukam, Mathematical and pragmatic perspectives of physical programming, AIAA J, vol 39, no 5, pp , 2001 [36] Matpower 40b4 User s Manual, R D Zimmerman, Power Syst Eng Res Center, May 21, 2010 [37] M Shahidehpour, H Yamin, and Z Li, Market operations in electric power systems: Forecasting, scheduling and risk management, 2002 [Online] Available: [38] J Löfberg, Yalmip: A toolbox for modeling and optimization in matlab, in Proc CACSD Conf, 2004 [39] J F Sturm, SeDuMi ver 11R3, Advanced Optim Lab, McMaster Univ, Hamilton, ON, Canada, Oct 2006 Abimbola M Jubril (M 12) received the BSc, MSc, and PhD degrees in electronic and electrical engineering from the Obafemi Awolowo University, Ile-Ife, Nigeria, in 1996, 2002, and 2007, respectively He is a Lecturer with the Department of Electronic and Electrical Engineering, Obafemi Awolowo University, Ile-Ife, Nigeria His research interests include robust control, application of multi-objective optimization in control and power systems, and instrumentation systems Olusola A Komolafe (M 87) received the BSc (Hons) degree in electronic and electrical engineering from the Obafemi Awolowo University, Ile-Ife, Nigeria, in 1979, the MSc degree in electrical engineering from the University of New Brunswick, Fredericton, NB, Canada, and the PhD degree from the University of Saskatchewan, Saskatoon, SK, Canada He is a Senior Lecturer with the Department of Electronic and Electrical Engineering, Obafemi Awolowo University, Ile-Ife, Nigeria His research interests include power system analysis, and control and application of FACTS in power systems Kehinde O Alawode (S XX) [pls provide your year of membership] received the BTech (Hons) degree in electronic and electrical engineering from Ladoke Akintola University of Technology (LAUTECH), Ogbomoso, Nigeria, in 2005 He is currently working toward

10 10 TRANSACTIONS ON POWER SYSTEMS the MSc degree in electronic and electrical engineering at Obafemi Awolowo University, Ile-Ife, Nigeria He is with the Department of Electronic and Electrical Engineering, Osun State University, Osogbo, Nigeria His current research interests include computational intelligence and its applications

A NONLINEAR WEIGHTS SELECTION IN WEIGHTED SUM FOR CONVEX MULTIOBJECTIVE OPTIMIZATION. Abimbola M. Jubril. 1. Introduction

A NONLINEAR WEIGHTS SELECTION IN WEIGHTED SUM FOR CONVEX MULTIOBJECTIVE OPTIMIZATION. Abimbola M. Jubril. 1. Introduction FACTA UNIVERSITATIS (NIŠ) Ser. Math. Inform. Vol. 27 No 3 (12), 37 372 A NONLINEAR WEIGHTS SELECTION IN WEIGHTED SUM FOR CONVEX MULTIOBJECTIVE OPTIMIZATION Abimbola M. Jubril Abstract. The weighted sum

More information

Relaxations and Randomized Methods for Nonconvex QCQPs

Relaxations and Randomized Methods for Nonconvex QCQPs Relaxations and Randomized Methods for Nonconvex QCQPs Alexandre d Aspremont, Stephen Boyd EE392o, Stanford University Autumn, 2003 Introduction While some special classes of nonconvex problems can be

More information

A semidefinite relaxation scheme for quadratically constrained quadratic problems with an additional linear constraint

A semidefinite relaxation scheme for quadratically constrained quadratic problems with an additional linear constraint Iranian Journal of Operations Research Vol. 2, No. 2, 20, pp. 29-34 A semidefinite relaxation scheme for quadratically constrained quadratic problems with an additional linear constraint M. Salahi Semidefinite

More information

Deterministic Methods for Detecting Redundant Linear. Constraints in Semidefinite Programming

Deterministic Methods for Detecting Redundant Linear. Constraints in Semidefinite Programming Deterministic Methods for Detecting Redundant Linear Constraints in Semidefinite Programming Daniel Stover Department of Mathematics and Statistics Northen Arizona University,Flagstaff, AZ 86001. July

More information

Lecture 6: Conic Optimization September 8

Lecture 6: Conic Optimization September 8 IE 598: Big Data Optimization Fall 2016 Lecture 6: Conic Optimization September 8 Lecturer: Niao He Scriber: Juan Xu Overview In this lecture, we finish up our previous discussion on optimality conditions

More information

AMULTIOBJECTIVE optimization problem (MOP) can

AMULTIOBJECTIVE optimization problem (MOP) can 1 IEEE TRANSACTIONS ON EVOLUTIONARY COMPUTATION 1 Letters 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 Decomposition-Based Multiobjective Evolutionary Algorithm with an Ensemble of Neighborhood Sizes Shi-Zheng

More information

Fast Algorithms for SDPs derived from the Kalman-Yakubovich-Popov Lemma

Fast Algorithms for SDPs derived from the Kalman-Yakubovich-Popov Lemma Fast Algorithms for SDPs derived from the Kalman-Yakubovich-Popov Lemma Venkataramanan (Ragu) Balakrishnan School of ECE, Purdue University 8 September 2003 European Union RTN Summer School on Multi-Agent

More information

Multiobjective Optimization

Multiobjective Optimization Multiobjective Optimization MTH6418 S Le Digabel, École Polytechnique de Montréal Fall 2015 (v2) MTH6418: Multiobjective 1/36 Plan Introduction Metrics BiMADS Other methods References MTH6418: Multiobjective

More information

Handout 8: Dealing with Data Uncertainty

Handout 8: Dealing with Data Uncertainty MFE 5100: Optimization 2015 16 First Term Handout 8: Dealing with Data Uncertainty Instructor: Anthony Man Cho So December 1, 2015 1 Introduction Conic linear programming CLP, and in particular, semidefinite

More information

Lecture Note 5: Semidefinite Programming for Stability Analysis

Lecture Note 5: Semidefinite Programming for Stability Analysis ECE7850: Hybrid Systems:Theory and Applications Lecture Note 5: Semidefinite Programming for Stability Analysis Wei Zhang Assistant Professor Department of Electrical and Computer Engineering Ohio State

More information

1348 IEEE TRANSACTIONS ON POWER DELIVERY, VOL. 25, NO. 3, JULY /$ IEEE

1348 IEEE TRANSACTIONS ON POWER DELIVERY, VOL. 25, NO. 3, JULY /$ IEEE 1348 IEEE TRANSACTIONS ON POWER DELIVERY, VOL. 25, NO. 3, JULY 2010 Optimal Coordination of Directional Overcurrent Relays Considering Different Network Topologies Using Interval Linear Programming Abbas

More information

Multi Objective Economic Load Dispatch problem using A-Loss Coefficients

Multi Objective Economic Load Dispatch problem using A-Loss Coefficients Volume 114 No. 8 2017, 143-153 ISSN: 1311-8080 (printed version); ISSN: 1314-3395 (on-line version) url: http://www.ijpam.eu ijpam.eu Multi Objective Economic Load Dispatch problem using A-Loss Coefficients

More information

OPTIMAL POWER FLOW (OPF) is a tool that has been

OPTIMAL POWER FLOW (OPF) is a tool that has been IEEE TRANSACTIONS ON POWER SYSTEMS, VOL. 20, NO. 2, MAY 2005 773 Cumulant-Based Probabilistic Optimal Power Flow (P-OPF) With Gaussian and Gamma Distributions Antony Schellenberg, William Rosehart, and

More information

The Trust Region Subproblem with Non-Intersecting Linear Constraints

The Trust Region Subproblem with Non-Intersecting Linear Constraints The Trust Region Subproblem with Non-Intersecting Linear Constraints Samuel Burer Boshi Yang February 21, 2013 Abstract This paper studies an extended trust region subproblem (etrs in which the trust region

More information

CHAPTER 2: QUADRATIC PROGRAMMING

CHAPTER 2: QUADRATIC PROGRAMMING CHAPTER 2: QUADRATIC PROGRAMMING Overview Quadratic programming (QP) problems are characterized by objective functions that are quadratic in the design variables, and linear constraints. In this sense,

More information

Monotonicity Analysis, Evolutionary Multi-Objective Optimization, and Discovery of Design Principles

Monotonicity Analysis, Evolutionary Multi-Objective Optimization, and Discovery of Design Principles Monotonicity Analysis, Evolutionary Multi-Objective Optimization, and Discovery of Design Principles Kalyanmoy Deb and Aravind Srinivasan Kanpur Genetic Algorithms Laboratory (KanGAL) Indian Institute

More information

A CONIC DANTZIG-WOLFE DECOMPOSITION APPROACH FOR LARGE SCALE SEMIDEFINITE PROGRAMMING

A CONIC DANTZIG-WOLFE DECOMPOSITION APPROACH FOR LARGE SCALE SEMIDEFINITE PROGRAMMING A CONIC DANTZIG-WOLFE DECOMPOSITION APPROACH FOR LARGE SCALE SEMIDEFINITE PROGRAMMING Kartik Krishnan Advanced Optimization Laboratory McMaster University Joint work with Gema Plaza Martinez and Tamás

More information

Bi-objective Portfolio Optimization Using a Customized Hybrid NSGA-II Procedure

Bi-objective Portfolio Optimization Using a Customized Hybrid NSGA-II Procedure Bi-objective Portfolio Optimization Using a Customized Hybrid NSGA-II Procedure Kalyanmoy Deb 1, Ralph E. Steuer 2, Rajat Tewari 3, and Rahul Tewari 4 1 Department of Mechanical Engineering, Indian Institute

More information

Optimal Rate and Maximum Erasure Probability LDPC Codes in Binary Erasure Channel

Optimal Rate and Maximum Erasure Probability LDPC Codes in Binary Erasure Channel Optimal Rate and Maximum Erasure Probability LDPC Codes in Binary Erasure Channel H. Tavakoli Electrical Engineering Department K.N. Toosi University of Technology, Tehran, Iran tavakoli@ee.kntu.ac.ir

More information

Advances in Convex Optimization: Theory, Algorithms, and Applications

Advances in Convex Optimization: Theory, Algorithms, and Applications Advances in Convex Optimization: Theory, Algorithms, and Applications Stephen Boyd Electrical Engineering Department Stanford University (joint work with Lieven Vandenberghe, UCLA) ISIT 02 ISIT 02 Lausanne

More information

IN THIS PAPER, we consider a class of continuous-time recurrent

IN THIS PAPER, we consider a class of continuous-time recurrent IEEE TRANSACTIONS ON CIRCUITS AND SYSTEMS II: EXPRESS BRIEFS, VOL. 51, NO. 4, APRIL 2004 161 Global Output Convergence of a Class of Continuous-Time Recurrent Neural Networks With Time-Varying Thresholds

More information

Convexification of Mixed-Integer Quadratically Constrained Quadratic Programs

Convexification of Mixed-Integer Quadratically Constrained Quadratic Programs Convexification of Mixed-Integer Quadratically Constrained Quadratic Programs Laura Galli 1 Adam N. Letchford 2 Lancaster, April 2011 1 DEIS, University of Bologna, Italy 2 Department of Management Science,

More information

A Decomposition Based Approach for Solving a General Bilevel Linear Programming

A Decomposition Based Approach for Solving a General Bilevel Linear Programming A Decomposition Based Approach for Solving a General Bilevel Linear Programming Xuan Liu, Member, IEEE, Zuyi Li, Senior Member, IEEE Abstract Bilevel optimization has been widely used in decisionmaking

More information

Graph and Controller Design for Disturbance Attenuation in Consensus Networks

Graph and Controller Design for Disturbance Attenuation in Consensus Networks 203 3th International Conference on Control, Automation and Systems (ICCAS 203) Oct. 20-23, 203 in Kimdaejung Convention Center, Gwangju, Korea Graph and Controller Design for Disturbance Attenuation in

More information

Semidefinite and Second Order Cone Programming Seminar Fall 2012 Project: Robust Optimization and its Application of Robust Portfolio Optimization

Semidefinite and Second Order Cone Programming Seminar Fall 2012 Project: Robust Optimization and its Application of Robust Portfolio Optimization Semidefinite and Second Order Cone Programming Seminar Fall 2012 Project: Robust Optimization and its Application of Robust Portfolio Optimization Instructor: Farid Alizadeh Author: Ai Kagawa 12/12/2012

More information

H State-Feedback Controller Design for Discrete-Time Fuzzy Systems Using Fuzzy Weighting-Dependent Lyapunov Functions

H State-Feedback Controller Design for Discrete-Time Fuzzy Systems Using Fuzzy Weighting-Dependent Lyapunov Functions IEEE TRANSACTIONS ON FUZZY SYSTEMS, VOL 11, NO 2, APRIL 2003 271 H State-Feedback Controller Design for Discrete-Time Fuzzy Systems Using Fuzzy Weighting-Dependent Lyapunov Functions Doo Jin Choi and PooGyeon

More information

Analytical Validation Tools for Safety Critical Systems

Analytical Validation Tools for Safety Critical Systems Analytical Validation Tools for Safety Critical Systems Peter Seiler and Gary Balas Department of Aerospace Engineering & Mechanics, University of Minnesota, Minneapolis, MN, 55455, USA Andrew Packard

More information

Multi-objective Emission constrained Economic Power Dispatch Using Differential Evolution Algorithm

Multi-objective Emission constrained Economic Power Dispatch Using Differential Evolution Algorithm Multi-objective Emission constrained Economic Power Dispatch Using Differential Evolution Algorithm Sunil Kumar Soni, Vijay Bhuria Abstract The main aim of power utilities is to provide high quality power

More information

Distributionally Robust Convex Optimization

Distributionally Robust Convex Optimization Submitted to Operations Research manuscript OPRE-2013-02-060 Authors are encouraged to submit new papers to INFORMS journals by means of a style file template, which includes the journal title. However,

More information

POLYNOMIAL OPTIMIZATION WITH SUMS-OF-SQUARES INTERPOLANTS

POLYNOMIAL OPTIMIZATION WITH SUMS-OF-SQUARES INTERPOLANTS POLYNOMIAL OPTIMIZATION WITH SUMS-OF-SQUARES INTERPOLANTS Sercan Yıldız syildiz@samsi.info in collaboration with Dávid Papp (NCSU) OPT Transition Workshop May 02, 2017 OUTLINE Polynomial optimization and

More information

Strong duality in Lasserre s hierarchy for polynomial optimization

Strong duality in Lasserre s hierarchy for polynomial optimization Strong duality in Lasserre s hierarchy for polynomial optimization arxiv:1405.7334v1 [math.oc] 28 May 2014 Cédric Josz 1,2, Didier Henrion 3,4,5 Draft of January 24, 2018 Abstract A polynomial optimization

More information

Course Outline. FRTN10 Multivariable Control, Lecture 13. General idea for Lectures Lecture 13 Outline. Example 1 (Doyle Stein, 1979)

Course Outline. FRTN10 Multivariable Control, Lecture 13. General idea for Lectures Lecture 13 Outline. Example 1 (Doyle Stein, 1979) Course Outline FRTN Multivariable Control, Lecture Automatic Control LTH, 6 L-L Specifications, models and loop-shaping by hand L6-L8 Limitations on achievable performance L9-L Controller optimization:

More information

Duality, Achievable Rates, and Sum-Rate Capacity of Gaussian MIMO Broadcast Channels

Duality, Achievable Rates, and Sum-Rate Capacity of Gaussian MIMO Broadcast Channels 2658 IEEE TRANSACTIONS ON INFORMATION THEORY, VOL 49, NO 10, OCTOBER 2003 Duality, Achievable Rates, and Sum-Rate Capacity of Gaussian MIMO Broadcast Channels Sriram Vishwanath, Student Member, IEEE, Nihar

More information

Various Techniques for Nonlinear Energy-Related Optimizations. Javad Lavaei. Department of Electrical Engineering Columbia University

Various Techniques for Nonlinear Energy-Related Optimizations. Javad Lavaei. Department of Electrical Engineering Columbia University Various Techniques for Nonlinear Energy-Related Optimizations Javad Lavaei Department of Electrical Engineering Columbia University Acknowledgements Caltech: Steven Low, Somayeh Sojoudi Columbia University:

More information

MIT Algebraic techniques and semidefinite optimization February 14, Lecture 3

MIT Algebraic techniques and semidefinite optimization February 14, Lecture 3 MI 6.97 Algebraic techniques and semidefinite optimization February 4, 6 Lecture 3 Lecturer: Pablo A. Parrilo Scribe: Pablo A. Parrilo In this lecture, we will discuss one of the most important applications

More information

Croatian Operational Research Review (CRORR), Vol. 3, 2012

Croatian Operational Research Review (CRORR), Vol. 3, 2012 126 127 128 129 130 131 132 133 REFERENCES [BM03] S. Burer and R.D.C. Monteiro (2003), A nonlinear programming algorithm for solving semidefinite programs via low-rank factorization, Mathematical Programming

More information

12. Interior-point methods

12. Interior-point methods 12. Interior-point methods Convex Optimization Boyd & Vandenberghe inequality constrained minimization logarithmic barrier function and central path barrier method feasibility and phase I methods complexity

More information

Contents Economic dispatch of thermal units

Contents Economic dispatch of thermal units Contents 2 Economic dispatch of thermal units 2 2.1 Introduction................................... 2 2.2 Economic dispatch problem (neglecting transmission losses)......... 3 2.2.1 Fuel cost characteristics........................

More information

Identifying Redundant Linear Constraints in Systems of Linear Matrix. Inequality Constraints. Shafiu Jibrin

Identifying Redundant Linear Constraints in Systems of Linear Matrix. Inequality Constraints. Shafiu Jibrin Identifying Redundant Linear Constraints in Systems of Linear Matrix Inequality Constraints Shafiu Jibrin (shafiu.jibrin@nau.edu) Department of Mathematics and Statistics Northern Arizona University, Flagstaff

More information

E5295/5B5749 Convex optimization with engineering applications. Lecture 5. Convex programming and semidefinite programming

E5295/5B5749 Convex optimization with engineering applications. Lecture 5. Convex programming and semidefinite programming E5295/5B5749 Convex optimization with engineering applications Lecture 5 Convex programming and semidefinite programming A. Forsgren, KTH 1 Lecture 5 Convex optimization 2006/2007 Convex quadratic program

More information

Largest dual ellipsoids inscribed in dual cones

Largest dual ellipsoids inscribed in dual cones Largest dual ellipsoids inscribed in dual cones M. J. Todd June 23, 2005 Abstract Suppose x and s lie in the interiors of a cone K and its dual K respectively. We seek dual ellipsoidal norms such that

More information

TIES598 Nonlinear Multiobjective Optimization A priori and a posteriori methods spring 2017

TIES598 Nonlinear Multiobjective Optimization A priori and a posteriori methods spring 2017 TIES598 Nonlinear Multiobjective Optimization A priori and a posteriori methods spring 2017 Jussi Hakanen jussi.hakanen@jyu.fi Contents A priori methods A posteriori methods Some example methods Learning

More information

Filter Design for Linear Time Delay Systems

Filter Design for Linear Time Delay Systems IEEE TRANSACTIONS ON SIGNAL PROCESSING, VOL. 49, NO. 11, NOVEMBER 2001 2839 ANewH Filter Design for Linear Time Delay Systems E. Fridman Uri Shaked, Fellow, IEEE Abstract A new delay-dependent filtering

More information

Lecture 1: Introduction

Lecture 1: Introduction EE 227A: Convex Optimization and Applications January 17 Lecture 1: Introduction Lecturer: Anh Pham Reading assignment: Chapter 1 of BV 1. Course outline and organization Course web page: http://www.eecs.berkeley.edu/~elghaoui/teaching/ee227a/

More information

Secure Communications of Chaotic Systems with Robust Performance via Fuzzy Observer-Based Design

Secure Communications of Chaotic Systems with Robust Performance via Fuzzy Observer-Based Design 212 IEEE TRANSACTIONS ON FUZZY SYSTEMS, VOL 9, NO 1, FEBRUARY 2001 Secure Communications of Chaotic Systems with Robust Performance via Fuzzy Observer-Based Design Kuang-Yow Lian, Chian-Song Chiu, Tung-Sheng

More information

Robust Gain Scheduling Synchronization Method for Quadratic Chaotic Systems With Channel Time Delay Yu Liang and Horacio J.

Robust Gain Scheduling Synchronization Method for Quadratic Chaotic Systems With Channel Time Delay Yu Liang and Horacio J. 604 IEEE TRANSACTIONS ON CIRCUITS AND SYSTEMS I: REGULAR PAPERS, VOL. 56, NO. 3, MARCH 2009 Robust Gain Scheduling Synchronization Method for Quadratic Chaotic Systems With Channel Time Delay Yu Liang

More information

OPTIMAL DISPATCH OF REAL POWER GENERATION USING PARTICLE SWARM OPTIMIZATION: A CASE STUDY OF EGBIN THERMAL STATION

OPTIMAL DISPATCH OF REAL POWER GENERATION USING PARTICLE SWARM OPTIMIZATION: A CASE STUDY OF EGBIN THERMAL STATION OPTIMAL DISPATCH OF REAL POWER GENERATION USING PARTICLE SWARM OPTIMIZATION: A CASE STUDY OF EGBIN THERMAL STATION Onah C. O. 1, Agber J. U. 2 and Ikule F. T. 3 1, 2, 3 Department of Electrical and Electronics

More information

Parameterized Linear Matrix Inequality Techniques in Fuzzy Control System Design

Parameterized Linear Matrix Inequality Techniques in Fuzzy Control System Design 324 IEEE TRANSACTIONS ON FUZZY SYSTEMS, VOL. 9, NO. 2, APRIL 2001 Parameterized Linear Matrix Inequality Techniques in Fuzzy Control System Design H. D. Tuan, P. Apkarian, T. Narikiyo, and Y. Yamamoto

More information

Tutorial on Convex Optimization for Engineers Part II

Tutorial on Convex Optimization for Engineers Part II Tutorial on Convex Optimization for Engineers Part II M.Sc. Jens Steinwandt Communications Research Laboratory Ilmenau University of Technology PO Box 100565 D-98684 Ilmenau, Germany jens.steinwandt@tu-ilmenau.de

More information

Interior Point Algorithms for Constrained Convex Optimization

Interior Point Algorithms for Constrained Convex Optimization Interior Point Algorithms for Constrained Convex Optimization Chee Wei Tan CS 8292 : Advanced Topics in Convex Optimization and its Applications Fall 2010 Outline Inequality constrained minimization problems

More information

5. Duality. Lagrangian

5. Duality. Lagrangian 5. Duality Convex Optimization Boyd & Vandenberghe Lagrange dual problem weak and strong duality geometric interpretation optimality conditions perturbation and sensitivity analysis examples generalized

More information

From Convex Optimization to Linear Matrix Inequalities

From Convex Optimization to Linear Matrix Inequalities Dep. of Information Engineering University of Pisa (Italy) From Convex Optimization to Linear Matrix Inequalities eng. Sergio Grammatico grammatico.sergio@gmail.com Class of Identification of Uncertain

More information

Lagrange Duality. Daniel P. Palomar. Hong Kong University of Science and Technology (HKUST)

Lagrange Duality. Daniel P. Palomar. Hong Kong University of Science and Technology (HKUST) Lagrange Duality Daniel P. Palomar Hong Kong University of Science and Technology (HKUST) ELEC5470 - Convex Optimization Fall 2017-18, HKUST, Hong Kong Outline of Lecture Lagrangian Dual function Dual

More information

Convex Optimization. (EE227A: UC Berkeley) Lecture 6. Suvrit Sra. (Conic optimization) 07 Feb, 2013

Convex Optimization. (EE227A: UC Berkeley) Lecture 6. Suvrit Sra. (Conic optimization) 07 Feb, 2013 Convex Optimization (EE227A: UC Berkeley) Lecture 6 (Conic optimization) 07 Feb, 2013 Suvrit Sra Organizational Info Quiz coming up on 19th Feb. Project teams by 19th Feb Good if you can mix your research

More information

Lecture 1. 1 Conic programming. MA 796S: Convex Optimization and Interior Point Methods October 8, Consider the conic program. min.

Lecture 1. 1 Conic programming. MA 796S: Convex Optimization and Interior Point Methods October 8, Consider the conic program. min. MA 796S: Convex Optimization and Interior Point Methods October 8, 2007 Lecture 1 Lecturer: Kartik Sivaramakrishnan Scribe: Kartik Sivaramakrishnan 1 Conic programming Consider the conic program min s.t.

More information

Optimization in. Stephen Boyd. 3rd SIAM Conf. Control & Applications. and Control Theory. System. Convex

Optimization in. Stephen Boyd. 3rd SIAM Conf. Control & Applications. and Control Theory. System. Convex Optimization in Convex and Control Theory System Stephen Boyd Engineering Department Electrical University Stanford 3rd SIAM Conf. Control & Applications 1 Basic idea Many problems arising in system and

More information

ELE539A: Optimization of Communication Systems Lecture 15: Semidefinite Programming, Detection and Estimation Applications

ELE539A: Optimization of Communication Systems Lecture 15: Semidefinite Programming, Detection and Estimation Applications ELE539A: Optimization of Communication Systems Lecture 15: Semidefinite Programming, Detection and Estimation Applications Professor M. Chiang Electrical Engineering Department, Princeton University March

More information

Marcus Pantoja da Silva 1 and Celso Pascoli Bottura 2. Abstract: Nonlinear systems with time-varying uncertainties

Marcus Pantoja da Silva 1 and Celso Pascoli Bottura 2. Abstract: Nonlinear systems with time-varying uncertainties A NEW PROPOSAL FOR H NORM CHARACTERIZATION AND THE OPTIMAL H CONTROL OF NONLINEAR SSTEMS WITH TIME-VARING UNCERTAINTIES WITH KNOWN NORM BOUND AND EXOGENOUS DISTURBANCES Marcus Pantoja da Silva 1 and Celso

More information

Behavior of EMO Algorithms on Many-Objective Optimization Problems with Correlated Objectives

Behavior of EMO Algorithms on Many-Objective Optimization Problems with Correlated Objectives H. Ishibuchi N. Akedo H. Ohyanagi and Y. Nojima Behavior of EMO algorithms on many-objective optimization problems with correlated objectives Proc. of 211 IEEE Congress on Evolutionary Computation pp.

More information

Acyclic Semidefinite Approximations of Quadratically Constrained Quadratic Programs

Acyclic Semidefinite Approximations of Quadratically Constrained Quadratic Programs 2015 American Control Conference Palmer House Hilton July 1-3, 2015. Chicago, IL, USA Acyclic Semidefinite Approximations of Quadratically Constrained Quadratic Programs Raphael Louca and Eilyan Bitar

More information

Semidefinite Programming Basics and Applications

Semidefinite Programming Basics and Applications Semidefinite Programming Basics and Applications Ray Pörn, principal lecturer Åbo Akademi University Novia University of Applied Sciences Content What is semidefinite programming (SDP)? How to represent

More information

Robust Multi-Objective Optimization in High Dimensional Spaces

Robust Multi-Objective Optimization in High Dimensional Spaces Robust Multi-Objective Optimization in High Dimensional Spaces André Sülflow, Nicole Drechsler, and Rolf Drechsler Institute of Computer Science University of Bremen 28359 Bremen, Germany {suelflow,nd,drechsle}@informatik.uni-bremen.de

More information

Evolutionary Multiobjective. Optimization Methods for the Shape Design of Industrial Electromagnetic Devices. P. Di Barba, University of Pavia, Italy

Evolutionary Multiobjective. Optimization Methods for the Shape Design of Industrial Electromagnetic Devices. P. Di Barba, University of Pavia, Italy Evolutionary Multiobjective Optimization Methods for the Shape Design of Industrial Electromagnetic Devices P. Di Barba, University of Pavia, Italy INTRODUCTION Evolutionary Multiobjective Optimization

More information

I.3. LMI DUALITY. Didier HENRION EECI Graduate School on Control Supélec - Spring 2010

I.3. LMI DUALITY. Didier HENRION EECI Graduate School on Control Supélec - Spring 2010 I.3. LMI DUALITY Didier HENRION henrion@laas.fr EECI Graduate School on Control Supélec - Spring 2010 Primal and dual For primal problem p = inf x g 0 (x) s.t. g i (x) 0 define Lagrangian L(x, z) = g 0

More information

Robust linear optimization under general norms

Robust linear optimization under general norms Operations Research Letters 3 (004) 50 56 Operations Research Letters www.elsevier.com/locate/dsw Robust linear optimization under general norms Dimitris Bertsimas a; ;, Dessislava Pachamanova b, Melvyn

More information

SIGNIFICANT increase in amount of private distributed

SIGNIFICANT increase in amount of private distributed 1 Distributed DC Optimal Power Flow for Radial Networks Through Partial Primal Dual Algorithm Vahid Rasouli Disfani, Student Member, IEEE, Lingling Fan, Senior Member, IEEE, Zhixin Miao, Senior Member,

More information

Alternative Decompositions for Distributed Maximization of Network Utility: Framework and Applications

Alternative Decompositions for Distributed Maximization of Network Utility: Framework and Applications Alternative Decompositions for Distributed Maximization of Network Utility: Framework and Applications Daniel P. Palomar Hong Kong University of Science and Technology (HKUST) ELEC5470 - Convex Optimization

More information

Multiobjective optimization methods

Multiobjective optimization methods Multiobjective optimization methods Jussi Hakanen Post-doctoral researcher jussi.hakanen@jyu.fi spring 2014 TIES483 Nonlinear optimization No-preference methods DM not available (e.g. online optimization)

More information

Exact SDP Relaxations for Classes of Nonlinear Semidefinite Programming Problems

Exact SDP Relaxations for Classes of Nonlinear Semidefinite Programming Problems Exact SDP Relaxations for Classes of Nonlinear Semidefinite Programming Problems V. Jeyakumar and G. Li Revised Version:August 31, 2012 Abstract An exact semidefinite linear programming (SDP) relaxation

More information

Recent Advances in Solving AC OPF & Robust UC

Recent Advances in Solving AC OPF & Robust UC Recent Advances in Solving AC OPF & Robust UC Andy Sun Georgia Institute of Technology (andy.sun@isye.gatech.edu) PSERC Webinar Oct 17, 2017 Major Challenges Non-convexity: Discrete decisions: On/off operational/maintenance

More information

Handout 6: Some Applications of Conic Linear Programming

Handout 6: Some Applications of Conic Linear Programming ENGG 550: Foundations of Optimization 08 9 First Term Handout 6: Some Applications of Conic Linear Programming Instructor: Anthony Man Cho So November, 08 Introduction Conic linear programming CLP, and

More information

CONVEX OPTIMIZATION OVER POSITIVE POLYNOMIALS AND FILTER DESIGN. Y. Genin, Y. Hachez, Yu. Nesterov, P. Van Dooren

CONVEX OPTIMIZATION OVER POSITIVE POLYNOMIALS AND FILTER DESIGN. Y. Genin, Y. Hachez, Yu. Nesterov, P. Van Dooren CONVEX OPTIMIZATION OVER POSITIVE POLYNOMIALS AND FILTER DESIGN Y. Genin, Y. Hachez, Yu. Nesterov, P. Van Dooren CESAME, Université catholique de Louvain Bâtiment Euler, Avenue G. Lemaître 4-6 B-1348 Louvain-la-Neuve,

More information

Research overview. Seminar September 4, Lehigh University Department of Industrial & Systems Engineering. Research overview.

Research overview. Seminar September 4, Lehigh University Department of Industrial & Systems Engineering. Research overview. Research overview Lehigh University Department of Industrial & Systems Engineering COR@L Seminar September 4, 2008 1 Duality without regularity condition Duality in non-exact arithmetic 2 interior point

More information

Module 04 Optimization Problems KKT Conditions & Solvers

Module 04 Optimization Problems KKT Conditions & Solvers Module 04 Optimization Problems KKT Conditions & Solvers Ahmad F. Taha EE 5243: Introduction to Cyber-Physical Systems Email: ahmad.taha@utsa.edu Webpage: http://engineering.utsa.edu/ taha/index.html September

More information

PIBEA: Prospect Indicator Based Evolutionary Algorithm for Multiobjective Optimization Problems

PIBEA: Prospect Indicator Based Evolutionary Algorithm for Multiobjective Optimization Problems PIBEA: Prospect Indicator Based Evolutionary Algorithm for Multiobjective Optimization Problems Pruet Boonma Department of Computer Engineering Chiang Mai University Chiang Mai, 52, Thailand Email: pruet@eng.cmu.ac.th

More information

Dynamic Output Feedback Controller for a Harvested Fish Population System

Dynamic Output Feedback Controller for a Harvested Fish Population System Dynamic Output Feedback Controller for a Harvested Fish Population System Achraf Ait Kaddour, El Houssine Elmazoudi, Noureddine Elalami Abstract This paper deals with the control of a continuous age structured

More information

Sparse PCA with applications in finance

Sparse PCA with applications in finance Sparse PCA with applications in finance A. d Aspremont, L. El Ghaoui, M. Jordan, G. Lanckriet ORFE, Princeton University & EECS, U.C. Berkeley Available online at www.princeton.edu/~aspremon 1 Introduction

More information

Robust Observer for Uncertain T S model of a Synchronous Machine

Robust Observer for Uncertain T S model of a Synchronous Machine Recent Advances in Circuits Communications Signal Processing Robust Observer for Uncertain T S model of a Synchronous Machine OUAALINE Najat ELALAMI Noureddine Laboratory of Automation Computer Engineering

More information

Modern Optimal Control

Modern Optimal Control Modern Optimal Control Matthew M. Peet Arizona State University Lecture 19: Stabilization via LMIs Optimization Optimization can be posed in functional form: min x F objective function : inequality constraints

More information

w Kluwer Academic Publishers Boston/Dordrecht/London HANDBOOK OF SEMIDEFINITE PROGRAMMING Theory, Algorithms, and Applications

w Kluwer Academic Publishers Boston/Dordrecht/London HANDBOOK OF SEMIDEFINITE PROGRAMMING Theory, Algorithms, and Applications HANDBOOK OF SEMIDEFINITE PROGRAMMING Theory, Algorithms, and Applications Edited by Henry Wolkowicz Department of Combinatorics and Optimization Faculty of Mathematics University of Waterloo Waterloo,

More information

WE study the capacity of peak-power limited, single-antenna,

WE study the capacity of peak-power limited, single-antenna, 1158 IEEE TRANSACTIONS ON INFORMATION THEORY, VOL. 56, NO. 3, MARCH 2010 Gaussian Fading Is the Worst Fading Tobias Koch, Member, IEEE, and Amos Lapidoth, Fellow, IEEE Abstract The capacity of peak-power

More information

Construction of power flow feasibility sets

Construction of power flow feasibility sets IEEE TRANSACTIONS ON POWER SYSTEMS, VOL., NO., 2015 1 Construction of power flow feasibility sets Krishnamurthy Dvijotham, Konstantin Turitsyn arxiv:1506.07191v3 [cs.sy] 11 Jul 2015 Abstract We develop

More information

Introduction to optimization

Introduction to optimization Introduction to optimization Geir Dahl CMA, Dept. of Mathematics and Dept. of Informatics University of Oslo 1 / 24 The plan 1. The basic concepts 2. Some useful tools (linear programming = linear optimization)

More information

Multiuser Downlink Beamforming: Rank-Constrained SDP

Multiuser Downlink Beamforming: Rank-Constrained SDP Multiuser Downlink Beamforming: Rank-Constrained SDP Daniel P. Palomar Hong Kong University of Science and Technology (HKUST) ELEC5470 - Convex Optimization Fall 2018-19, HKUST, Hong Kong Outline of Lecture

More information

Multi-objective Quadratic Assignment Problem instances generator with a known optimum solution

Multi-objective Quadratic Assignment Problem instances generator with a known optimum solution Multi-objective Quadratic Assignment Problem instances generator with a known optimum solution Mădălina M. Drugan Artificial Intelligence lab, Vrije Universiteit Brussel, Pleinlaan 2, B-1050 Brussels,

More information

Rank-one LMIs and Lyapunov's Inequality. Gjerrit Meinsma 4. Abstract. We describe a new proof of the well-known Lyapunov's matrix inequality about

Rank-one LMIs and Lyapunov's Inequality. Gjerrit Meinsma 4. Abstract. We describe a new proof of the well-known Lyapunov's matrix inequality about Rank-one LMIs and Lyapunov's Inequality Didier Henrion 1;; Gjerrit Meinsma Abstract We describe a new proof of the well-known Lyapunov's matrix inequality about the location of the eigenvalues of a matrix

More information

6.854J / J Advanced Algorithms Fall 2008

6.854J / J Advanced Algorithms Fall 2008 MIT OpenCourseWare http://ocw.mit.edu 6.85J / 8.5J Advanced Algorithms Fall 008 For information about citing these materials or our Terms of Use, visit: http://ocw.mit.edu/terms. 8.5/6.85 Advanced Algorithms

More information

Optimal Power Flow. S. Bose, M. Chandy, M. Farivar, D. Gayme S. Low. C. Clarke. Southern California Edison. Caltech. March 2012

Optimal Power Flow. S. Bose, M. Chandy, M. Farivar, D. Gayme S. Low. C. Clarke. Southern California Edison. Caltech. March 2012 Optimal Power Flow over Radial Networks S. Bose, M. Chandy, M. Farivar, D. Gayme S. Low Caltech C. Clarke Southern California Edison March 2012 Outline Motivation Semidefinite relaxation Bus injection

More information

Generalization of Dominance Relation-Based Replacement Rules for Memetic EMO Algorithms

Generalization of Dominance Relation-Based Replacement Rules for Memetic EMO Algorithms Generalization of Dominance Relation-Based Replacement Rules for Memetic EMO Algorithms Tadahiko Murata 1, Shiori Kaige 2, and Hisao Ishibuchi 2 1 Department of Informatics, Kansai University 2-1-1 Ryozenji-cho,

More information

An Approach to Achieving Global Optimum of AC Electric Power System State Estimators

An Approach to Achieving Global Optimum of AC Electric Power System State Estimators 1 An Approach to Achieving Global Optimum of AC Electric Power System State Estimators Yang Weng, Student Member, IEEE, Marija D. Ilić, Fellow, IEEE Abstract This paper is motivated by the open questions

More information

OPTIMAL POWER FLOW BASED ON PARTICLE SWARM OPTIMIZATION

OPTIMAL POWER FLOW BASED ON PARTICLE SWARM OPTIMIZATION U.P.B. Sci. Bull., Series C, Vol. 78, Iss. 3, 2016 ISSN 2286-3540 OPTIMAL POWER FLOW BASED ON PARTICLE SWARM OPTIMIZATION Layth AL-BAHRANI 1, Virgil DUMBRAVA 2 Optimal Power Flow (OPF) is one of the most

More information

On distributional robust probability functions and their computations

On distributional robust probability functions and their computations On distributional robust probability functions and their computations Man Hong WONG a,, Shuzhong ZHANG b a Department of Systems Engineering and Engineering Management, The Chinese University of Hong Kong,

More information

Are There Sixth Order Three Dimensional PNS Hankel Tensors?

Are There Sixth Order Three Dimensional PNS Hankel Tensors? Are There Sixth Order Three Dimensional PNS Hankel Tensors? Guoyin Li Liqun Qi Qun Wang November 17, 014 Abstract Are there positive semi-definite PSD) but not sums of squares SOS) Hankel tensors? If the

More information

On the Capacity of Free-Space Optical Intensity Channels

On the Capacity of Free-Space Optical Intensity Channels On the Capacity of Free-Space Optical Intensity Channels Amos Lapidoth TH Zurich Zurich, Switzerl mail: lapidoth@isi.ee.ethz.ch Stefan M. Moser National Chiao Tung University NCTU Hsinchu, Taiwan mail:

More information

The Existence of Multiple Power Flow Solutions in Unbalanced Three-Phase Circuits

The Existence of Multiple Power Flow Solutions in Unbalanced Three-Phase Circuits IEEE TRANSACTIONS ON POWER SYSTEMS, VOL. 18, NO. 2, MAY 2003 605 The Existence of Multiple Power Flow Solutions in Unbalanced Three-Phase Circuits Yuanning Wang, Student Member, IEEE, and Wilsun Xu, Senior

More information

l p -Norm Constrained Quadratic Programming: Conic Approximation Methods

l p -Norm Constrained Quadratic Programming: Conic Approximation Methods OUTLINE l p -Norm Constrained Quadratic Programming: Conic Approximation Methods Wenxun Xing Department of Mathematical Sciences Tsinghua University, Beijing Email: wxing@math.tsinghua.edu.cn OUTLINE OUTLINE

More information

Convex Optimization Boyd & Vandenberghe. 5. Duality

Convex Optimization Boyd & Vandenberghe. 5. Duality 5. Duality Convex Optimization Boyd & Vandenberghe Lagrange dual problem weak and strong duality geometric interpretation optimality conditions perturbation and sensitivity analysis examples generalized

More information

A Hierarchy of Suboptimal Policies for the Multi-period, Multi-echelon, Robust Inventory Problem

A Hierarchy of Suboptimal Policies for the Multi-period, Multi-echelon, Robust Inventory Problem A Hierarchy of Suboptimal Policies for the Multi-period, Multi-echelon, Robust Inventory Problem Dimitris J. Bertsimas Dan A. Iancu Pablo A. Parrilo Sloan School of Management and Operations Research Center,

More information

minimize x x2 2 x 1x 2 x 1 subject to x 1 +2x 2 u 1 x 1 4x 2 u 2, 5x 1 +76x 2 1,

minimize x x2 2 x 1x 2 x 1 subject to x 1 +2x 2 u 1 x 1 4x 2 u 2, 5x 1 +76x 2 1, 4 Duality 4.1 Numerical perturbation analysis example. Consider the quadratic program with variables x 1, x 2, and parameters u 1, u 2. minimize x 2 1 +2x2 2 x 1x 2 x 1 subject to x 1 +2x 2 u 1 x 1 4x

More information

Relations between Semidefinite, Copositive, Semi-infinite and Integer Programming

Relations between Semidefinite, Copositive, Semi-infinite and Integer Programming Relations between Semidefinite, Copositive, Semi-infinite and Integer Programming Author: Faizan Ahmed Supervisor: Dr. Georg Still Master Thesis University of Twente the Netherlands May 2010 Relations

More information