Pages that link to "Item:Q1676921"
From MaRDI portal
The following pages link to A globally convergent algorithm for nonconvex optimization based on block coordinate update (Q1676921):
Displaying 7 items.
- Global convergence in learning fully-connected ReLU networks via un-rectifying based on the augmented Lagrangian approach (Q6536825) (← links)
- Dual descent augmented Lagrangian method and alternating direction method of multipliers (Q6542544) (← links)
- Massive Parallelization of Massive Sample-Size Survival Analysis (Q6552555) (← links)
- An inexactly accelerated algorithm for nonnegative tensor CP decomposition with the column unit constraints (Q6568930) (← links)
- Quasi-orthogonalization for alternating non-negative tensor factorization (Q6572627) (← links)
- An inertial ADMM for a class of nonconvex composite optimization with nonlinear coupling constraints (Q6593830) (← links)
- A unified Bregman alternating minimization algorithm for generalized DC programs with application to imaging (Q6639517) (← links)
