Hyper-parameterized Dialectic Search for Non-linear Box-Constrained Optimization with Heterogenous Variable Types

Author(s):  
Meinolf Sellmann ◽  
Kevin Tierney
2002 ◽  
Author(s):  
BART G VAN BLOEMEN WAANDERS ◽  
ROSCOE A BARTLETT ◽  
KEVIN R LONG ◽  
PAUL T BOGGS ◽  
ANDREW G SALINGER

Author(s):  
B. Soheilian ◽  
M. Brédif

The paper presents an algorithm for reconstruction of 3D circle from its apparition in <i>n</i> images. It supposes that camera poses are known up to an uncertainty. They will be considered as observations and will be refined during the reconstruction process. First, circle apparitions will be estimated in every individual image from a set of 2D points using a constrained optimization. Uncertainty of 2D points are propagated in 2D ellipse estimation and leads to covariance matrix of ellipse parameters. In 3D reconstruction process ellipse and camera pose parameters are considered as observations with known covariances. A minimal parametrization of 3D circle enables to model the projection of circle in image without any constraint. The reconstruction is performed by minimizing the length of observation residuals vector in a non linear Gauss-Helmert model. The output consists in parameters of the corresponding circle in 3D and their covariances. The results are presented on simulated data.


Author(s):  
Helen Yuliana Angmalisang ◽  
Syaiful Anam ◽  
Sobri Abusini

<p>Leaders and Followers algorithm was a novel metaheuristics proposed by Yasser Gonzalez-Fernandez and Stephen Chen. In solving unconstrained optimization, it performed better exploration than other well-known metaheuristics, e.g. Genetic Algorithm, Particle Swarm Optimization and Differential Evolution. Therefore, it performed well in multi-modal problems. In this paper, Leaders and Followers was modified for constrained non-linear optimization. Several well-known benchmark problems for constrained optimization were used to evaluate the proposed algorithm. The result of the evaluation showed that the proposed algorithm consistently and successfully found the optimal solution of low dimensional constrained optimization problems and high dimensional optimization with high number of linear inequality constraint only. Moreover, the proposed algorithm had difficulty in solving high dimensional optimization problem with non-linear constraints and any problem which has more than one equality constraint. In the comparison with other metaheuristics, Leaders and Followers had better performance in overall benchmark problems.</p>


Sign in / Sign up

Export Citation Format

Share Document