Pages that link to "Item:Q1908925"
From MaRDI portal
The following pages link to A parallel descent algorithm for convex programming (Q1908925):
Displaying 13 items.
- A parallel algorithm for constrained concave quadratic global minimization (Q1116888) (← links)
- An efficient parallel scheme for minimizing a sum of Euclidean norms (Q1123548) (← links)
- Convergence analysis and applications of the Glowinski-Le Tallec splitting method for finding a zero of the sum of two maximal monotone operators (Q1265027) (← links)
- Parallel alternating direction multiplier decomposition of convex programs (Q1321443) (← links)
- How to deal with the unbounded in optimization: Theory and algorithms (Q1365044) (← links)
- Approximate methods for convex minimization problems with series-parallel structure (Q2482762) (← links)
- A parallel minimization algorithm based on a 1 homogeneous model (Q3363073) (← links)
- A Parallel Algorithm for a Class of Convex Programs (Q3787794) (← links)
- (Q4347639) (← links)
- (Q4514797) (← links)
- Algorithmes de type F.A.C. en optimisation convexe (Q4698894) (← links)
- Iterative methods for parallel convex optimization with fixed point constraints (Q5244136) (← links)
- Linearly-convergent FISTA variant for composite optimization with duality (Q6101606) (← links)
