The BFGS method with exact line searches fails for non-convex objective functions
From MaRDI portal
Publication:1424287
DOI10.1007/s10107-003-0421-7zbMath1082.90108OpenAlexW1998749910MaRDI QIDQ1424287
Publication date: 11 March 2004
Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10107-003-0421-7
Related Items (60)
Forward-backward quasi-Newton methods for nonsmooth optimization problems ⋮ A limited memory BFGS algorithm for non-convex minimization with applications in matrix largest eigenvalue problem ⋮ On local search in d.c. optimization problems ⋮ An inexact-restoration method for nonlinear bilevel programming problems ⋮ On \(q\)-BFGS algorithm for unconstrained optimization problems ⋮ Quasi-Newton methods for machine learning: forget the past, just sample ⋮ A modified conjugate gradient method based on a modified secant equation ⋮ On numerical solving the spherical separability problem ⋮ A quasi-Newton method with Wolfe line searches for multiobjective optimization ⋮ On iterative algorithm and perturbation analysis for the nonlinear matrix equation ⋮ The regularization continuation method with an adaptive time step control for linearly constrained optimization problems ⋮ A modified nonmonotone BFGS algorithm for unconstrained optimization ⋮ A Modified Non-Monotone BFGS Method for Non-Convex Unconstrained Optimization ⋮ Inversion study of vertical eddy viscosity coefficient based on an internal tidal model with the adjoint method ⋮ A double-parameter scaling Broyden-Fletcher-Goldfarb-Shanno method based on minimizing the measure function of Byrd and Nocedal for unconstrained optimization ⋮ Nonsmooth optimization via quasi-Newton methods ⋮ A double parameter scaled BFGS method for unconstrained optimization ⋮ Global convergence of a modified limited memory BFGS method for non-convex minimization ⋮ New cautious BFGS algorithm based on modified Armijo-type line search ⋮ A simple canonical form for nonlinear programming problems and its use ⋮ Global convergence of a family of modified BFGS methods under a modified weak-Wolfe-Powell line search for nonconvex functions ⋮ A new regularized limited memory BFGS-type method based on modified secant conditions for unconstrained optimization problems ⋮ The projection technique for two open problems of unconstrained optimization problems ⋮ Competitive secant (BFGS) methods based on modified secant relations for unconstrained optimization ⋮ Greedy PSB methods with explicit superlinear convergence ⋮ Minimizing sequences in a constrained DC optimization problem ⋮ The regularization continuation method for optimization problems with nonlinear equality constraints ⋮ A perfect example for the BFGS method ⋮ A modified secant equation quasi-Newton method for unconstrained optimization ⋮ The divergence of the BFGS and Gauss Newton methods ⋮ On Nesterov's nonsmooth Chebyshev-Rosenbrock functions ⋮ Total pressure losses minimization in turbomachinery cascades using the exact Hessian ⋮ Global convergence of a modified BFGS-type method for unconstrained non-convex minimization ⋮ A nonmonotone filter line search technique for the MBFGS method in unconstrained optimization ⋮ Newton's iterates can converge to non-stationary points ⋮ Nonsmooth Variants of Powell's BFGS Convergence Theorem ⋮ A modified BFGS method and its superlinear convergence in nonconvex minimization with general line search rule ⋮ Using gradient directions to get global convergence of Newton-type methods ⋮ Global convergence of the nonmonotone MBFGS method for nonconvex unconstrained minimization ⋮ An adaptive scaled BFGS method for unconstrained optimization ⋮ A new modified BFGS method for unconstrained optimization problems ⋮ A regularized limited memory BFGS method for nonconvex unconstrained minimization ⋮ New BFGS method for unconstrained optimization problem based on modified Armijo line search ⋮ Convergence analysis of an improved BFGS method and its application in the Muskingum model ⋮ Global convergence of a modified two-parameter scaled BFGS method with Yuan-Wei-Lu line search for unconstrained optimization ⋮ Convergence analysis of a modified BFGS method on convex minimizations ⋮ Using nonlinear functions to approximate a new quasi-Newton method for unconstrained optimization problems ⋮ Explicit pseudo-transient continuation and the trust-region updating strategy for unconstrained optimization ⋮ Global convergence of BFGS and PRP methods under a modified weak Wolfe-Powell line search ⋮ A limited memory BFGS-type method for large-scale unconstrained optimization ⋮ A local search method for optimization problem with d.c. inequality constraints ⋮ The divergence of the barycentric Padé interpolants ⋮ A robust multi-batch L-BFGS method for machine learning ⋮ A globally convergent BFGS method with nonmonotone line search for non-convex minimization ⋮ Non-linear data assimilation via trust region optimization ⋮ A globally convergent BFGS method for symmetric nonlinear equations ⋮ Globally convergent Newton-type methods for multiobjective optimization ⋮ Unnamed Item ⋮ A modified BFGS type quasi-Newton method with line search for symmetric nonlinear equations problems ⋮ Nonsmoothness and a variable metric method
This page was built for publication: The BFGS method with exact line searches fails for non-convex objective functions
