An adaptive scaled BFGS method for unconstrained optimization
From MaRDI portal
Publication:684183
DOI10.1007/S11075-017-0321-1zbMATH Open1383.65059OpenAlexW2601243475MaRDI QIDQ684183FDOQ684183
Authors: Neculai Andrei 
Publication date: 9 February 2018
Published in: Numerical Algorithms (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s11075-017-0321-1
Recommendations
- THE SCALING OF HYBRID METHOD IN SOLVING UNCONSTRAINED OPTIMIZATION METHOD
- An adaptive sizing BFGS method for unconstrained optimization
- Modifying the BFGS update by a new column scaling technique
- Global convergence of a modified two-parameter scaled BFGS method with Yuan-Wei-Lu line search for unconstrained optimization
- A double parameter scaled BFGS method for unconstrained optimization
global convergencenumerical comparisonsunconstrained optimizationnumerical experimentsBroyden-Fletcher-Goldfarb-Shanno method (BFGS)
Cites Work
- Benchmarking optimization software with performance profiles.
- A Family of Variable-Metric Methods Derived by Variational Means
- A new approach to variable metric algorithms
- Conditioning of Quasi-Newton Methods for Function Minimization
- Optimization theory and methods. Nonlinear programming
- Two-Point Step Size Gradient Methods
- An unconstrained optimization test functions collection
- Convergence Conditions for Ascent Methods
- Convergence Conditions for Ascent Methods. II: Some Corrections
- Methods of conjugate gradients for solving linear systems
- Quasi-Newton Methods, Motivation and Theory
- Title not available (Why is that?)
- The Convergence of a Class of Double-rank Minimization Algorithms 1. General Considerations
- A modified BFGS method and its global convergence in nonconvex minimization
- Properties and numerical performance of quasi-Newton methods with modified quasi-Newton equations
- Spectral scaling BFGS method
- The BFGS method with exact line searches fails for non-convex objective functions
- Global Convergence of a Cass of Quasi-Newton Methods on Convex Problems
- A Tool for the Analysis of Quasi-Newton Methods with Application to Unconstrained Minimization
- Convergence Properties of the BFGS Algoritm
- A Modified BFGS Algorithm for Unconstrained Optimization
- Self-Scaling Variable Metric (SSVM) Algorithms
- Global and superlinear convergence of a restricted class of self-scaling methods with inexact line searches, for convex functions
- A Characterization of Superlinear Convergence and Its Application to Quasi-Newton Methods
- Numerical expirience with a class of self-scaling quasi-Newton algorithms
- Title not available (Why is that?)
- Variational quasi-Newton methods for unconstrained optimization
- How bad are the BFGS and DFP methods when the objective function is quadratic?
- On the Behavior of Broyden’s Class of Quasi-Newton Methods
- Reduced-Hessian quasi-Newton methods for unconstrained optimization
- The global convergence of partitioned BFGS on problems with convex decompositions and Lipschitzian gradients
- Minimization Algorithms Making Use of Non-quadratic Properties of the Objective Function
- Variable metric algorithms: Necessary and sufficient conditions for identical behaviour of nonquadratic functions
- Updating conjugate directions by the BFGS formula
- Analysis of a self-scaling quasi-Newton method
- On the Convergence of the Variable Metric Algorithm
- Modifying the BFGS method
- A Note on Minimization Algorithms which make Use of Non-quardratic Properties of the Objective Function
Cited In (16)
- A comparative study of modified BFGS and scale modified BFGS
- A conjugate direction implementation of the BFGS algorithm with automatic scaling
- An efficient step size for BFGS
- A modified two-parameter scaled Broyden-type algorithm for unconstrained optimization problems
- A hybrid conjugate gradient algorithm for nonconvex functions and its applications in image restoration problems
- Discrete-time zeroing neural network of \(O(\tau^4)\) pattern for online solving time-varying nonlinear optimization problem: application to manipulator motion generation
- Spectral scaling BFGS method
- Global convergence of a modified two-parameter scaled BFGS method with Yuan-Wei-Lu line search for unconstrained optimization
- Two--parameter scaled memoryless BFGS methods with a nonmonotone choice for the initial step length
- A double parameter self-scaling memoryless BFGS method for unconstrained optimization
- A structured quasi-Newton algorithm with nonmonotone search strategy for structured NLS problems and its application in robotic motion control
- A double-parameter scaling Broyden-Fletcher-Goldfarb-Shanno method based on minimizing the measure function of Byrd and Nocedal for unconstrained optimization
- An adaptive projection BFGS method for nonconvex unconstrained optimization problems
- Adaptive scaling damped BFGS method without gradient Lipschitz continuity
- Type-1 and singleton fuzzy logic system binary classifier trained by BFGS optimization method
- An Alternative Scaling Factor In Broyden's Class Methods for Unconstrained Optimization
This page was built for publication: An adaptive scaled BFGS method for unconstrained optimization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q684183)
