.rst .pdf

Optimization Solvers

An optimization solver is an algorithm to solve an optimization problem, that is, to find the maximum or minimum of an objective function in the presence of constraints on its variables. In oneDAL the optimization solver represents the interface of algorithms that search for the argument \(\theta_{*}\) that minimizes the function \(K(\theta)\):

\[\theta_{*} = \text{argmin}_{\theta \in \Theta} K(\theta)\]

• Objective Function
  • Computation
  • Sum of Functions
  • Mean Squared Error Algorithm
  • Objective Function with Precomputed Characteristics Algorithm
  • Logistic Loss
  • Cross-entropy Loss
• Iterative Solver
  • Computation
  • Limited-Memory Broyden-Fletcher-Goldfarb-Shanno Algorithm
  • Stochastic Gradient Descent Algorithm
  • Adaptive Subgradient Method
  • Coordinate Descent Algorithm
  • Stochastic Average Gradient Accelerated Method

previous

Min-max

next

Objective Function