Pages that link to "Item:Q3787794"
From MaRDI portal
The following pages link to A Parallel Algorithm for a Class of Convex Programs (Q3787794):
Displaying 34 items.
- Splitting-midpoint method for zeros of the sum of accretive operator and \(\mu\)-inversely strongly accretive operator in a \(q\)-uniformly smooth Banach space and its applications (Q264521) (← links)
- A new iterative algorithm for the sum of infinite \(m\)-accretive mappings and infinite \(\mu_{i}\)-inversely strongly accretive mappings and its applications to integro-differential systems (Q269953) (← links)
- Combining Lagrangian decomposition and excessive gap smoothing technique for solving large-scale separable convex optimization problems (Q354625) (← links)
- Parallel algorithms for large-scale linearly constrained minimization problem (Q477497) (← links)
- Parallel SSLE algorithm for large scale constrained optimization (Q628886) (← links)
- Global extrapolation with a parallel splitting method (Q688144) (← links)
- Two parallel distribution algorithms for convex constrained minimization problems (Q884654) (← links)
- On the convergence of asynchronous parallel algorithm for large-scale linearly constrained minimization problem (Q1021668) (← links)
- A parallel projection method for solving generalized linear least-squares problems (Q1112561) (← links)
- On the convergence of Han's method for convex programming with quadratic objective (Q1181736) (← links)
- A variable-penalty alternating directions method for convex optimization (Q1290650) (← links)
- Asymptotic properties of the Fenchel dual functional and applications to decomposition problems (Q1321191) (← links)
- A proximal-based deomposition method for compositions method for convex minimization problems (Q1330895) (← links)
- A row-action method for convex programming (Q1330898) (← links)
- How to deal with the unbounded in optimization: Theory and algorithms (Q1365044) (← links)
- Finding the projection of a point onto the intersection of convex sets via projections onto half-spaces. (Q1421503) (← links)
- Convergence of a splitting inertial proximal method for monotone operators (Q1811604) (← links)
- Primal-dual row-action method for convex programming (Q1904955) (← links)
- A parallel descent algorithm for convex programming (Q1908925) (← links)
- Family of perturbation methods for variational inequalities (Q1918010) (← links)
- A new iterative algorithm for the sum of two different types of finitely many accretive operators in Banach space and its connection with capillarity equation (Q2017685) (← links)
- Convergence of splitting algorithms for the sum of two accretive operators with applications (Q2264135) (← links)
- Further applications of a splitting algorithm to decomposition in variational inequalities and convex programming (Q2277367) (← links)
- Split equality monotone variational inclusions and fixed point problem of set-valued operator (Q2399844) (← links)
- Benders decomposition for a class of variational inequalities (Q2456407) (← links)
- Computational acceleration of projection algorithms for the linear best approximation problem (Q2497243) (← links)
- Fast inexact decomposition algorithms for large-scale separable convex optimization (Q2790883) (← links)
- A survey on operator splitting and decomposition of convex programs (Q2969955) (← links)
- Decomposition Methods for Sparse Matrix Nearness Problems (Q3456880) (← links)
- Random test problems and parallel methods for quadratic programs and quadratic stochastic programs<sup>∗</sup> (Q4514287) (← links)
- Weak convergence of an iterative algorithm for accretive operators (Q4632557) (← links)
- About saddle values of a class of convex-concave functions (Q4764855) (← links)
- A decomposition method for convex minimization problems and its application. (Q5931895) (← links)
- Linearly-convergent FISTA variant for composite optimization with duality (Q6101606) (← links)
