#최적화
4 concepts
Concepts
Optimization Basics
Optimization is finding variable values that maximize or minimize an objective function under given constraints.
Convex Optimization
Convex optimization minimizes a convex function over a convex set. Local minima are global minima, making it efficiently solvable.
Gradient Descent
An optimization algorithm that iteratively moves in the opposite direction of the gradient to find the minimum.
Linear Programming
A mathematical method to optimize a linear objective function subject to linear constraints.