A parallel descent algorithm for convex programming
From MaRDI portal
Recommendations
- A Parallel Algorithm for a Class of Convex Programs
- A decomposition method for convex minimization problems and its application.
- Parallel alternating direction multiplier decomposition of convex programs
- A Perturbed Parallel Decomposition Method for a Class of Nonsmooth Convex Minimization Problems
- scientific article; zbMATH DE number 1046042
Cites work
- scientific article; zbMATH DE number 51132 (Why is no real title available?)
- scientific article; zbMATH DE number 1243473 (Why is no real title available?)
- scientific article; zbMATH DE number 679861 (Why is no real title available?)
- A Decomposition Method and Its Application to Convex Programming
- A Parallel Algorithm for a Class of Convex Programs
- A Perturbed Parallel Decomposition Method for a Class of Nonsmooth Convex Minimization Problems
- A generalized proximal point algorithm for certain non-convex minimization problems
- A method for minimizing the sum of a convex function and a continuously differentiable function
- A minimization method for the sum of a convex function and a continuously differentiable function
- Applications of a Splitting Algorithm to Decomposition in Convex Programming and Variational Inequalities
- Auxiliary problem principle and decomposition of optimization problems
- Convex Analysis
- Convex Functions with Unbounded Level Sets and Applications to Duality Theory
- Dual Ascent Methods for Problems with Strictly Convex Costs and Linear Constraints: A Unified Approach
- Dual coordinate ascent methods for non-strictly convex minimization
- Massively Parallel Algorithms for Singly Constrained Convex Programs
- Massively Parallel Row-Action Algorithms for Some Nonlinear Transportation Problems
- Monotone Operators and the Proximal Point Algorithm
- NETGEN: A Program for Generating Large Scale Capacitated Assignment, Transportation, and Minimum Cost Flow Network Problems
- On the Douglas-Rachford splitting method and the proximal point algorithm for maximal monotone operators
- On the Goldstein-Levitin-Polyak gradient projection method
- Parallel Numerical Optimization: Current Status and an Annotated Bibliography
- Successive linearization methods for large-scale nonlinear programming problems
- The Alternating Step Method for Monotropic Programming on the Connection Machine CM-2
Cited in
(17)- scientific article; zbMATH DE number 431496 (Why is no real title available?)
- A simple parallel algorithm with an \(O(1/t)\) convergence rate for general convex programs
- A Parallel Algorithm for a Class of Convex Programs
- Approximate methods for convex minimization problems with series-parallel structure
- A parallel minimization algorithm based on a 1 homogeneous model
- scientific article; zbMATH DE number 3885226 (Why is no real title available?)
- scientific article; zbMATH DE number 1530366 (Why is no real title available?)
- scientific article; zbMATH DE number 1046042 (Why is no real title available?)
- Partial Proximal Minimization Algorithms for Convex Pprogramming
- How to deal with the unbounded in optimization: Theory and algorithms
- Iterative methods for parallel convex optimization with fixed point constraints
- Parallel alternating direction multiplier decomposition of convex programs
- An efficient parallel scheme for minimizing a sum of Euclidean norms
- A General Primal-Dual Envelope Method for Convex Programming Problems
- Convergence analysis and applications of the Glowinski-Le Tallec splitting method for finding a zero of the sum of two maximal monotone operators
- Linearly-convergent FISTA variant for composite optimization with duality
- A parallel algorithm for constrained concave quadratic global minimization
This page was built for publication: A parallel descent algorithm for convex programming
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1908925)
