Self-Scaling Variable Metric (SSVM) Algorithms
From MaRDI portal
Cited in
(only showing first 100 items - show all)- Some investigations in a new algorithm for nonlinear optimization based on conic models of the objective function
- Planar quasi-Newton algorithms for unconstrained saddlepoint problems
- Adding variables to quasi-newton Hessian approximations
- Perspectives on self-scaling variable metric algorithms
- An assessment of quasi-Newton sparse update techniques for nonlinear structural analysis
- New combined method for unconstrained minimization
- 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
- Superlinear convergence of symmetric Huang's class of methods
- On quasi-Newton and pseudo-Newton algorithms
- On the relation between quadratic termination and convergence properties of minimization algorithms. Part I. Theory
- On the relation between quadratic termination and convergence properties of minimization algorithms. Part II. Applications
- Numerical expirience with a class of self-scaling quasi-Newton algorithms
- 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
- A trust-region-approach for solving a parameter estimation problem from the biotechnology area
- An appreciation of Professor David G. Luenberger
- Variable metric methods for unconstrained optimization and nonlinear least squares
- A descent hybrid conjugate gradient method based on the memoryless BFGS update
- Two accelerated nonmonotone adaptive trust region line search methods
- A double-parameter scaling Broyden-Fletcher-Goldfarb-Shanno method based on minimizing the measure function of Byrd and Nocedal for unconstrained optimization
- A double parameter scaled BFGS method for unconstrained optimization
- An SR1/BFGS SQP algorithm for nonconvex nonlinear programs with block-diagonal Hessian matrix
- Gaussian processes for history-matching: application to an unconventional gas reservoir
- Cubic regularization in symmetric rank-1 quasi-Newton methods
- Global convergence property of scaled two-step BFGS method
- A trust-region strategy for minimization on arbitrary domains
- Global convergence of a modified two-parameter scaled BFGS method with Yuan-Wei-Lu line search for unconstrained optimization
- Some nonlinear conjugate gradient methods based on spectral scaling secant equations
- A variation of Broyden class methods using Householder adaptive transforms
- Implementing and modifying Broyden class updates for large scale optimization
- Improved conjugate gradient method for nonlinear system of equations
- A hybrid three-term conjugate gradient projection method for constrained nonlinear monotone equations with applications
- A new descent spectral Polak-Ribière-Polyak method based on the memoryless BFGS update
- Diagonally scaled memoryless quasi-Newton methods with application to compressed sensing
- A hybrid approach for finding approximate solutions to constrained nonlinear monotone operator equations with applications
- Nonmonotone diagonally scaled limited-memory BFGS methods with application to compressive sensing based on a penalty model
- A modified Dai-Kou-type method with applications to signal reconstruction and blurred image restoration
- New conjugate gradient algorithms based on self-scaling memoryless Broyden-Fletcher-Goldfarb-Shanno method
- A double parameter self-scaling memoryless BFGS method for unconstrained optimization
- A modified scaled memoryless symmetric rank-one method
- Diagonal quasi-Newton methods via least change updating principle with weighted Frobenius norm
- Analysis of the maximum magnification by the scaled memoryless DFP updating formula with application to compressive sensing
- Accelerated scaled memoryless BFGS preconditioned conjugate gradient algorithm for unconstrained optimization
- A brief survey of methods for solving nonlinear least-squares problems
- Superlinear convergence of nonlinear conjugate gradient method and scaled memoryless BFGS method based on assumptions about the initial point
- A modified self-scaling memoryless Broyden-Fletcher-Goldfarb-Shanno method for unconstrained optimization
- An adaptive sizing BFGS method for unconstrained optimization
- Accelerated adaptive Perry conjugate gradient algorithms based on the self-scaling memoryless BFGS update
- A Bregman extension of quasi-Newton updates. II: Analysis of robustness properties
- Shifted limited-memory variable metric methods for large-scale unconstrained optimization
- A class of descent four-term extension of the Dai-Liao conjugate gradient method based on the scaled memoryless BFGS update
- The global convergence of self-scaling BFGS algorithm with non-monotone line search for unconstrained nonconvex optimization problems
- Broyden's quasi-Newton methods for a nonlinear system of equations and unconstrained optimization: a review and open problems
- A modified scaling parameter for the memoryless BFGS updating formula
- Scaling damped limited-memory updates for unconstrained optimization
- scientific article; zbMATH DE number 4180681 (Why is no real title available?)
- Wide interval for efficient self-scaling quasi-Newton algorithms
- A Barzilai-Borwein conjugate gradient method
- A scaled nonlinear conjugate gradient algorithm for unconstrained optimization
- Scaled memoryless BFGS preconditioned steepest descent method for very large-scale unconstrained optimization
- scientific article; zbMATH DE number 3812857 (Why is no real title available?)
- On the selection of parameters in Self Scaling Variable Metric Algorithms
- Self-Scaling Variable Metric Algorithms without Line Search for Unconstrained Minimization
- Optimal conditioning of self-scaling variable Metric algorithms
- Matrix conditioning and nonlinear optimization
- An assessment of two approaches to variable metric methods
- A diagonal quasi-Newton updating method based on minimizing the measure function of Byrd and Nocedal for unconstrained optimization
- An adaptive nonmonotone trust region algorithm
- On measure functions for the self-scaling updating formulae for quasi-newton methods∗
- A Bregman extension of quasi-Newton updates I: An information geometrical framework
- A hybrid scaling parameter for the scaled memoryless BFGS method based on the _ matrix norm
- A class of diagonal quasi-Newton methods for large-scale convex minimization
- A new accelerated diagonal quasi-Newton updating method with scaled forward finite differences directional derivative for unconstrained optimization
- A class of adaptive dai-liao conjugate gradient methods based on the scaled memoryless BFGS update
- An adaptive nonmonotone trust region method based on a modified scalar approximation of the Hessian in the successive quadratic subproblems
- A modified Hestenes-Stiefel conjugate gradient method with an optimal property
- Scaled memoryless BFGS preconditioned conjugate gradient algorithm for unconstrained optimization
- Convergence analysis of the self-dual optimally conditioned ssvm method of oren-spedicato
- A modified conjugate gradient method based on a modified secant equation
- On the behaviour of a combined extra-updating/self-scaling BFGS method
- Spectral scaling BFGS method
- An inertial spectral CG projection method based on the memoryless BFGS update
- A projection-based derivative free DFP approach for solving system of nonlinear convex constrained monotone equations with image restoration applications
- Robust federated learning under statistical heterogeneity via hessian-weighted aggregation
- 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
- A descent family of the spectral Hestenes–Stiefel method by considering the quasi-Newton method
- An approximate Newton-type proximal method using symmetric rank-one updating formula for minimizing the nonsmooth composite functions
- A diagonally scaled Newton-type proximal method for minimization of the models with nonsmooth composite cost functions
- A new version of augmented self-scaling BFGS method
- Nonmonotone BFGS-trained recurrent neural networks for temporal sequence processing
- On two symmetric Dai-Kou type schemes for constrained monotone equations with image recovery application
- A new self-scaling memoryless quasi-Newton update for unconstrained optimization
- A hybrid BFGS-like method for monotone operator equations with applications
- A modified two-parameter scaled Broyden-type algorithm for unconstrained optimization problems
- Global convergence of a cautious projection BFGS algorithm for nonconvex problems without gradient Lipschitz continuity
- New gradient methods with adaptive stepsizes by approximate models
- A family of conjugate gradient methods with guaranteed positiveness and descent for vector optimization
This page was built for publication: Self-Scaling Variable Metric (SSVM) Algorithms
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4077749)