Sizing and Least-Change Secant Methods

DOI10.1137/0730067zbMath0802.65081OpenAlexW2017014514MaRDI QIDQ3142629

Henry Wolkowicz, John E. jun. Dennis

Publication date: 11 December 1994

Published in: SIAM Journal on Numerical Analysis (Search for Journal in Brave)

Full work available at URL: http://hdl.handle.net/1911/101671

zbMATH Keywords

numerical examplesunconstrained minimizationcomparisonsquasi-Newton methodsecant updateleast-change secant methods

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Nonlinear programming (90C30)

Related Items (55)

A new simple model trust-region method with generalized Barzilai-Borwein parameter for large-scale optimization ⋮ Quasi-Newton methods based on ordinary differential equation approach for unconstrained nonlinear optimization ⋮ A numerical study of optimized sparse preconditioners ⋮ Scaling damped limited-memory updates for unconstrained optimization ⋮ A stable primal-dual approach for linear programming under nondegeneracy assumptions ⋮ The global convergence of self-scaling BFGS algorithm with non-monotone line search for unconstrained nonconvex optimization problems ⋮ A new adaptive Barzilai and Borwein method for unconstrained optimization ⋮ A diagonal quasi-Newton updating method based on minimizing the measure function of Byrd and Nocedal for unconstrained optimization ⋮ On the performance of a new symmetric rank-one method with restart for solving unconstrained optimization problems ⋮ Nonmonotone diagonally scaled limited-memory BFGS methods with application to compressive sensing based on a penalty model ⋮ Nonmonotone spectral gradient method based on memoryless symmetric rank-one update for large-scale unconstrained optimization ⋮ Solving Hankel matrix approximation problem using semidefinite programming ⋮ Solving polynomial systems using a fast adaptive back propagation-type neural network algorithm ⋮ Diagonal approximation of the Hessian by finite differences for unconstrained optimization ⋮ A diagonal quasi-Newton updating method for unconstrained optimization ⋮ New conjugate gradient algorithms based on self-scaling memoryless Broyden-Fletcher-Goldfarb-Shanno method ⋮ A generalized computing paradigm based on artificial dynamic models for mathematical programming ⋮ An overview of stochastic quasi-Newton methods for large-scale machine learning ⋮ A low memory solver for integral equations of Chandrasekhar type in the radiative transfer problems ⋮ A NONMONOTONE ADMM-BASED DIAGONAL QUASI-NEWTON UPDATE WITH APPLICATION TO THE COMPRESSIVE SENSING PROBLEM ⋮ An Optimal Broyden Updating Formula And Its Application To Nonliner Least Squares ⋮ Improved Hessian approximation with modified secant equations for symmetric rank-one method ⋮ A restarting approach for the symmetric rank one update for unconstrained optimization ⋮ An improved multi-step gradient-type method for large scale optimization ⋮ A two-step matrix-free secant method for solving large-scale systems of nonlinear equations ⋮ Multi-step spectral gradient methods with modified weak secant relation for large scale unconstrained optimization ⋮ A symmetric rank-one method based on extra updating techniques for unconstrained optimization ⋮ Unnamed Item ⋮ Convergence analysis of the self-dual optimally conditioned ssvm method of oren-spedicato ⋮ A New Diagonal Quasi-Newton Updating Method With Scaled Forward Finite Differences Directional Derivative for Unconstrained Optimization ⋮ A Bregman extension of quasi-Newton updates. II: Analysis of robustness properties ⋮ Diagonal quasi-Newton methods via least change updating principle with weighted Frobenius norm ⋮ A matrix-free quasi-Newton method for solving large-scale nonlinear systems ⋮ Accelerated diagonal gradient-type method for large-scale unconstrained optimization ⋮ A new accelerated diagonal quasi-Newton updating method with scaled forward finite differences directional derivative for unconstrained optimization ⋮ A class of diagonal quasi-Newton methods for large-scale convex minimization ⋮ Global convergence property of scaled two-step BFGS method ⋮ Least change properties of ABS methods and their application in secant-type updates ⋮ Novel preconditioners based on quasi-Newton updates for nonlinear conjugate gradient methods ⋮ Analysis of a self-scaling quasi-Newton method ⋮ Accumulative approach in multistep diagonal gradient-type method for large-scale unconstrained optimization ⋮ Approximate Toeplitz matrix problem using semidefinite programming ⋮ An adaptive learning rate backpropagation‐type neural network for solving n × n systems on nonlinear algebraic equations ⋮ A class of diagonal preconditioners for limited memory BFGS method ⋮ Scaled memoryless symmetric rank one method for large-scale optimization ⋮ A structured quasi-Newton algorithm with nonmonotone search strategy for structured NLS problems and its application in robotic motion control ⋮ A robust algorithm for semidefinite programming ⋮ Solving semidefinite programs using preconditioned conjugate gradients ⋮ Diagonal quasi-Newton method via variational principle under generalized Frobenius norm ⋮ Structured symmetric rank-one method for unconstrained optimization ⋮ Primal-dual potential reduction methods for semidefinite programming using affine-scaling directions ⋮ Applications of semidefinite programming ⋮ Approximate and exact completion problems for Euclidean distance matrices using semidefinite programming ⋮ On measure functions for the self-scaling updating formulae for quasi-newton methods^∗ ⋮ Diagonal BFGS updates and applications to the limited memory BFGS method

This page was built for publication: Sizing and Least-Change Secant Methods