Geodesic and contour optimization using conformal mapping
From MaRDI portal
Publication:1675629
Abstract: We propose a novel optimization algorithm for continuous functions using geodesics and contours under conformal mapping.The algorithm can find multiple optima by first following a geodesic curve to a local optimum then traveling to the next search area by following a contour curve. To improve the efficiency, Newton-Raphson algorithm is also employed in local search steps. A proposed jumping mechanism based on realized geodesics enables the algorithm to jump to a nearby region and consequently avoid trapping in local optima. Conformal mapping is used to resolve numerical instability associated with solving the classical geodesic equations. Geodesic flows under conformal mapping are constructed numerically by using local quadratic approximation. The parameters in the algorithm are adaptively chosen to reflect local geometric features of the objective function. Comparisons with many commonly used optimization algorithms including gradient, trust region, genetic algorithm and global search methods have shown that the proposed algorithm outperforms most widely used methods in almost all test cases with only a couple of exceptions.
Recommendations
- Optimization algorithm based on densification and dynamic canonical descent
- Optimization by moving ridge functions: derivative-free optimization for computationally intensive functions
- A direct search algorithm for global optimization
- Finding local optima of high-dimensional functions using direct search methods
- A batch, derivative-free algorithm for finding multiple local minima
Cites work
- A class of test functions for global optimization
- A DIRECT-based approach exploiting local minimizations for the solution of large-scale global optimization problems
- A literature survey of benchmark functions for global optimisation problems
- A new class of test functions for global optimization
- A short course in General Relativity.
- A univariate global search working with a set of Lipschitz constants for the first derivative
- A wide class of test functions for global optimization
- Algorithm 829
- Constrained optimization along geodesics
- Deterministic global optimization using space-filling curves and multiple estimates of Lipschitz and Hölder constants
- Exploiting derivative-free local searches in DIRECT-type algorithms for global optimization
- Finding Zeroes of Maps: Homotopy Methods That are Constructive With Probability One
- Geodesic convexity in nonlinear optimization
- Geodesic convexity on Rn1+
- Global Search Based on Efficient Diagonal Partitions and a Set of Lipschitz Constants
- scientific article; zbMATH DE number 3960432 (Why is no real title available?)
- scientific article; zbMATH DE number 3974769 (Why is no real title available?)
- scientific article; zbMATH DE number 1857674 (Why is no real title available?)
- scientific article; zbMATH DE number 757684 (Why is no real title available?)
- Introduction to global optimization exploiting space-filling curves
- Lipschitz gradients for global optimization in a one-point-based partitioning scheme
- Lipschitzian optimization without the Lipschitz constant
- Local convexity on smooth manifolds
- Operational zones for comparing metaheuristic and deterministic one-dimensional global optimization algorithms
- Optimization Techniques on Riemannian Manifolds
- Space filling curves and mathematical programming
- The Large Scale Structure of Space-Time
Cited in
(3)
This page was built for publication: Geodesic and contour optimization using conformal mapping
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1675629)
