Space-decomposition minimization method for large-scale minimization problems
From MaRDI portal
DOI10.1016/S0898-1221(99)00088-7zbMATH Open0931.90052MaRDI QIDQ1963007FDOQ1963007
Ching-Huan Tseng, Chin-Sung Liu
Publication date: 20 January 2000
Published in: Computers & Mathematics with Applications (Search for Journal in Brave)
Recommendations
decomposition methodlarge-scale problemunconstrained minimizationdirect-search methodspace-decomposition minimization algorithms
Cites Work
- Testing Unconstrained Optimization Software
- Title not available (Why is that?)
- Efficient hybrid conjugate gradient techniques
- Title not available (Why is that?)
- Decomposition into functions in the minimization problem
- QN-like variable storage conjugate gradients
- Parallel Gradient Distribution in Unconstrained Optimization
- Parallel Variable Distribution
- A convergent dynamic method for large minimization problems
- New inexact parallel variable distribution algorithms
- Parallel variable metric algorithms for unconstrained optimization
- Nongradient minimization methods for parallel processing computers. II
- Generalized conjugate directions for unconstrained function minimization
- A Perturbed Parallel Decomposition Method for a Class of Nonsmooth Convex Minimization Problems
- Pseudo-conjugate directions for the solution of the nonlinear unconstrained optimization problem on a parallel computer
- Title not available (Why is that?)
Cited In (4)
Uses Software
This page was built for publication: Space-decomposition minimization method for large-scale minimization problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1963007)