New BFGS method for unconstrained optimization problem based on modified Armijo line search
From MaRDI portal
Publication:5413886
DOI10.1080/02331934.2011.644284zbMath1288.90096OpenAlexW2032277533MaRDI QIDQ5413886
Zhong Wan, Xianlong Shen, Chaoming Hu, Kok Lay Teo
Publication date: 2 May 2014
Published in: Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/02331934.2011.644284
Related Items
A modified Broyden family algorithm with global convergence under a weak Wolfe-Powell line search for unconstrained nonconvex problems, An improved three-term conjugate gradient algorithm for solving unconstrained optimization problems, A diagonal quasi-Newton updating method based on minimizing the measure function of Byrd and Nocedal for unconstrained optimization, A penalty function-based random search algorithm for optimal control of switched systems with stochastic constraints and its application in automobile test-driving with gear shifts, A new nonmonotone spectral residual method for nonsmooth nonlinear equations, The global convergence of the BFGS method with a modified WWP line search for nonconvex functions, Global convergence of a nonmonotone Broyden family method for nonconvex unconstrained minimization, A double-parameter scaling Broyden-Fletcher-Goldfarb-Shanno method based on minimizing the measure function of Byrd and Nocedal for unconstrained optimization, An extended nonmonotone line search technique for large-scale unconstrained optimization, Empirical analysis and optimization of capital structure adjustment, Global convergence of a family of modified BFGS methods under a modified weak-Wolfe-Powell line search for nonconvex functions, On the nonmonotonicity degree of nonmonotone line searches, A new smoothing method for mathematical programs with complementarity constraints based on logarithm-exponential function, A new nonmonotone line search technique for unconstrained optimization, Optimal pricing and ordering in global supply chain management with constraints under random demand, A globally convergent BFGS method for symmetric nonlinear equations, A LOCALLY SMOOTHING METHOD FOR MATHEMATICAL PROGRAMS WITH COMPLEMENTARITY CONSTRAINTS
Uses Software
Cites Work
- New inexact line search method for unconstrained optimization
- Modified secant-type methods for unconstrained optimization
- On the limited memory BFGS method for large scale optimization
- Global convergence of the nonmonotone MBFGS method for nonconvex unconstrained minimization
- The global convergence of partitioned BFGS on problems with convex decompositions and Lipschitzian gradients
- Modifying the BFGS update by a new column scaling technique
- The BFGS method with exact line searches fails for non-convex objective functions
- Local convergence analysis for partitioned quasi-Newton updates
- Global convergence properties of the modified BFGS method associating with general line search model
- Efficent line search algorithm for unconstrained optimization
- Local and superlinear convergence of quasi-Newton methods based on modified secant conditions
- New quasi-Newton methods for unconstrained optimization problems
- An two phase ABS method for solving over-determined systems of linear inequalities
- On the Global Convergence of the BFGS Method for Nonconvex Unconstrained Optimization Problems
- A globally convergent BFGS method for nonlinear monotone equations without any merit functions
- Global Convergence of a New Hybrid Gauss–Newton Structured BFGS Method for Nonlinear Least Squares Problems
- A Modified BFGS Algorithm for Unconstrained Optimization
- Line‐search methods in general return mapping algorithms with application to porous plasticity
- 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
- Testing Unconstrained Optimization Software
- Numerical Optimization
- Limited-Memory Reduced-Hessian Methods for Large-Scale Unconstrained Optimization
- A Nonmonotone Line Search Technique and Its Application to Unconstrained Optimization
- A Globally and Superlinearly Convergent Gauss--Newton-Based BFGS Method for Symmetric Nonlinear Equations
- Convergence Properties of the BFGS Algoritm
- A modified BFGS method and its global convergence in nonconvex minimization
- Properties and numerical performance of quasi-Newton methods with modified quasi-Newton equations
- Global convergence of a regularized factorized quasi-Newton method for nonlinear least squares problems
