On the softplus penalty for large-scale convex optimization.
Meng LiPaul GrigasAlper AtamtürkPublished in: Oper. Res. Lett. (2023)
Keyphrases
- convex optimization
- norm regularization
- interior point methods
- total variation
- primal dual
- convex optimization problems
- low rank
- convex relaxation
- alternating direction
- augmented lagrangian
- feature extraction
- norm minimization
- optimization problems
- basis pursuit
- convex constraints
- semidefinite program
- image restoration
- high resolution
- convex formulation
- feature selection
- alternating direction method of multipliers