Development of a Branch-and-Bound Global Optimization Based on B-spline Approximation

2010 ◽  
Vol 34 (2) ◽  
pp. 191-201
Author(s):  
Sang-Kun Park
2020 ◽  
Vol 10 (1) ◽  
pp. 110-123
Author(s):  
Gaël Kermarrec ◽  
Hamza Alkhatib

Abstract B-spline curves are a linear combination of control points (CP) and B-spline basis functions. They satisfy the strong convex hull property and have a fine and local shape control as changing one CP affects the curve locally, whereas the total number of CP has a more general effect on the control polygon of the spline. Information criteria (IC), such as Akaike IC (AIC) and Bayesian IC (BIC), provide a way to determine an optimal number of CP so that the B-spline approximation fits optimally in a least-squares (LS) sense with scattered and noisy observations. These criteria are based on the log-likelihood of the models and assume often that the error term is independent and identically distributed. This assumption is strong and accounts neither for heteroscedasticity nor for correlations. Thus, such effects have to be considered to avoid under-or overfitting of the observations in the LS adjustment, i.e. bad approximation or noise approximation, respectively. In this contribution, we introduce generalized versions of the BIC derived using the concept of quasi- likelihood estimator (QLE). Our own extensions of the generalized BIC criteria account (i) explicitly for model misspecifications and complexity (ii) and additionally for the correlations of the residuals. To that aim, the correlation model of the residuals is assumed to correspond to a first order autoregressive process AR(1). We apply our general derivations to the specific case of B-spline approximations of curves and surfaces, and couple the information given by the different IC together. Consecutively, a didactical yet simple procedure to interpret the results given by the IC is provided in order to identify an optimal number of parameters to estimate in case of correlated observations. A concrete case study using observations from a bridge scanned with a Terrestrial Laser Scanner (TLS) highlights the proposed procedure.


Author(s):  
Joanna M. Brown ◽  
Malcolm I. G. Bloor ◽  
M. Susan Bloor ◽  
Michael J. Wilson

Abstract A PDE surface is generated by solving partial differential equations subject to boundary conditions. To obtain an approximation of the PDE surface in the form of a B-spline surface the finite element method, with the basis formed from B-spline basis functions, can be used to solve the equations. The procedure is simplest when uniform B-splines are used, but it is also feasible, and in some cases desirable, to use non-uniform B-splines. It will also be shown that it is possible, if required, to modify the non-uniform B-spline approximation in a variety of ways, using the properties of B-spline surfaces.


2013 ◽  
Vol 2013 ◽  
pp. 1-7 ◽  
Author(s):  
Yuelin Gao ◽  
Siqiao Jin

We equivalently transform the sum of linear ratios programming problem into bilinear programming problem, then by using the linear characteristics of convex envelope and concave envelope of double variables product function, linear relaxation programming of the bilinear programming problem is given, which can determine the lower bound of the optimal value of original problem. Therefore, a branch and bound algorithm for solving sum of linear ratios programming problem is put forward, and the convergence of the algorithm is proved. Numerical experiments are reported to show the effectiveness of the proposed algorithm.


Filomat ◽  
2016 ◽  
Vol 30 (3) ◽  
pp. 853-861 ◽  
Author(s):  
Ozlem Ersoy ◽  
Idiris Dag

In this study the Kuramoto-Sivashinsky (KS) equation has been solved using the collocation method, based on the exponential cubic B-spline approximation together with the Crank Nicolson. KS equation is fully integrated into a linearized algebraic equations. The results of the proposed method are compared with both numerical and analytical results by studying two text problems. It is found that the simulating results are in good agreement with both exact and existing numerical solutions.


2021 ◽  
Author(s):  
Ilya V. Galaktionov ◽  
Alexander Nikitin ◽  
Julia Sheldakova ◽  
Alexis Kudryashov

Sign in / Sign up

Export Citation Format

Share Document