scientific article; zbMATH DE number 4046982
From MaRDI portal
Publication:3783443
[For the entire collection see Zbl 0637.00009.] We consider the unconstrained minimization problem \(\min_{R^ n}f(x)\) where \(f: R^ n\to R\) is twice continuously differentiable. For such a problem the quasi-Newton methods and the conjugate direction methods are deemed to be very effective. Here we propose a class of methods which possess attractive features of those methods and are also suitable for parallel computation.
Recommendations
Cited in
(17)- On the convergence of asynchronous parallel algorithm for large-scale linearly constrained minimization problem
- Modifying the BFGS update by a new column scaling technique
- On a second order parallel variable transformation approach.
- Method of ``cleft-overstep by prependicular direction for solving the unconstrained nonlinear optimization problem
- scientific article; zbMATH DE number 3912127 (Why is no real title available?)
- scientific article; zbMATH DE number 3932802 (Why is no real title available?)
- scientific article; zbMATH DE number 3945269 (Why is no real title available?)
- scientific article; zbMATH DE number 4057298 (Why is no real title available?)
- scientific article; zbMATH DE number 4074822 (Why is no real title available?)
- scientific article; zbMATH DE number 3994937 (Why is no real title available?)
- scientific article; zbMATH DE number 794279 (Why is no real title available?)
- Quasidifferential optimization algorithms in a parallel computation environment
- scientific article; zbMATH DE number 1390526 (Why is no real title available?)
- scientific article; zbMATH DE number 2202311 (Why is no real title available?)
- Block truncated-Newton methods for parallel optimization
- Parallel SSLE algorithm for large scale constrained optimization
- Two parallel distribution algorithms for convex constrained minimization problems
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3783443)