A parallel descent algorithm for convex programming
From MaRDI portal
Publication:1908925
DOI10.1007/BF00429749zbMATH Open0844.90065OpenAlexW2029020144MaRDI QIDQ1908925FDOQ1908925
Authors: Masao Fukushima, Mounir Haddou, V. H. Nguyen, Takanobu Sugimoto, Eiki Yamakawa, Jean-Jacques Strodiot 
Publication date: 5 May 1996
Published in: Computational Optimization and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf00429749
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
- 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
- Title not available (Why is that?)
- Convex Analysis
- Applications of a Splitting Algorithm to Decomposition in Convex Programming and Variational Inequalities
- 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
- A generalized proximal point algorithm for certain non-convex minimization problems
- Title not available (Why is that?)
- Monotone Operators and the Proximal Point Algorithm
- Title not available (Why is that?)
- Auxiliary problem principle and decomposition of optimization problems
- A Parallel Algorithm for a Class of Convex Programs
- On the Goldstein-Levitin-Polyak gradient projection method
- Dual Ascent Methods for Problems with Strictly Convex Costs and Linear Constraints: A Unified Approach
- Massively Parallel Algorithms for Singly Constrained Convex Programs
- Convex Functions with Unbounded Level Sets and Applications to Duality Theory
- Dual coordinate ascent methods for non-strictly convex minimization
- The Alternating Step Method for Monotropic Programming on the Connection Machine CM-2
- A Decomposition Method and Its Application to Convex Programming
- Successive linearization methods for large-scale nonlinear programming problems
- Massively Parallel Row-Action Algorithms for Some Nonlinear Transportation Problems
- Parallel Numerical Optimization: Current Status and an Annotated Bibliography
- A Perturbed Parallel Decomposition Method for a Class of Nonsmooth Convex Minimization Problems
Cited In (17)
- Approximate methods for convex minimization problems with series-parallel structure
- A simple parallel algorithm with an \(O(1/t)\) convergence rate for general convex programs
- A parallel algorithm for constrained concave quadratic global minimization
- An efficient parallel scheme for minimizing a sum of Euclidean norms
- Convergence analysis and applications of the Glowinski-Le Tallec splitting method for finding a zero of the sum of two maximal monotone operators
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Iterative methods for parallel convex optimization with fixed point constraints
- How to deal with the unbounded in optimization: Theory and algorithms
- Partial Proximal Minimization Algorithms for Convex Pprogramming
- A parallel minimization algorithm based on a 1 homogeneous model
- Title not available (Why is that?)
- Linearly-convergent FISTA variant for composite optimization with duality
- A Parallel Algorithm for a Class of Convex Programs
- A General Primal-Dual Envelope Method for Convex Programming Problems
- Parallel alternating direction multiplier decomposition of convex programs
Uses Software
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)
