Global electricity markets are undergoing a rapid transformation in their energy mix to meet commitments towards sustainable electric grids. This change in energy mix engenders significant challenges, specifically concerning the management of non-dispatchable energy resources. System and market operators are required to meet power system security and reliability requirements whilst providing electricity at competitive prices. An overview of electricity markets is provided in this paper with a critical appraisal of each market’s ability to manage the large-scale energy mix transition. This paper provides a commentary on the distinct features of electricity market models implemented around the world and highlights the barriers within these market models that are hindering the energy mix transition. Various researchers and policymakers are proposing solutions and market reforms for the smooth transitioning of the energy mix. This paper presents a systematic review of the proposed solutions in the literature and critiques the effectiveness and ease of implementation of the reviewed solutions. Research gaps and future research directions are indicated to promote further exploration towards the effective integration of large-scale renewable energy technologies.
27 September 2019 in Optimization Methods and Software
The -algorithm is a superlinearly convergent method for minimizing nonsmooth, convex functions. At each iteration, the algorithm works with a certain -space and its orthogonal -space, such that the nonsmoothness of the objective function is concentrated on its projection onto the -space, and on the -space the projection is smooth. This structure allows for an alternation between a Newton-like step where the function is smooth, and a proximal-point step that is used to find iterates with promising -decompositions. We establish a derivative-free variant of the -algorithm for convex finite-max objective functions. We show global convergence and provide numerical results from a proof-of-concept implementation, which demonstrates the feasibility and practical value of the approach. We also carry out some tests using nonconvex functions and discuss the results.
The properties of positive bases make them a useful tool in derivative-free optimization and an interesting concept in mathematics. The notion of thecosine measurehelps to quantify the quality of a positive basis. It provides information on how well the vectors in the positive basis uniformly cover the space considered. The number of vectors in a positive basis is known to be between $$n+1$$ and 2ninclusively. When the number of vectors is strictly between $$n+1$$ and 2n, we say that it is an intermediate positive basis. In this paper, the structure of intermediate positive bases with maximal cosine measure is investigated. The structure of an intermediate positive basis with maximal cosine measure over a certain subset of positive bases is provided. This type of positive bases has a simple structure that makes them easy to generate with a computer software.
5 March 2018 in Journal of Optimization Theory and Applications
Proximal bundle methods are a class of optimisation algorithms that leverage the proximal operator to address nonsmoothness in the objective function efficiently. This study focuses on a derivative-free (DFO) proximal bundle method and one of its applications called the DFO $\mathcal{VU}$ -algorithm. These algorithms incorporate approximate proximal points as subprocedures in order to optimise convex nonsmooth functions based on approximated subdifferential information. Interestingly, the classical $\mathcal{VU}$ -algorithm, which operates on true subgradient values, achieves superlinear convergence. At each iteration, the algorithm divides the whole space into two: the smooth $\mathcal{U}$ -space and the nonsmooth $\mathcal{V}$ -space. It takes a Newton-like step on the $\mathcal{U}$ -space and a proximal-point step on the $\mathcal{V}$ -space, enabling it to handle both smooth and nonsmooth parts effectively and converge faster. In this work, we reveal the worst possible convergence rate for the DFO $\mathcal{VU}$ -method by showing the linear convergence of the DFO proximal bundle method. This will be done by presenting a suitable framework and using the subdifferential-based error bound on the distance to critical points.
This work introduces the nested-set Hessian approximation, a second-order approximation method that can be used in any derivative-free optimization routine that requires such information. It is built on the foundation of the generalized simplex gradient and proved to have an error bound that is on the order of the maximal radius of the two sets used in its construction. We show that when the points used in the computation of the nested-set Hessian have a favourable structure, (n+1)(n+2)/2 function evaluations are sufficient to approximate the Hessian. However, the nested-set Hessian also allows for evaluation sets with more points without negating the error analysis. Two calculus-based approximation techniques of the Hessian are developed and some advantages of the same are demonstrated.