An interval branch and bound global optimization algorithm for parameter estimation of three photovoltaic models

2020 ◽  
Vol 205 ◽  
pp. 112400 ◽  
Author(s):  
Raphael Chenouard ◽  
Ragab A. El-Sehiemy
Keyword(s):  
Global Optimization ◽  
Parameter Estimation ◽  
Branch And Bound ◽  
Optimization Algorithm ◽  
Global Optimization Algorithm ◽  
Interval Branch And Bound

scholarly journals Global Optimization for Solving Linear Multiplicative Programming Based on a New Linearization Method

2016 ◽  
Vol 2016 ◽  
pp. 1-9
Author(s):  
Chun-Feng Wang ◽  
Yan-Qin Bai
Keyword(s):  
Global Optimization ◽  
Branch And Bound ◽  
Optimization Algorithm ◽  
Linearization Method ◽  
Branch And Bound Algorithm ◽  
Linear Relaxation ◽  
Global Optimization Algorithm ◽  
Multiplicative Programming ◽  
Linear Multiplicative Programming ◽  
Pruning Techniques

This paper presents a new global optimization algorithm for solving a class of linear multiplicative programming (LMP) problem. First, a new linear relaxation technique is proposed. Then, to improve the convergence speed of our algorithm, two pruning techniques are presented. Finally, a branch and bound algorithm is developed for solving the LMP problem. The convergence of this algorithm is proved, and some experiments are reported to illustrate the feasibility and efficiency of this algorithm.

Differential simulated annealing: a robust and efficient global optimization algorithm for parameter estimation of biological networks

2014 ◽  
Vol 10 (6) ◽  
pp. 1385-1392 ◽  
Author(s):  
Ziwei Dai ◽  
Luhua Lai
Keyword(s):  
Global Optimization ◽  
Parameter Estimation ◽  
Simulated Annealing ◽  
Optimization Algorithm ◽  
Biological Networks ◽  
Efficient Global Optimization ◽  
Global Optimization Algorithm ◽  
Large Networks

DSA outperformed five other algorithms in parameter estimation of 95 biological networks and showed significant advantage in large networks.

IMPROVED LIPSCHITZ BOUNDS WITH THE FIRST NORM FOR FUNCTION VALUES OVER MULTIDIMENSIONAL SIMPLEX

2008 ◽  
Vol 13 (4) ◽  
pp. 553-563 ◽  
Author(s):  
Remigijus Paulavičius ◽  
Julius Žilinskas
Keyword(s):  
Global Optimization ◽  
Branch And Bound ◽  
Lipschitz Condition ◽  
Optimization Algorithm ◽  
Upper Bound ◽  
Linear Equations ◽  
Branch And Bound Algorithm ◽  
Maximum Point ◽  
System Of Linear Equations ◽  
Global Optimization Algorithm

A branch and bound algorithm for global optimization is proposed, where the maximum of an upper bounding function based on Lipschitz condition and the first norm over a simplex is used as the upper bound of function. In this case the graph of bounding function is intersection of n‐dimensional pyramids and its maximum point is found solving a system of linear equations. The efficiency of the proposed global optimization algorithm is evaluated experimentally.

Sign in / Sign up

Export Citation Format

Share Document