Space-decomposition minimization method for large-scale minimization problems

DOI10.1016/S0898-1221(99)00088-7zbMath0931.90052MaRDI QIDQ1963007

Chin-Sung Liu, Ching-Huan Tseng

Publication date: 20 January 2000

Published in: Computers \& Mathematics with Applications (Search for Journal in Brave)

zbMATH Keywords

decomposition method; unconstrained minimization; large-scale problem; direct-search method; space-decomposition minimization algorithms

Mathematics Subject Classification ID

65K05: Numerical mathematical programming methods

90C30: Nonlinear programming

Related Items

Space-decomposition multiplier method for constrained minimization problems

Uses Software

• minpack

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Efficient hybrid conjugate gradient techniques
• A convergent dynamic method for large minimization problems
• Decomposition into functions in the minimization problem
• Nongradient minimization methods for parallel processing computers. II
• Generalized conjugate directions for unconstrained function minimization
• New inexact parallel variable distribution algorithms
• Pseudo-conjugate directions for the solution of the nonlinear unconstrained optimization problem on a parallel computer
• A Perturbed Parallel Decomposition Method for a Class of Nonsmooth Convex Minimization Problems
• QN-like variable storage conjugate gradients
• Parallel variable metric algorithms for unconstrained optimization
• Testing Unconstrained Optimization Software
• Parallel Variable Distribution
• Parallel Gradient Distribution in Unconstrained Optimization