Concept条件梯度法
Frank-Wolfe Algorithm
An iterative algorithm for solving convex optimization problems. It selects a descent direction within the feasible region through a linear minimization oracle and is commonly used to solve optimal transport problems.
Timeline (last 90 days)
Nov 8
Common means of mitigating non-convexity in GW distance optimization include multiple random restarts, using better initializations (such as couplings based on spectral methods or the Wasserstein distance), and designing convex relaxation approximations.
Unverified50%