Space-decomposition minimization method for large-scale minimization problems
type: Item
instance of: scholarly article
title: Space-decomposition minimization method for large-scale minimization problems
zbMATH Open document ID: 0931.90052
DOI: 10.1016/S0898-1221(99)00088-7
author: Chin-Sung Liu
author: Ching-Huan Tseng
publication date: 2000-01-20T00:00:00Z
Mathematics Subject Classification ID: 90C30
Mathematics Subject Classification ID: 65K05
zbMATH DE Number: 1391544
zbMATH Keywords: space-decomposition minimization algorithms
zbMATH Keywords: unconstrained minimization
zbMATH Keywords: decomposition method
zbMATH Keywords: direct-search method
zbMATH Keywords: large-scale problem
describes a project that uses: minpack
MaRDI profile type: Publication
cites work: Parallel Variable Distribution
cites work: New inexact parallel variable distribution algorithms
cites work: Parallel Gradient Distribution in Unconstrained Optimization
cites work: Decomposition into functions in the minimization problem
cites work: A Perturbed Parallel Decomposition Method for a Class of Nonsmooth Convex Minimization Problems
cites work: Generalized conjugate directions for unconstrained function minimization
cites work: Q3930558
cites work: Nongradient minimization methods for parallel processing computers. II
cites work: Pseudo-conjugate directions for the solution of the nonlinear unconstrained optimization problem on a parallel computer
cites work: QN-like variable storage conjugate gradients
cites work: Efficient hybrid conjugate gradient techniques
cites work: Q3994385
cites work: Parallel variable metric algorithms for unconstrained optimization
cites work: Q4326408
cites work: Testing Unconstrained Optimization Software
cites work: A convergent dynamic method for large minimization problems
published in: Computers & Mathematics with Applications
description: scientific article; zbMATH DE number 1391544