Two Completely Parameter-Free Alternating Gradient Projection Algorithms for Nonconvex-(strongly) Concave Minimax Problems.
Junnan YangHuiling ZhangZi XuPublished in: CoRR (2024)
Keyphrases
- parameter free
- optimization problems
- worst case
- combinatorial optimization
- benchmark problems
- quadratic optimization problems
- convex functions
- objective function
- computational complexity
- gradient projection
- evolutionary algorithm
- np complete
- nonlinear programming
- categorical data
- semi automatic
- data sets
- np hard
- object recognition
- computer vision