Pages that link to "Item:Q4963666"
From MaRDI portal
The following pages link to Convergence rate bounds for a proximal ADMM with over-relaxation stepsize parameter for solving nonconvex linearly constrained problems (Q4963666):
Displayed 11 items.
- Nonconvex TGV regularization model for multiplicative noise removal with spatially varying parameters (Q667778) (← links)
- Complexity of an inexact proximal-point penalty method for constrained smooth non-convex optimization (Q2125072) (← links)
- Douglas-Rachford splitting and ADMM for nonconvex optimization: accelerated and Newton-type linesearch algorithms (Q2141355) (← links)
- An inertial Bregman generalized alternating direction method of multipliers for nonconvex optimization (Q2142534) (← links)
- A hybrid Bregman alternating direction method of multipliers for the linearly constrained difference-of-convex problems (Q2307744) (← links)
- Misspecified nonconvex statistical optimization for sparse phase retrieval (Q2425184) (← links)
- An inertial proximal alternating direction method of multipliers for nonconvex optimization (Q5031320) (← links)
- Douglas--Rachford Splitting and ADMM for Nonconvex Optimization: Tight Convergence Results (Q5210517) (← links)
- Iteration Complexity of an Inner Accelerated Inexact Proximal Augmented Lagrangian Method Based on the Classical Lagrangian Function (Q5883320) (← links)
- An adaptive superfast inexact proximal augmented Lagrangian method for smooth nonconvex composite optimization problems (Q6053022) (← links)
- An accelerated inexact dampened augmented Lagrangian method for linearly-constrained nonconvex composite optimization problems (Q6097764) (← links)
