scientific article; zbMATH DE number 238304
From MaRDI portal
Publication:5287741
zbMATH Open0774.90064MaRDI QIDQ5287741FDOQ5287741
Publication date: 25 October 1994
Title of this publication is not available (Why is that?)
Convex programming (90C25) Computational methods for problems pertaining to operations research and mathematical programming (90-08)
Cited In (10)
- On the convergence of the DFP algorithm for unconstrained optimization when there are only two variables
- A modified BFGS method and its global convergence in nonconvex minimization
- Convergence of DFP algorithm
- Title not available (Why is that?)
- Convergence property of a class of variable metric methods.
- The convergence of a new modified BFGS method without line searches for unconstrained optimization or complexity systems
- A modified BFGS method and its superlinear convergence in nonconvex minimization with general line search rule
- Title not available (Why is that?)
- Title not available (Why is that?)
- On the Local and Superlinear Convergence of a Parameterized DFP Method
Recommendations
- On the convergence property of the DFP algorithm π π
- Convergence of DFP algorithm π π
- On the Local and Superlinear Convergence of a Parameterized DFP Method π π
- Convergence properties of DFP method with modified quasi-Newton equations π π
- Title not available (Why is that?) π π
- Title not available (Why is that?) π π
- Title not available (Why is that?) π π
- Title not available (Why is that?) π π
- Title not available (Why is that?) π π
- Title not available (Why is that?) π π
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 Q5287741)