Structured symmetric rank-one method for unconstrained optimization
From MaRDI portal
Recommendations
- On the performance of a new symmetric rank-one method with restart for solving unconstrained optimization problems
- A symmetric rank-one method based on extra updating techniques for unconstrained optimization
- Symmetric rank-one method based on some modified secant conditions for unconstrained optimization
- Improved Hessian approximation with modified secant equations for symmetric rank-one method
- Analysis of a Symmetric Rank-One Trust Region Method
Cites work
- A modified quasi-Newton method for structured optimization with partial information on the Hessian
- A restarting approach for the symmetric rank one update for unconstrained optimization
- A Theoretical and Experimental Study of the Symmetric Rank-One Update
- An Adaptive Nonlinear Least-Squares Algorithm
- Benchmarking optimization software with performance profiles.
- Convergence of a Factorized Broyden-Like Family for Nonlinear Least Squares Problems
- Convergence Theorems for Least-Change Secant Update Methods
- Convergence theory for the structured BFGS secant method with an application to nonlinear least squares
- CUTE
- Factorized quasi-Newton methods for nonlinear least squares problems
- scientific article; zbMATH DE number 3928227 (Why is no real title available?)
- scientific article; zbMATH DE number 1243473 (Why is no real title available?)
- Line search algorithms with guaranteed sufficient decrease
- Local and Superlinear Convergence for Partially Known Quasi-Newton Methods
- Matrix conditioning and nonlinear optimization
- Measures for Symmetric Rank-One Updates
- Optimal Conditioning and Convergence in Rank One Quasi-Newton Updates
- Optimally conditioned optimization algorithms without line searches
- Sizing and Least-Change Secant Methods
- Testing Unconstrained Optimization Software
- The estimation of the hessian matrix in nonlinear least squares problems with non-zero residuals
Cited in
(15)- Cubic regularization in symmetric rank-1 quasi-Newton methods
- A modified scaled memoryless symmetric rank-one method
- A brief survey of methods for solving nonlinear least-squares problems
- Quasi-Newton methods based on ordinary differential equation approach for unconstrained nonlinear optimization
- A sufficient descent three-term conjugate gradient method via symmetric rank-one update for large-scale optimization
- Maximum entropy derivation of quasi-Newton methods
- On the performance of a new symmetric rank-one method with restart for solving unconstrained optimization problems
- scientific article; zbMATH DE number 5630374 (Why is no real title available?)
- scientific article; zbMATH DE number 4074376 (Why is no real title available?)
- scientific article; zbMATH DE number 1974614 (Why is no real title available?)
- A structured quasi-Newton algorithm for optimizing with incomplete Hessian information
- Improved Hessian approximation with modified secant equations for symmetric rank-one method
- A symmetric rank-one method based on extra updating techniques for unconstrained optimization
- Scaled memoryless symmetric rank one method for large-scale optimization
- Limited memory methods with improved symmetric rank-one updates and its applications on nonlinear image restoration
This page was built for publication: Structured symmetric rank-one method for unconstrained optimization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3101645)
