An Interior-Point Algorithm for Linear Programming with Optimal Selection of Centering Parameter and Step Size
Clicks: 160
ID: 268062
2021
Article Quality & Performance Metrics
Overall Quality
Not rated
Combines reader engagement with the AI quality analysis. This
article has not been analysed, so there is no overall score —
reader engagement is measured and shown alongside.
Reader Engagement
Star Article
30.0
/100
160 views
25 readers
AI Quality Assessment
Not analyzed
Mint this article as an NFT
Not yet mintedCreate a permanent, verifiable on-chain record of this article on the Scimatic Network. The NFT is held in your Journament account, and you can withdraw it to your own wallet at any time.
5
SUSD
one-off · no wallet required
Abstract
PDF | For interior-point algorithms in linear programming, it is well-known that the selection of the centering parameter is crucial for proving... | Find, read and cite all the research you need on ResearchGate
Abstract Quality Issue:
This abstract appears to be incomplete or contains metadata (32 words).
Try re-searching for a better abstract.
| Reference Key |
yang2021journalan
Use this key to autocite in the manuscript while using
SciMatic Manuscript Manager or Thesis Manager
|
|---|---|
| Authors | Yaguang Yang; |
| Journal | Journal of the Operations Research Society of China |
| Year | 2021 |
| DOI |
http://dx.doi.org/10.1007/s40305-020-00312-x
|
| URL | |
| Keywords |
|
Citations
No citations found. To add a citation, contact the admin at info@scimatic.org
Comments
No comments yet. Be the first to comment on this article.