Pages that link to "Item:Q3680618"

The following pages link to Applications of the method of partial inverses to convex programming: Decomposition (Q3680618):

Displaying 10 items.

• A general system for heuristic minimization of convex functions over non-convex sets (Q4638917) (← links)
• A class of decomposition methods for convex optimization and monotone variational inclusions via the hybrid inexact proximal point framework (Q4657707) (← links)
• Solving monotone inclusions via compositions of nonexpansive averaged operators (Q4669785) (← links)
• The cluster set of a nonexpansive mapping (Q4728872) (← links)
• Multi-step-prox-regularization method for solving convex variation problems (Q4836771) (← links)
• Another proof and a generalization of a theorem of H. H. Bauschke on monotone operators (Q5034928) (← links)
• On the convergence rate of the scaled proximal decomposition on the graph of a maximal monotone operator (SPDG) algorithm (Q5151507) (← links)
• Forward-Douglas–Rachford splitting and forward-partial inverse method for solving monotone inclusions (Q5248235) (← links)
• An inexact method of partial inverses and a parallel bundle method (Q5475281) (← links)
• Generalizations of the proximal method of multipliers in convex optimization (Q6179878) (← links)