Global convergence of a BFGS-type algorithm for nonconvex multiobjective optimization problems

DOI10.1007/S10589-024-00571-XMaRDI QIDQ6568922zbMATH OpenFDO

Authors L. F. Prudente, D. R. Souza

Publication date 8 July 2024

Published in Computational Optimization and Applications (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/S10589-024-00571-X

zbMATH Keywords

BFGSglobal convergencemultiobjective optimizationPareto optimalityquasi-Newton methodsrate of convergenceWolfe line search

Mathematics Subject Classification ID

Newton-type methods (49M15) Numerical mathematical programming methods (65K05) Multi-objective and goal programming (90C29) Nonlinear programming (90C30) Methods of quasi-Newton type (90C53)

Recommendations

• A globally convergent BFGS method with nonmonotone line search for non-convex minimization
• A modified BFGS method and its global convergence in nonconvex minimization
• Global convergence properties of the modified BFGS method associating with general line search model
• The global convergence of a modified BFGS method under inexact line search for nonconvex functions
• Global convergence of a modified limited memory BFGS method for non-convex minimization

Cites work

• A Characterization of Superlinear Convergence and Its Application to Quasi-Newton Methods
• A Family of Variable-Metric Methods Derived by Variational Means
• A limited memory quasi-Newton approach for multi-objective optimization
• A modified BFGS method and its global convergence in nonconvex minimization
• A modified Quasi-Newton method for vector optimization problem
• A new approach to variable metric algorithms
• A perfect example for the BFGS method
• A projected gradient method for vector optimization problems
• A quadratically convergent Newton method for vector optimization
• A quasi-Newton method with Wolfe line searches for multiobjective optimization
• A steepest descent method for vector optimization
• A study of Liu-Storey conjugate gradient methods for vector optimization
• A superlinearly convergent nonmonotone quasi-Newton method for unconstrained multiobjective optimization
• A Tool for the Analysis of Quasi-Newton Methods with Application to Unconstrained Minimization
• A Wolfe Line Search Algorithm for Vector Optimization
• Adaptive Scalarization Methods in Multiobjective Optimization
• Approximate proximal methods in vector optimization
• Benchmarking optimization software with performance profiles.
• Conditional gradient method for multiobjective optimization
• Conditional gradient method for vector optimization
• Conditioning of Quasi-Newton Methods for Function Minimization
• Convergence analysis of a nonmonotone projected gradient method for multiobjective optimization problems
• Convergence of the projected gradient method for quasiconvex multiobjective optimization
• Convergence Properties of the BFGS Algoritm
• Direct Multisearch for Multiobjective Optimization
• Extended Newton methods for multiobjective optimization: majorizing function technique and convergence analysis
• Generalized proximal method for efficient solutions in vector optimization
• Globally convergent Newton-type methods for multiobjective optimization
• scientific article; zbMATH DE number 3529352 (Why is no real title available?)
• scientific article; zbMATH DE number 5060482 (Why is no real title available?)
• Hybrid approximate proximal algorithms for efficient solutions in vector optimization
• Hybrid approximate proximal method with auxiliary variational inequality for vector optimization
• Inexact projected gradient method for vector optimization
• Newton-like methods for efficient solutions in vector optimization
• Newton's method for multiobjective optimization
• Nonlinear Conjugate Gradient Methods for Vector Optimization
• Nonlinear multiobjective optimization
• Nonsmooth multiobjective programming with quasi-Newton methods
• On the convergence of the projected gradient method for vector optimization
• On the extension of the Hager-Zhang conjugate gradient method for vector optimization
• On the global convergence of the BFGS method for nonconvex unconstrained optimization problems
• Practical augmented Lagrangian methods for constrained optimization
• Proximal Methods in Vector Optimization
• Quasi-Newton methods for multiobjective optimization problems
• Quasi-Newton methods for solving multiobjective optimization
• Quasi-Newton's method for multiobjective optimization
• Steepest descent methods for multicriteria optimization.
• The BFGS method with exact line searches fails for non-convex objective functions
• The Convergence of a Class of Double-rank Minimization Algorithms 1. General Considerations
• The multiobjective steepest descent direction is not Lipschitz continuous, but is Hölder continuous

Cited in

(4)

• A diagonal quasi-Newton method with modified BFGS update for nonconvex multiobjective optimization
• A hybrid gradient method for vector optimization problems
• Preconditioned Barzilai-Borwein methods for multiobjective optimization problems
• On the convergence of Newton-type proximal gradient method for multiobjective optimization problems

This page was built for publication: Global convergence of a BFGS-type algorithm for nonconvex multiobjective optimization problems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6568922)