Structured symmetric rank-one method for unconstrained optimization

DOI10.1080/00207160.2011.553220zbMath1229.90270OpenAlexW2083194257MaRDI QIDQ3101645

Wah June Leong, Farzin Modarres, Malik Abu Hassan

Publication date: 29 November 2011

Published in: International Journal of Computer Mathematics (Search for Journal in Brave)

Full work available at URL: http://psasir.upm.edu.my/id/eprint/25072/1/Structured%20symmetric%20rank.pdf

zbMATH Keywords

unconstrained optimizationHessian approximationsymmetric rank-one updatepartial information on the Hessianstructured quasi-Newton method

Mathematics Subject Classification ID

Numerical optimization and variational techniques (65K10) Methods of quasi-Newton type (90C53)

Related Items (6)

Quasi-Newton methods based on ordinary differential equation approach for unconstrained nonlinear optimization ⋮ On the performance of a new symmetric rank-one method with restart for solving unconstrained optimization problems ⋮ Limited memory methods with improved symmetric rank-one updates and its applications on nonlinear image restoration ⋮ A brief survey of methods for solving nonlinear least-squares problems ⋮ A sufficient descent three-term conjugate gradient method via symmetric rank-one update for large-scale optimization ⋮ Maximum Entropy Derivation of Quasi-Newton Methods

Cites Work

• Unnamed Item
• Unnamed Item
• A restarting approach for the symmetric rank one update for unconstrained optimization
• A modified quasi-Newton method for structured optimization with partial information on the Hessian
• Convergence theory for the structured BFGS secant method with an application to nonlinear least squares
• Factorized quasi-Newton methods for nonlinear least squares problems
• Convergence Theorems for Least-Change Secant Update Methods
• Sizing and Least-Change Secant Methods
• Optimal Conditioning and Convergence in Rank One Quasi-Newton Updates
• Testing Unconstrained Optimization Software
• An Adaptive Nonlinear Least-Squares Algorithm
• Local and Superlinear Convergence for Partially Known Quasi-Newton Methods
• Optimally conditioned optimization algorithms without line searches
• The estimation of the hessian matrix in nonlinear least squares problems with non-zero residuals
• Matrix conditioning and nonlinear optimization
• CUTE
• Line search algorithms with guaranteed sufficient decrease
• A Theoretical and Experimental Study of the Symmetric Rank-One Update
• Measures for Symmetric Rank-One Updates
• Convergence of a Factorized Broyden-Like Family for Nonlinear Least Squares Problems
• Benchmarking optimization software with performance profiles.

This page was built for publication: Structured symmetric rank-one method for unconstrained optimization