A Parallel Algorithm for a Class of Convex Programs
From MaRDI portal
Recommendations
- A parallel descent algorithm for convex programming
- scientific article; zbMATH DE number 1046042
- A parallel algorithm for constrained optimization problems
- Parallel alternating direction multiplier decomposition of convex programs
- A parallel algorithm for linear programs with an additional reverse convex constraint
- A parallel splitting method for separable convex programs
- Massively Parallel Algorithms for Singly Constrained Convex Programs
- A parallel algorithm for constrained concave quadratic global minimization
- Parallelization of some problems of discrete and non-convex optimization
Cited in
(54)- Approximate methods for convex minimization problems with series-parallel structure
- Combining Lagrangian decomposition and excessive gap smoothing technique for solving large-scale separable convex optimization problems
- A parallel splitting method for separable convex programs
- Decomposition methods for sparse matrix nearness problems
- Splitting-midpoint method for zeros of the sum of accretive operator and -inversely strongly accretive operator in a q-uniformly smooth Banach space and its applications
- Benders decomposition for a class of variational inequalities
- Computational acceleration of projection algorithms for the linear best approximation problem
- Finding the projection of a point onto the intersection of convex sets via projections onto half-spaces.
- A decomposition method for convex minimization problems and its application.
- 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
- Solving the fixed rank convex quadratic maximization in binary variables by a parallel zonotope construction algorithm
- A parallel projection method for solving generalized linear least-squares problems
- A parallel algorithm for constrained concave quadratic global minimization
- A simple parallel algorithm with an \(O(1/t)\) convergence rate for general convex programs
- Asymptotic properties of the Fenchel dual functional and applications to decomposition problems
- Weak convergence of an iterative algorithm for accretive operators
- Fast inexact decomposition algorithms for large-scale separable convex optimization
- A parallel splitting ALM-based algorithm for separable convex programming
- A proximal-based deomposition method for compositions method for convex minimization problems
- Projection algorithms for composite minimization
- scientific article; zbMATH DE number 431496 (Why is no real title available?)
- A geometric method for a class of convex programs
- scientific article; zbMATH DE number 1046042 (Why is no real title available?)
- Split equality monotone variational inclusions and fixed point problem of set-valued operator
- A parallel descent algorithm for convex programming
- Convergence of a splitting inertial proximal method for monotone operators
- scientific article; zbMATH DE number 761263 (Why is no real title available?)
- Iterative methods for parallel convex optimization with fixed point constraints
- Family of perturbation methods for variational inequalities
- On the convergence of Han's method for convex programming with quadratic objective
- Two parallel distribution algorithms for convex constrained minimization problems
- A variable-penalty alternating directions method for convex optimization
- Forward-backward algorithms for weakly convex problems
- How to deal with the unbounded in optimization: Theory and algorithms
- 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
- Convergence of splitting algorithms for the sum of two accretive operators with applications
- A survey on operator splitting and decomposition of convex programs
- Partial Proximal Minimization Algorithms for Convex Pprogramming
- Parallel algorithms for large-scale linearly constrained minimization problem
- scientific article; zbMATH DE number 1530366 (Why is no real title available?)
- Parallel SSLE algorithm for large scale constrained optimization
- Random test problems and parallel methods for quadratic programs and quadratic stochastic programs∗
- Global extrapolation with a parallel splitting method
- A row-action method for convex programming
- About saddle values of a class of convex-concave functions
- Further applications of a splitting algorithm to decomposition in variational inequalities and convex programming
- On the convergence of asynchronous parallel algorithm for large-scale linearly constrained minimization problem
- Linearly-convergent FISTA variant for composite optimization with duality
- Primal-dual row-action method for convex programming
- On parallel complexity of nonsmooth convex optimization
- PARALLEL ALGORITHMS FOR FINDING COMMON FIXED POINTS OF PARACONTRACTIONS
- Viscosity approximation method for split best proximity point and monotone variational inclusion problem
- Parallel alternating direction multiplier decomposition of convex programs
- Relaxed alternating minimization algorithm for separable convex programming with applications to imaging
This page was built for publication: A Parallel Algorithm for a Class of Convex Programs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3787794)
