Lipschitzian optimization without the Lipschitz constant
Journal of Optimization Theory and Applications
Frame based methods for unconstrained optimization
Journal of Optimization Theory and Applications
Numerical Methods Using MATLAB
Numerical Methods Using MATLAB
Convergence of the Nelder--Mead Simplex Method to a Nonstationary Point
SIAM Journal on Optimization
SIAM Journal on Optimization
New interval methods for constrained global optimization
Mathematical Programming: Series A and B
Grid Restrained Nelder-Mead Algorithm
Computational Optimization and Applications
Additive Scaling and the DIRECT Algorithm
Journal of Global Optimization
A Parallel Implementation of the Simplex Function Minimization Routine
Computational Economics
Equity portfolio construction and selection using multiobjective mathematical programming
Journal of Global Optimization
Hi-index | 0.00 |
This paper describes a new direct search method for solving non-standard constrained optimization problems for which standard methodologies do not work properly. Our method (the Rational Iterative Multisection-RIM-algorithm) consists of different stages that can be interpreted as solutions according to different precision requirements. We have performed an application of RIM method to the case of public inputs provision. We prove that the RIM approach and standard methodologies achieve the same results with regular optimization problems while the RIM algorithm takes advantage over others comparable direct-search methods when facing non-standard optimization problems.