The original paper is in English. Non-English content has been machine-translated and may contain typographical errors or mistranslations. ex. Some numerals are expressed as "XNUMX".
Copyrights notice
The original paper is in English. Non-English content has been machine-translated and may contain typographical errors or mistranslations. Copyrights notice
Funções M-convexas possuem várias propriedades desejáveis como convexidade na otimização discreta. Podemos encontrar um mínimo global de uma função M-convexa por meio de um algoritmo ganancioso, ou seja, os chamados algoritmos de descida funcionam para a minimização. Neste artigo, aplicamos uma técnica de escalonamento a um algoritmo guloso e propomos um algoritmo eficiente para a minimização de uma função M-convexa. Resultados computacionais também são relatados.
The copyright of the original papers published on this site belongs to IEICE. Unauthorized use of the original or translated papers is prohibited. See IEICE Provisions on Copyright for details.
Copiar
Satoko MORIGUCHI, Kazuo MUROTA, Akiyoshi SHIOURA, "Scaling Algorithms for M-Convex Function Minimization" in IEICE TRANSACTIONS on Fundamentals,
vol. E85-A, no. 5, pp. 922-929, May 2002, doi: .
Abstract: M-convex functions have various desirable properties as convexity in discrete optimization. We can find a global minimum of an M-convex function by a greedy algorithm, i.e., so-called descent algorithms work for the minimization. In this paper, we apply a scaling technique to a greedy algorithm and propose an efficient algorithm for the minimization of an M-convex function. Computational results are also reported.
URL: https://global.ieice.org/en_transactions/fundamentals/10.1587/e85-a_5_922/_p
Copiar
@ARTICLE{e85-a_5_922,
author={Satoko MORIGUCHI, Kazuo MUROTA, Akiyoshi SHIOURA, },
journal={IEICE TRANSACTIONS on Fundamentals},
title={Scaling Algorithms for M-Convex Function Minimization},
year={2002},
volume={E85-A},
number={5},
pages={922-929},
abstract={M-convex functions have various desirable properties as convexity in discrete optimization. We can find a global minimum of an M-convex function by a greedy algorithm, i.e., so-called descent algorithms work for the minimization. In this paper, we apply a scaling technique to a greedy algorithm and propose an efficient algorithm for the minimization of an M-convex function. Computational results are also reported.},
keywords={},
doi={},
ISSN={},
month={May},}
Copiar
TY - JOUR
TI - Scaling Algorithms for M-Convex Function Minimization
T2 - IEICE TRANSACTIONS on Fundamentals
SP - 922
EP - 929
AU - Satoko MORIGUCHI
AU - Kazuo MUROTA
AU - Akiyoshi SHIOURA
PY - 2002
DO -
JO - IEICE TRANSACTIONS on Fundamentals
SN -
VL - E85-A
IS - 5
JA - IEICE TRANSACTIONS on Fundamentals
Y1 - May 2002
AB - M-convex functions have various desirable properties as convexity in discrete optimization. We can find a global minimum of an M-convex function by a greedy algorithm, i.e., so-called descent algorithms work for the minimization. In this paper, we apply a scaling technique to a greedy algorithm and propose an efficient algorithm for the minimization of an M-convex function. Computational results are also reported.
ER -