The global convergence of partitioned BFGS on problems with convex decompositions and Lipschitzian gradients

DOI10.1007/BF01594933zbMath0736.90068OpenAlexW2024524305WikidataQ57389714 ScholiaQ57389714MaRDI QIDQ1176574

Andreas Griewank

Publication date: 25 June 1992

Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf01594933

zbMATH Keywords

global convergencelocal convergence\(R\)- superlinear convergencepartitioned BFGS method

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Nonlinear programming (90C30) Computational methods for problems pertaining to operations research and mathematical programming (90-08)

Related Items

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, The global convergence of a modified BFGS method for nonconvex functions, Global convergence of a modified Broyden family method for nonconvex functions, 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, The projection technique for two open problems of unconstrained optimization problems, The convergence of a new modified BFGS method without line searches for unconstrained optimization or complexity systems, An adaptive projection BFGS method for nonconvex unconstrained optimization problems, Global convergence of Schubert's method for solving sparse nonlinear equations, The equivalence of strict convexity and injectivity of the gradient in bounded level sets, A partitioned PSB method for partially separable unconstrained optimization problems, An adaptive scaled BFGS method for unconstrained optimization, A new modified BFGS method for unconstrained optimization problems, Partitioned quasi-Newton methods for sparse nonlinear equations, New BFGS method for unconstrained optimization problem based on modified Armijo line search, Computation of exact gradients in distributed dynamic systems, Global convergence of a modified two-parameter scaled BFGS method with Yuan-Wei-Lu line search for unconstrained optimization, A modified BFGS method and its global convergence in nonconvex minimization, Convergence analysis of a modified BFGS method on convex minimizations, A globally convergent BFGS method for nonlinear monotone equations without any merit functions, Using nonlinear functions to approximate a new quasi-Newton method for unconstrained optimization problems, Global convergence of BFGS and PRP methods under a modified weak Wolfe-Powell line search, A globally convergent BFGS method for nonconvex minimization without line searches, Unnamed Item, Variable metric methods for unconstrained optimization and nonlinear least squares, A derivative-free line search and dfp method for symmetric equations with global and superlinear convergence

Uses Software

• ve08
• Algorithm 524

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Two examples on the convergence of certain rank-2 minimization methods for quadratic functionals in Hilbert space
• Partitioned variable metric updates for large structured optimization problems
• The equivalence of strict convexity and injectivity of the gradient in bounded level sets
• Effiziente Schrittweitenfunktionen bei unrestringierten Optimierungsaufgaben
• Local convergence analysis for partitioned quasi-Newton updates
• A Quasi-Newton Method for Elliptic Boundary Value Problems
• Global convergence of the partitioned BFGS algorithm for convex partially separable optimization
• On the Accurate Determination of Search Directions for Simple Differentiable Penalty Functions
• On the Smoothness of Convex Envelopes
• The convergence of variable metric matrices in unconstrained optimization
• Optimization and nonsmooth analysis
• The “global” convergence of Broyden-like methods with suitable line search
• The Local Convergence of Broyden-Like Methods on Lipschitzian Problems in Hilbert Spaces
• 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
• On Convergence Properties of Algorithms for Unconstrained Minimization
• A Characterization of Superlinear Convergence and Its Application to Quasi-Newton Methods
• On the existence of convex decompositions of partially separable functions
• Variable metric methods of minimisation
• Convergence Conditions for Ascent Methods. II: Some Corrections
• The Convergence of a Class of Double-rank Minimization Algorithms 1. General Considerations