Asset Details
MbrlCatalogueTitleDetail
Do you wish to reserve the book?
A Quasi-Newton Method with Wolfe Line Searches for Multiobjective Optimization
by
Souza, D. R
, Prudente, L. F
in
Algorithms
/ Convergence
/ Methods
/ Multiple objective analysis
/ Optimization
/ Pareto optimization
/ Quasi Newton methods
/ Searching
2022
Hey, we have placed the reservation for you!
By the way, why not check out events that you can attend while you pick your title.
You are currently in the queue to collect this book. You will be notified once it is your turn to collect the book.
Oops! Something went wrong.
Looks like we were not able to place the reservation. Kindly try again later.
Are you sure you want to remove the book from the shelf?
Oops! Something went wrong.
While trying to remove the title from your shelf something went wrong :( Kindly try again later!
Do you wish to request the book?
A Quasi-Newton Method with Wolfe Line Searches for Multiobjective Optimization
by
Souza, D. R
, Prudente, L. F
in
Algorithms
/ Convergence
/ Methods
/ Multiple objective analysis
/ Optimization
/ Pareto optimization
/ Quasi Newton methods
/ Searching
2022
Please be aware that the book you have requested cannot be checked out. If you would like to checkout this book, you can reserve another copy
We have requested the book for you!
Your request is successful and it will be processed during the Library working hours. Please check the status of your request in My Requests.
Oops! Something went wrong.
Looks like we were not able to place your request. Kindly try again later.
A Quasi-Newton Method with Wolfe Line Searches for Multiobjective Optimization
Journal Article
A Quasi-Newton Method with Wolfe Line Searches for Multiobjective Optimization
2022
Request Book From Autostore
and Choose the Collection Method
Overview
We propose a BFGS method with Wolfe line searches for unconstrained multiobjective optimization problems. The algorithm is well defined even for general nonconvex problems. Global convergence and R-linear convergence to a Pareto optimal point are established for strongly convex problems. In the local convergence analysis, if the objective functions are locally strongly convex with Lipschitz continuous Hessians, the rate of convergence is Q-superlinear. In this respect, our method exactly mimics the classical BFGS method for single-criterion optimization.
Publisher
Springer Nature B.V
Subject
This website uses cookies to ensure you get the best experience on our website.