A parallel descent algorithm for convex programming
type: Item
instance of: scholarly article
title: A parallel descent algorithm for convex programming
zbMATH Open document ID: 0844.90065
DOI: 10.1007/BF00429749
author: Masao Fukushima
author: Mounir Haddou
author: V. H. Nguyen
author: Takanobu Sugimoto
author: Eiki Yamakawa
author: Jean-Jacques Strodiot
published in: Computational Optimization and Applications
publication date: 1996-05-05T00:00:00Z
Mathematics Subject Classification ID: 90C25
Mathematics Subject Classification ID: 65Y05
zbMATH DE Number: 852889
zbMATH Keywords: descent method
zbMATH Keywords: parallel decomposition algorithm
zbMATH Keywords: trust region method
describes a project that uses: NETGEN
MaRDI profile type: Publication
cites work: Convex Functions with Unbounded Level Sets and Applications to Duality Theory
cites work: On the Goldstein-Levitin-Polyak gradient projection method
cites work: Q4001523
cites work: Auxiliary problem principle and decomposition of optimization problems
cites work: The Alternating Step Method for Monotropic Programming on the Connection Machine CM-2
cites work: On the Douglas-Rachford splitting method and the proximal point algorithm for maximal monotone operators
cites work: Q4311908
cites work: Q4226179
cites work: A generalized proximal point algorithm for certain non-convex minimization problems
cites work: Successive linearization methods for large-scale nonlinear programming problems
cites work: A Decomposition Method and Its Application to Convex Programming
cites work: A Parallel Algorithm for a Class of Convex Programs
cites work: A method for minimizing the sum of a convex function and a continuously differentiable function
cites work: NETGEN: A Program for Generating Large Scale Capacitated Assignment, Transportation, and Minimum Cost Flow Network Problems
cites work: A minimization method for the sum of a convex function and a continuously differentiable function
cites work: A Perturbed Parallel Decomposition Method for a Class of Nonsmooth Convex Minimization Problems
cites work: Massively Parallel Algorithms for Singly Constrained Convex Programs
cites work: Convex Analysis
cites work: Monotone Operators and the Proximal Point Algorithm
cites work: Dual Ascent Methods for Problems with Strictly Convex Costs and Linear Constraints: A Unified Approach
cites work: Applications of a Splitting Algorithm to Decomposition in Convex Programming and Variational Inequalities
cites work: Dual coordinate ascent methods for non-strictly convex minimization
cites work: Parallel Numerical Optimization: Current Status and an Annotated Bibliography
cites work: Massively Parallel Row-Action Algorithms for Some Nonlinear Transportation Problems
full work available at URL: https://doi.org/10.1007/bf00429749
OpenAlex ID: W2029020144
description: scientific article; zbMATH DE number 852889