Optimal conditioning of self-scaling variable Metric algorithms
From MaRDI portal
Cites work
- scientific article; zbMATH DE number 3531203 (Why is no real title available?)
- A bound to the condition number of canonical rank-two corrections and applications to the variable metric method
- A new approach to variable metric algorithms
- On Steepest Descent
- Optimal Conditioning of Quasi-Newton Methods
- Self-Scaling Variable Metric (SSVM) Algorithms
- Self-Scaling Variable Metric (SSVM) Algorithms
- Self-Scaling Variable Metric Algorithms without Line Search for Unconstrained Minimization
Cited in
(only showing first 100 items - show all)- Some numerical experiments with variable-storage quasi-Newton algorithms
- An assessment of two approaches to variable metric methods
- New accelerated conjugate gradient algorithms as a modification of Dai-Yuan's computational scheme for unconstrained optimization
- A new gradient method via quasi-Cauchy relation which guarantees descent
- Solving an augmented nonnegative matrix factorization model by modified scaled nonmonotone memoryless BFGS methods devised based on the ellipsoid vector norm
- Low rank updates in preconditioning the saddle point systems arising from data assimilation problems
- Numerical expirience with a class of self-scaling quasi-Newton algorithms
- On the Condition Number Upper Bound of the L-BFGS Inverse Hessian Approximation Matrix with a Two-Sided Geometric Envelope Safeguarding Mechanism
- Numerical experiments with variations of the Gauss-Newton algorithm for nonlinear least squares
- A scaled nonlinear conjugate gradient algorithm for unconstrained optimization
- Variationally derived algorithms in the ABS class for linear systems
- A projection-based derivative free DFP approach for solving system of nonlinear convex constrained monotone equations with image restoration applications
- Wide interval for efficient self-scaling quasi-Newton algorithms
- A diagonally scaled Newton-type proximal method for minimization of the models with nonsmooth composite cost functions
- Numerical simulation of tridimensional electromagnetic shaping of liquid metals
- A new self-scaling memoryless quasi-Newton update for unconstrained optimization
- On a conjecture of Dixon and other topics in variable metric methods
- Eigenvalue analyses on the memoryless Davidon-Fletcher-Powell method based on a spectral secant equation
- A NONMONOTONE ADMM-BASED DIAGONAL QUASI-NEWTON UPDATE WITH APPLICATION TO THE COMPRESSIVE SENSING PROBLEM
- Superlinear convergence of nonlinear conjugate gradient method and scaled memoryless BFGS method based on assumptions about the initial point
- Perspectives on self-scaling variable metric algorithms
- Cubic regularization in symmetric rank-1 quasi-Newton methods
- Two extensions of the Dai-Liao method with sufficient descent property based on a penalization scheme
- Some investigations in a new algorithm for nonlinear optimization based on conic models of the objective function
- Computational experience with known variable metric updates
- Family of optimally conditioned quasi-Newton updates for unconstrained optimization
- Global convergence property of scaled two-step BFGS method
- Two--parameter scaled memoryless BFGS methods with a nonmonotone choice for the initial step length
- A hybrid scaling parameter for the scaled memoryless BFGS method based on the _ matrix norm
- Scaled memoryless symmetric rank one method for large-scale optimization
- On two symmetric Dai-Kou type schemes for constrained monotone equations with image recovery application
- A descent hybrid conjugate gradient method based on the memoryless BFGS update
- Erratum to: scaled memoryless BFGS preconditioned conjugate gradient algorithm for unconstrained optimization
- A trust-region strategy for minimization on arbitrary domains
- A modified nonmonotone trust region line search method
- A modified scaling parameter for the memoryless BFGS updating formula
- A double parameter self-scaling memoryless BFGS method for unconstrained optimization
- Two modified scaled nonlinear conjugate gradient methods
- Analysis of the maximum magnification by the scaled memoryless DFP updating formula with application to compressive sensing
- Scaling damped limited-memory updates for unconstrained optimization
- A descent family of the spectral Hestenes–Stiefel method by considering the quasi-Newton method
- An adaptive nonmonotone trust region algorithm
- An Accelerated Three-Term Extension of a Descent Nonlinear Conjugate Gradient Method
- A combined class of self-scaling and modified quasi-Newton methods
- Maintaining the positive definiteness of the matrices in reduced secant methods for equality constrained optimization
- Optimal conditioning in the convex class of rank two updates
- Regularized step directions in nonlinear conjugate gradient methods
- An approximate Newton-type proximal method using symmetric rank-one updating formula for minimizing the nonsmooth composite functions
- Computational experience with conjugate gradient algorithms
- New combined method for unconstrained minimization
- On optimality of the parameters of self-scaling memoryless quasi-Newton updating formulae
- An augmented memoryless BFGS method based on a modified secant equation with application to compressed sensing
- Accelerated adaptive Perry conjugate gradient algorithms based on the self-scaling memoryless BFGS update
- A variable metric-method for function minimization derived from invariancy to nonlinear scaling
- Convergence analysis of the self-dual optimally conditioned ssvm method of oren-spedicato
- scientific article; zbMATH DE number 4180681 (Why is no real title available?)
- An adaptive family of projection methods for constrained monotone nonlinear equations with applications
- A new descent spectral Polak-Ribière-Polyak method based on the memoryless BFGS update
- Mechanical system modelling using recurrent neural networks via quasi- Newton learning methods
- Two accelerated nonmonotone adaptive trust region line search methods
- Superlinear convergence of symmetric Huang's class of methods
- QN-like variable storage conjugate gradients
- Quasi-Newton-Verfahren vom Rang-Eins-Typ zur Lösung unrestringierter Minimierungsprobleme. I: Verfahren und grundlegende Eigenschaften
- Quasi-Newton-Verfahren vom Rang-Eins-Typ zur Lösung unrestringierter Minimierungsprobleme. II: n-Schritt-quadratische Konvergenz für Restart-Varianten
- Broyden's quasi-Newton methods for a nonlinear system of equations and unconstrained optimization: a review and open problems
- A double-parameter scaling Broyden-Fletcher-Goldfarb-Shanno method based on minimizing the measure function of Byrd and Nocedal for unconstrained optimization
- Variationally derived scaling and variable metric updates from the preconvex part of the Broyden family
- On the behaviour of a combined extra-updating/self-scaling BFGS method
- A modified Dai-Kou-type method with applications to signal reconstruction and blurred image restoration
- Sizing the BFGS and DFP updates: Numerical study
- Computational experiments with scaled initial hessian approximation for the broyden family methods∗
- A class of self-dual updating formulae in the broyden family
- Computational experience with bank-one positive definite quasi-newton algorithms
- A modified scaled memoryless symmetric rank-one method
- Using function-values in multi-step quasi-Newton methods
- A quasi-Newton method using a nonquadratic model
- A class of descent four-term extension of the Dai-Liao conjugate gradient method based on the scaled memoryless BFGS update
- An Optimal Broyden Updating Formula And Its Application To Nonliner Least Squares
- An efficient Dai-Kou-type method with image de-blurring application
- Conjugate gradient methods using quasi-Newton updates with inexact line searches
- A new version of augmented self-scaling BFGS method
- Partitioned variable metric updates for large structured optimization problems
- Image recovery via modified Dai-Kou method for constrained system of nonlinear equations
- Accelerated scaled memoryless BFGS preconditioned conjugate gradient algorithm for unconstrained optimization
- Variable metric methods for unconstrained optimization and nonlinear least squares
- Convergence acceleration of direct trajectory optimization using novel Hessian calculation methods
- New basic Hessian approximations for large-scale nonlinear least-squares optimization
- A fast and robust unconstrained optimization method requiring minimum storage
- A modified scaled memoryless BFGS preconditioned conjugate gradient method for unconstrained optimization
- New conjugate gradient algorithms based on self-scaling memoryless Broyden-Fletcher-Goldfarb-Shanno method
- Symmetric Perry conjugate gradient method
- Two efficient spectral hybrid CG methods based on memoryless BFGS direction and Dai–Liao conjugacy condition
- A class of diagonal preconditioners for limited memory BFGS method
- An adaptive nonmonotone trust region method based on a modified scalar approximation of the Hessian in the successive quadratic subproblems
- L-Broyden methods: a generalization of the L-BFGS method to the limited-memory Broyden family
- Gaussian processes for history-matching: application to an unconventional gas reservoir
- On measure functions for the self-scaling updating formulae for quasi-newton methods∗
- Scaled memoryless BFGS preconditioned conjugate gradient algorithm for unconstrained optimization
- On the conditioning of the Hessian approximation in quasi-Newton methods
- A new accelerated diagonal quasi-Newton updating method with scaled forward finite differences directional derivative for unconstrained optimization
This page was built for publication: Optimal conditioning of self-scaling variable Metric algorithms
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4110808)