Andere Kunden interessierten sich auch für
![Population-Based Optimization on Riemannian Manifolds]( "Population-Based Optimization on Riemannian Manifolds")
Population-Based Optimization on Riemannian Manifolds95,99 €![Population-Based Approaches to the Resource-Constrained and Discrete-Continuous Scheduling]( "Population-Based Approaches to the Resource-Constrained and Discrete-Continuous Scheduling")
Population-Based Approaches to the Resource-Constrained and Discrete-Continuous Scheduling74,99 €![Evolutionary Global Optimization, Manifolds and Applications]( "Evolutionary Global Optimization, Manifolds and Applications")
Evolutionary Global Optimization, Manifolds and Applications74,99 €![Decision Tree and Ensemble Learning Based on Ant Colony Optimization]( "Decision Tree and Ensemble Learning Based on Ant Colony Optimization")
Decision Tree and Ensemble Learning Based on Ant Colony Optimization74,99 €![High-Performance Simulation-Based Optimization]( "High-Performance Simulation-Based Optimization")
High-Performance Simulation-Based Optimization103,99 €![Decision Tree and Ensemble Learning Based on Ant Colony Optimization]( "Decision Tree and Ensemble Learning Based on Ant Colony Optimization")
Decision Tree and Ensemble Learning Based on Ant Colony Optimization74,99 €![High-Performance Simulation-Based Optimization]( "High-Performance Simulation-Based Optimization")
High-Performance Simulation-Based Optimization74,99 €
Manifold optimization is an emerging field of contemporary optimization that constructs efficient and robust algorithms by exploiting the specific geometrical structure of the search space. In our case the search space takes the form of a manifold.
Manifold optimization methods mainly focus on adapting existing optimization methods from the usual "easy-to-deal-with" Euclidean search spaces to manifolds whose local geometry can be defined e.g. by a Riemannian structure. In this way the form of the adapted algorithms can stay unchanged. However, to accommodate the adaptation process, assumptions on the search space manifold often have to be made. In addition, the computations and estimations are confined by the local geometry.
This book presents a framework for population-based optimization on Riemannian manifolds that overcomes both the constraints of locality and additional assumptions. Multi-modal, black-box manifold optimization problems on Riemannian manifolds can be tackled using zero-order stochastic optimization methods from a geometrical perspective, utilizing both the statistical geometry of the decision space and Riemannian geometry of the search space.
This monograph presents in a self-contained manner both theoretical and empirical aspects of stochastic population-based optimization on abstract Riemannian manifolds.
Manifold optimization methods mainly focus on adapting existing optimization methods from the usual "easy-to-deal-with" Euclidean search spaces to manifolds whose local geometry can be defined e.g. by a Riemannian structure. In this way the form of the adapted algorithms can stay unchanged. However, to accommodate the adaptation process, assumptions on the search space manifold often have to be made. In addition, the computations and estimations are confined by the local geometry.
This book presents a framework for population-based optimization on Riemannian manifolds that overcomes both the constraints of locality and additional assumptions. Multi-modal, black-box manifold optimization problems on Riemannian manifolds can be tackled using zero-order stochastic optimization methods from a geometrical perspective, utilizing both the statistical geometry of the decision space and Riemannian geometry of the search space.
This monograph presents in a self-contained manner both theoretical and empirical aspects of stochastic population-based optimization on abstract Riemannian manifolds.