A Parallel Algorithm for a Class of Convex Programs
From MaRDI portal
Publication:3787794
DOI10.1137/0326019zbMath0644.90068OpenAlexW1999219269MaRDI QIDQ3787794
Publication date: 1988
Published in: SIAM Journal on Control and Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/0326019
parallel computationdecomposition into independent subproblemsgradient of the conjugate functionsmooth strongly convex function
Numerical mathematical programming methods (65K05) Convex programming (90C25) Nonlinear programming (90C30) Quadratic programming (90C20) Numerical methods based on nonlinear programming (49M37) Methods of successive quadratic programming type (90C55)
Related 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, 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, A proximal-based deomposition method for compositions method for convex minimization problems, A row-action method for convex programming, Decomposition Methods for Sparse Matrix Nearness Problems, Primal-dual row-action method for convex programming, How to deal with the unbounded in optimization: Theory and algorithms, A parallel descent algorithm for convex programming, A parallel projection method for solving generalized linear least-squares problems, Combining Lagrangian decomposition and excessive gap smoothing technique for solving large-scale separable convex optimization problems, Split equality monotone variational inclusions and fixed point problem of set-valued operator, Family of perturbation methods for variational inequalities, Two parallel distribution algorithms for convex constrained minimization problems, Linearly-convergent FISTA variant for composite optimization with duality, Viscosity approximation method for split best proximity point and monotone variational inclusion problem, Parallel SSLE algorithm for large scale constrained optimization, A survey on operator splitting and decomposition of convex programs, Finding the projection of a point onto the intersection of convex sets via projections onto half-spaces., Parallel algorithms for large-scale linearly constrained minimization problem, Weak convergence of an iterative algorithm for accretive operators, Benders decomposition for a class of variational inequalities, On the convergence of Han's method for convex programming with quadratic objective, Global extrapolation with a parallel splitting method, A decomposition method for convex minimization problems and its application., Convergence of splitting algorithms for the sum of two accretive operators with applications, 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, Computational acceleration of projection algorithms for the linear best approximation problem, Further applications of a splitting algorithm to decomposition in variational inequalities and convex programming, Fast inexact decomposition algorithms for large-scale separable convex optimization, Convergence of a splitting inertial proximal method for monotone operators, On the convergence of asynchronous parallel algorithm for large-scale linearly constrained minimization problem, A variable-penalty alternating directions method for convex optimization, About saddle values of a class of convex-concave functions, Asymptotic properties of the Fenchel dual functional and applications to decomposition problems, Random test problems and parallel methods for quadratic programs and quadratic stochastic programs∗
