Optimization Methods¶
This module provides a comprehensive collection of optimization algorithms for solving mathematical optimization problems. The methods are organized into seven categories based on the type of information they use (derivative-free, gradient-based, Hessian-based) and their algorithmic approach.
Zero-Order Methods¶
Derivative-free optimization methods that only require function evaluations.
|
|
|
First-Order Methods¶
Gradient-based optimization methods that utilize first-order derivative information.
|
|
|
Second-Order Methods¶
Methods that utilize second-order derivative (Hessian) information.
|
Adaptive Learning Rate Methods¶
Gradient-based methods with adaptive step-size mechanisms, commonly used in deep learning.
|
|
|
|
|
|
|
|
|
Stochastic Methods¶
Probabilistic optimization algorithms that use randomness to explore the search space.
|
CMA-ES (Covariance Matrix Adaptation Evolution Strategy) optimization algorithm. |
|
Cross-Entropy Method optimization algorithm. |
Simulated Annealing optimization algorithm. |
Population-Based Methods¶
Evolutionary and swarm intelligence algorithms that maintain a population of candidate solutions.
|
Particle Swarm Optimization algorithm. |
Particle Swarm Optimization algorithm. |
Topological Optimization Methods¶
Specialized methods for topology optimization problems.
|
PolyMesher |