A Modified BFGS Algorithm for Unconstrained Optimization
From MaRDI portal
Recommendations
- A modified nonmonotone BFGS algorithm for unconstrained optimization
- scientific article; zbMATH DE number 700611
- A type of modified BFGS algorithm with any rank defects and the local Q-superlinear convergence properties
- Global convergence properties of two modified BFGS-type methods
- Analysis of a quasi-Newton method for unconstrained optimization
Cited in
(86)- New nonlinear conjugate gradient methods based on optimal Dai-Liao parameters
- New BFGS method for unconstrained optimization problem based on modified armijo line search
- A nonmonotone scaled conjugate gradient algorithm for large-scale unconstrained optimization
- A class of modified BFGS methods with function value information for unconstrained optimization
- A modified BFGS-type algorithm for unconstrained optimization
- An adaptive scaled BFGS method for unconstrained optimization
- On \(q\)-BFGS algorithm for unconstrained optimization problems
- A class of accelerated subspace minimization conjugate gradient methods
- A novel temperature prediction method without using energy equation based on physics-informed neural network (PINN): a case study on plate-circular/square pin-fin heat sinks
- A hybrid quasi-Newton method with application in sparse recovery
- A new class of quasi-Newton updating formulas
- Nonmonotone adaptive trust region method with line search based on new diagonal updating
- An efficient step size for BFGS
- A new subspace minimization conjugate gradient method based on tensor model for unconstrained optimization
- A limited memory subspace minimization conjugate gradient algorithm for unconstrained optimization
- A modified two-parameter scaled Broyden-type algorithm for unconstrained optimization problems
- Some improved Dai-Yuan conjugate gradient methods for large-scale unconstrained optimization problems
- A double parameter scaled BFGS method for unconstrained optimization
- A new subspace minimization conjugate gradient method for unconstrained minimization
- Spectral scaling BFGS method
- Computational experience with known variable metric updates
- Global convergence of the non-quasi-Newton method for unconstrained optimization problems
- Global convergence of a modified two-parameter scaled BFGS method with Yuan-Wei-Lu line search for unconstrained optimization
- A new steepest descent method with global convergence properties
- A type of modified BFGS algorithm with any rank defects and the local Q-superlinear convergence properties
- Non-asymptotic superlinear convergence of standard quasi-Newton methods
- A new hybrid conjugate gradient method for large-scale unconstrained optimization problem with non-convex objective function
- Properties and numerical performance of quasi-Newton methods with modified quasi-Newton equations
- Several efficient gradient methods with approximate optimal stepsizes for large scale unconstrained optimization
- A combination of large eddy simulation and physics-informed machine learning to predict pore-scale flow behaviours in fibrous porous media: a case study of transient flow passing through a surgical mask
- Multi-directional parallel algorithms for unconstrained optimization
- A modified scaling parameter for the memoryless BFGS updating formula
- A regularized limited memory subspace minimization conjugate gradient method for unconstrained optimization
- Multi-material inverse design of soft deformable bodies via functional optimization
- Two modified scaled nonlinear conjugate gradient methods
- Global convergence of a family of modified BFGS methods under a modified weak-Wolfe-Powell line search for nonconvex functions
- A New Dai-Liao Conjugate Gradient Method based on Approximately Optimal Stepsize for Unconstrained Optimization
- Global convergence of a cautious projection BFGS algorithm for nonconvex problems without gradient Lipschitz continuity
- Scaling damped limited-memory updates for unconstrained optimization
- Higher order curvature information and its application in a modified diagonal Secant method
- Parametrization and comparative analysis of the BFGS optimization algorithm for the determination of optimum linear coefficients
- scientific article; zbMATH DE number 5196186 (Why is no real title available?)
- A combined class of self-scaling and modified quasi-Newton methods
- A modified BFGS algorithm based on a hybrid secant equation
- New quasi-Newton equation and related methods for unconstrained optimization
- A descent family of Dai-Liao conjugate gradient methods
- A new simple model trust-region method with generalized Barzilai-Borwein parameter for large-scale optimization
- On optimality of the parameters of self-scaling memoryless quasi-Newton updating formulae
- New gradient methods with adaptive stepsizes by approximate models
- On the inversion-free Newton's method and its applications
- An augmented memoryless BFGS method based on a modified secant equation with application to compressed sensing
- Two new conjugate gradient methods based on modified secant equations
- A modified secant method for unconstrained optimization
- A Dai-Liao conjugate gradient method via modified secant equation for system of nonlinear equations
- Two hybrid nonlinear conjugate gradient methods based on a modified secant equation
- New subspace minimization conjugate gradient methods based on regularization model for unconstrained optimization
- Several accelerated subspace minimization conjugate gradient methods based on regularization model and convergence rate analysis for nonconvex problems
- A quadratic hybridization of Polak-Ribière-Polyak and Fletcher-Reeves conjugate gradient methods
- A Trust Regional Algorithm for Bound Constrained Minimization
- A new subspace minimization conjugate gradient method based on modified secant equation for unconstrained optimization
- A double-parameter scaling Broyden-Fletcher-Goldfarb-Shanno method based on minimizing the measure function of Byrd and Nocedal for unconstrained optimization
- A modified two-point stepsize gradient algorithm for unconstrained minimization
- An improved Dai-Kou conjugate gradient algorithm for unconstrained optimization
- An improved nonlinear conjugate gradient method with an optimal property
- A subspace minimization conjugate gradient method based on conic model for unconstrained optimization
- Higher-order adaptive BFGS algorithm for nonconvex functions
- Computational experiments with scaled initial hessian approximation for the broyden family methods∗
- A new subspace minimization conjugate gradient method with nonmonotone line search for unconstrained optimization
- A hybrid conjugate gradient method based on a quadratic relaxation of the Dai-Yuan hybrid conjugate gradient parameter
- Using function-values in multi-step quasi-Newton methods
- Enhanced Dai-Liao conjugate gradient methods for systems of monotone nonlinear equations
- A class of descent four-term extension of the Dai-Liao conjugate gradient method based on the scaled memoryless BFGS update
- The Dai-Liao nonlinear conjugate gradient method with optimal parameter choices
- Descent Perry conjugate gradient methods for systems of monotone nonlinear equations
- An efficient Barzilai-Borwein conjugate gradient method for unconstrained optimization
- An adaptive sizing BFGS method for unconstrained optimization
- A new subspace minimization conjugate gradient method based on conic model for large-scale unconstrained optimization
- An efficient gradient method with approximately optimal stepsize based on tensor model for unconstrained optimization
- The Broyden-Fletcher-Goldfarb-Shanno algorithm based on new quasi-Newton equation
- Some modified Yabe–Takano conjugate gradient methods with sufficient descent condition
- Two effective hybrid conjugate gradient algorithms based on modified BFGS updates
- A modified nonmonotone BFGS algorithm for unconstrained optimization
- Diagonally scaled memoryless quasi-Newton methods with application to compressed sensing
- Two modified spectral conjugate gradient methods and their global convergence for unconstrained optimization
- Quasi-Newton Method for Set Optimization Problems with Set-Valued Mapping Given by Finitely Many Vector-Valued Functions
- An optimisation-based domain-decomposition reduced order model for parameter-dependent non-stationary fluid dynamics problems
This page was built for publication: A Modified BFGS Algorithm for Unconstrained Optimization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3359665)
