scientific article; zbMATH DE number 4180681
From MaRDI portal
Publication:3203937
Recommendations
- scientific article; zbMATH DE number 179183
- Variable metric methods for unconstrained optimization and nonlinear least squares
- Inexact variable metric method for convex-constrained optimization problems
- A variable metric method for nonsmooth convex constrained optimization
- scientific article; zbMATH DE number 4156217
- scientific article; zbMATH DE number 3915534
- Parallel variable metric algorithms for unconstrained optimization
- scientific article; zbMATH DE number 3852805
Cites work
- A class of rank-one positive definite qnasi-newton updates for unconstrained minimization2
- A Family of Variable-Metric Methods Derived by Variational Means
- A new approach to variable metric algorithms
- Conditioning of Quasi-Newton Methods for Function Minimization
- Conditions for variable-metric algorithms to be conjugate-gradient algorithms
- Global Convergence of a Cass of Quasi-Newton Methods on Convex Problems
- scientific article; zbMATH DE number 3687182 (Why is no real title available?)
- Least-Change Updates to Cholesky Factors Subject to the Nonlinear Quasi-Newton Condition
- Local convergence analysis for partitioned quasi-Newton updates
- Matrix conditioning and nonlinear optimization
- Methods for Computing and Modifying the LDV Factors of a Matrix
- Minimization Algorithms Making Use of Non-quadratic Properties of the Objective Function
- On the convergence rate of imperfect minimization algorithms in Broyden'sβ-class
- Optimal conditioning of self-scaling variable Metric algorithms
- Quasi-Newton Algorithms with Updates from the Preconvex Part of Broyden's Family
- Quasi-Newton-Verfahren vom Rang-Eins-Typ zur Lösung unrestringierter Minimierungsprobleme. II: n-Schritt-quadratische Konvergenz für Restart-Varianten
- Self-Scaling Variable Metric (SSVM) Algorithms
- Testing a Class of Methods for Solving Minimization Problems with Simple Bounds on the Variables
- Testing Unconstrained Optimization Software
- The Convergence of a Class of Double-rank Minimization Algorithms 1. General Considerations
- Variable metric algorithms: Necessary and sufficient conditions for identical behaviour of nonquadratic functions
Cited in
(13)- Variationally derived scaling and variable metric updates from the preconvex part of the Broyden family
- Generalized Polak-Ribière algorithm
- Sizing the BFGS and DFP updates: Numerical study
- Computational experience with known variable metric updates
- Family of optimally conditioned quasi-Newton updates for unconstrained optimization
- Variable metric methods for unconstrained optimization and nonlinear least squares
- Global convergence and the Powell singular function
- scientific article; zbMATH DE number 3874970 (Why is no real title available?)
- scientific article; zbMATH DE number 179183 (Why is no real title available?)
- scientific article; zbMATH DE number 465358 (Why is no real title available?)
- scientific article; zbMATH DE number 1014733 (Why is no real title available?)
- Variable Metric Function Minimization
- Limited memory methods with improved symmetric rank-one updates and its applications on nonlinear image restoration
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 Q3203937)
