Pages that link to "Item:Q344922"

The following pages link to Block coordinate proximal gradient methods with variable Bregman functions for nonsmooth separable optimization (Q344922):

Displaying 9 items.

• A block coordinate gradient descent method for regularized convex separable optimization and covariance selection (Q644904) (← links)
• Blocks of coordinates, stochastic programming, and markets (Q1722745) (← links)
• Block coordinate descent for smooth nonconvex constrained minimization (Q2162523) (← links)
• Testing and non-linear preconditioning of the proximal point method (Q2198162) (← links)
• Emergence of price-taking behavior (Q2206009) (← links)
• A unified convergence analysis of block successive minimization methods for nonsmooth optimization (Q2848188) (← links)
• Truncated nonsmooth Newton multigrid methods for block-separable minimization problems (Q5113342) (← links)
• The convergence properties of infeasible inexact proximal alternating linearized minimization (Q6074854) (← links)
• Bregman methods for large-scale optimization with applications in imaging (Q6606442) (← links)