Space-decomposition minimization method for large-scale minimization problems
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 3746346 (Why is no real title available?)
- scientific article; zbMATH DE number 41074 (Why is no real title available?)
- scientific article; zbMATH DE number 735099 (Why is no real title available?)
- A Perturbed Parallel Decomposition Method for a Class of Nonsmooth Convex Minimization Problems
- A convergent dynamic method for large minimization problems
- Decomposition into functions in the minimization problem
- Efficient hybrid conjugate gradient techniques
- Generalized conjugate directions for unconstrained function minimization
- New inexact parallel variable distribution algorithms
- Nongradient minimization methods for parallel processing computers. II
- Parallel Gradient Distribution in Unconstrained Optimization
- Parallel Variable Distribution
- Parallel variable metric algorithms for unconstrained optimization
- Pseudo-conjugate directions for the solution of the nonlinear unconstrained optimization problem on a parallel computer
- QN-like variable storage conjugate gradients
- Testing Unconstrained Optimization Software
Cited in
(4)
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)