Coordinatewise domain scaling algorithm for M-convex function minimization

Research output: Contribution to journalArticle

10 Citations (Scopus)

Abstract

We present a polynomial time scaling algorithm for the minimization of an M-convex function. M-convex functions are nonlinear discrete functions with (poly)matroid structures, which are being recognized as playing a fundamental role in tractable cases of discrete optimization. The algorithm is applicable also to a variant of quasi M-convex functions.

Original languageEnglish
Pages (from-to)339-354
Number of pages16
JournalMathematical Programming
Volume102
Issue number2
DOIs
Publication statusPublished - 2005 Mar
Externally publishedYes

Fingerprint

Function Minimization
Convex Minimization
Convex function
Scaling
Discrete Optimization
Matroid
Polynomial time
Polynomials

Keywords

  • Discrete convex analysis
  • M-convex function minimization
  • Scaling algorithm

ASJC Scopus subject areas

  • Applied Mathematics
  • Mathematics(all)
  • Safety, Risk, Reliability and Quality
  • Management Science and Operations Research
  • Software
  • Computer Graphics and Computer-Aided Design
  • Computer Science(all)

Cite this

Coordinatewise domain scaling algorithm for M-convex function minimization. / Tamura, Akihisa.

In: Mathematical Programming, Vol. 102, No. 2, 03.2005, p. 339-354.

Research output: Contribution to journalArticle

@article{ff20fdf7127e462ea115bafeec794ccc,
title = "Coordinatewise domain scaling algorithm for M-convex function minimization",
abstract = "We present a polynomial time scaling algorithm for the minimization of an M-convex function. M-convex functions are nonlinear discrete functions with (poly)matroid structures, which are being recognized as playing a fundamental role in tractable cases of discrete optimization. The algorithm is applicable also to a variant of quasi M-convex functions.",
keywords = "Discrete convex analysis, M-convex function minimization, Scaling algorithm",
author = "Akihisa Tamura",
year = "2005",
month = "3",
doi = "10.1007/s10107-004-0522-y",
language = "English",
volume = "102",
pages = "339--354",
journal = "Mathematical Programming",
issn = "0025-5610",
publisher = "Springer-Verlag GmbH and Co. KG",
number = "2",

}

TY - JOUR

T1 - Coordinatewise domain scaling algorithm for M-convex function minimization

AU - Tamura, Akihisa

PY - 2005/3

Y1 - 2005/3

N2 - We present a polynomial time scaling algorithm for the minimization of an M-convex function. M-convex functions are nonlinear discrete functions with (poly)matroid structures, which are being recognized as playing a fundamental role in tractable cases of discrete optimization. The algorithm is applicable also to a variant of quasi M-convex functions.

AB - We present a polynomial time scaling algorithm for the minimization of an M-convex function. M-convex functions are nonlinear discrete functions with (poly)matroid structures, which are being recognized as playing a fundamental role in tractable cases of discrete optimization. The algorithm is applicable also to a variant of quasi M-convex functions.

KW - Discrete convex analysis

KW - M-convex function minimization

KW - Scaling algorithm

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

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

U2 - 10.1007/s10107-004-0522-y

DO - 10.1007/s10107-004-0522-y

M3 - Article

AN - SCOPUS:21144433650

VL - 102

SP - 339

EP - 354

JO - Mathematical Programming

JF - Mathematical Programming

SN - 0025-5610

IS - 2

ER -