### 摘要

In this paper, we extend the Dinkelbach-type algorithm of Crouzeix, Ferland, and Schaible to solve minmax fractional programs with infinitely many ratios. Parallel to the case with finitely many ratios, the task is to solve a sequence of continuous minmax problems, P(α_{k})=min _{x∈X}(max_{t∈T}[f_{t}(x)- α_{k}g_{t}(x)]), until {α_{k}} converges to the root of P(α)=0. The solution of P(α _{k} ) is used to generate α _{k+1}. However, calculating the exact optimal solution of P(α_{k} ) requires an extraordinary amount of work. To improve, we apply an entropic regularization method which allows us to solve each problem P(α _{k} ) incompletely, generating an approximate sequence {α̃_{k}}, while retaining the linear convergence rate under mild assumptions. We present also numerical test results on the algorithm which indicate that the new algorithm is robust and promising.

原文 | English |
---|---|

頁（從 - 到） | 323-343 |

頁數 | 21 |

期刊 | Journal of Optimization Theory and Applications |

卷 | 126 |

發行號 | 2 |

DOIs | |

出版狀態 | Published - 2005 八月 1 |

### 指紋

### All Science Journal Classification (ASJC) codes

- Control and Optimization
- Management Science and Operations Research
- Applied Mathematics

### 引用此文

}

**Modified Dinkelbach-type algorithm for generalized fractional programs with infinitely many ratios.** / Lin, J. Y.; Sheu, Ruey-Lin.

研究成果: Article

TY - JOUR

T1 - Modified Dinkelbach-type algorithm for generalized fractional programs with infinitely many ratios

AU - Lin, J. Y.

AU - Sheu, Ruey-Lin

PY - 2005/8/1

Y1 - 2005/8/1

N2 - In this paper, we extend the Dinkelbach-type algorithm of Crouzeix, Ferland, and Schaible to solve minmax fractional programs with infinitely many ratios. Parallel to the case with finitely many ratios, the task is to solve a sequence of continuous minmax problems, P(αk)=min x∈X(maxt∈T[ft(x)- αkgt(x)]), until {αk} converges to the root of P(α)=0. The solution of P(α k ) is used to generate α k+1. However, calculating the exact optimal solution of P(αk ) requires an extraordinary amount of work. To improve, we apply an entropic regularization method which allows us to solve each problem P(α k ) incompletely, generating an approximate sequence {α̃k}, while retaining the linear convergence rate under mild assumptions. We present also numerical test results on the algorithm which indicate that the new algorithm is robust and promising.

AB - In this paper, we extend the Dinkelbach-type algorithm of Crouzeix, Ferland, and Schaible to solve minmax fractional programs with infinitely many ratios. Parallel to the case with finitely many ratios, the task is to solve a sequence of continuous minmax problems, P(αk)=min x∈X(maxt∈T[ft(x)- αkgt(x)]), until {αk} converges to the root of P(α)=0. The solution of P(α k ) is used to generate α k+1. However, calculating the exact optimal solution of P(αk ) requires an extraordinary amount of work. To improve, we apply an entropic regularization method which allows us to solve each problem P(α k ) incompletely, generating an approximate sequence {α̃k}, while retaining the linear convergence rate under mild assumptions. We present also numerical test results on the algorithm which indicate that the new algorithm is robust and promising.

UR - http://www.scopus.com/inward/record.url?scp=23844477256&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=23844477256&partnerID=8YFLogxK

U2 - 10.1007/s10957-005-4717-z

DO - 10.1007/s10957-005-4717-z

M3 - Article

AN - SCOPUS:23844477256

VL - 126

SP - 323

EP - 343

JO - Journal of Optimization Theory and Applications

JF - Journal of Optimization Theory and Applications

SN - 0022-3239

IS - 2

ER -