A parallel descent algorithm for convex programming
From MaRDI portal
Publication:1908925
DOI10.1007/BF00429749zbMath0844.90065MaRDI QIDQ1908925
Masao Fukushima, Jean Jacques Strodiot, Van Hien Nguyen, Eiki Yamakawa, Mounir Haddou, Takanobu Sugimoto
Publication date: 5 May 1996
Published in: Computational Optimization and Applications (Search for Journal in Brave)
Related Items
Convergence analysis and applications of the Glowinski-Le Tallec splitting method for finding a zero of the sum of two maximal monotone operators, How to deal with the unbounded in optimization: Theory and algorithms
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Auxiliary problem principle and decomposition of optimization 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
- Successive linearization methods for large-scale nonlinear programming problems
- On the Douglas-Rachford splitting method and the proximal point algorithm for maximal monotone operators
- Dual coordinate ascent methods for non-strictly convex minimization
- Dual Ascent Methods for Problems with Strictly Convex Costs and Linear Constraints: A Unified Approach
- A Perturbed Parallel Decomposition Method for a Class of Nonsmooth Convex Minimization Problems
- A Parallel Algorithm for a Class of Convex Programs
- A Decomposition Method and Its Application to Convex Programming
- A generalized proximal point algorithm for certain non-convex minimization problems
- Applications of a Splitting Algorithm to Decomposition in Convex Programming and Variational Inequalities
- Massively Parallel Row-Action Algorithms for Some Nonlinear Transportation Problems
- Parallel Numerical Optimization: Current Status and an Annotated Bibliography
- Massively Parallel Algorithms for Singly Constrained Convex Programs
- NETGEN: A Program for Generating Large Scale Capacitated Assignment, Transportation, and Minimum Cost Flow Network Problems
- On the Goldstein-Levitin-Polyak gradient projection method
- Monotone Operators and the Proximal Point Algorithm
- The Alternating Step Method for Monotropic Programming on the Connection Machine CM-2
- Convex Functions with Unbounded Level Sets and Applications to Duality Theory
- Convex Analysis
