Asset Details
MbrlCatalogueTitleDetail
Do you wish to reserve the book?
A new full-NT step interior-point method for circular cone optimization
by
Kheirfam, Behrouz
in
Algorithms
/ circular cone
/ Circular cones
/ Euclidean Jordan algebra
/ interior-point method
/ Optimization
2019
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 new full-NT step interior-point method for circular cone optimization
by
Kheirfam, Behrouz
in
Algorithms
/ circular cone
/ Circular cones
/ Euclidean Jordan algebra
/ interior-point method
/ Optimization
2019
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 new full-NT step interior-point method for circular cone optimization
Journal Article
A new full-NT step interior-point method for circular cone optimization
2019
Request Book From Autostore
and Choose the Collection Method
Overview
We present a full step feasible interior-point algorithm for circular cone optimization using Euclidean Jordan algebras. The specificity of our method is to use a transformation similar to that introduced by Darvay and Takács for the centering equations of the central path of the linear optimization. The Nesterov and Todd symmetrization scheme is used to derive the search directions. The theoretical complexity bound of the algorithm coincides with the best-known iteration bound for small-update methods.
Publisher
Croatian Operational Research Society (CRORS),Hrvatsko društvo za operacijska istraživanja,Croatian Operational Research Society
This website uses cookies to ensure you get the best experience on our website.