Sign in
Author

Conference

Journal

Organization

Year

DOI
Look for results that meet for the following criteria:
since
equal to
before
between
and
Search in all fields of study
Limit my searches in the following fields of study
Agriculture Science
Arts & Humanities
Biology
Chemistry
Computer Science
Economics & Business
Engineering
Environmental Sciences
Geosciences
Material Science
Mathematics
Medicine
Physics
Social Science
Multidisciplinary
Keywords
(1)
Convex Optimization
Related Publications
(1)
Discrete convex analysis
Subscribe
Academic
Publications
Conjugate Scaling Algorithm for FenchelType Duality in Discrete Convex Optimization
Conjugate Scaling Algorithm for FenchelType Duality in Discrete Convex Optimization,10.1137/S1052623499352012,Siam Journal on Optimization,Satoru Iwa
Edit
Conjugate Scaling Algorithm for FenchelType Duality in Discrete Convex Optimization
(
Citations: 12
)
BibTex

RIS

RefWorks
Download
Satoru Iwata
,
Maiko Shigeno
Journal:
Siam Journal on Optimization  SIAMJO
, vol. 13, no. 1, pp. 204211, 2002
DOI:
10.1137/S1052623499352012
Cumulative
Annual
View Publication
The following links allow you to view full publications. These links are maintained by other sources not affiliated with Microsoft Academic Search.
(
dx.doi.org
)
(
link.aip.org
)
(
www.informatik.unitrier.de
)
Citation Context
(7)
...With the concept of Mconvex functions, the submodular flow problem is extended to the Mconvex submodular flow problem [25], which is one of the most general problems solvable in polynomial time [
19
]...
...An algorithm for Mconvex function minimization is a basic tool for those proposed in [8, 13,
19
, 20, 30]...
Akihisa Tamura
.
Coordinatewise domain scaling algorithm for Mconvex function minimiza...
...The first polynomialtime algorithm for the Mconvex submodular flow problem is the conjugate scaling algorithm of Iwata and Shigeno [
18
]...
Satoru Iwata
,
et al.
A capacity scaling algorithm for Mconvex submodular flow
...Step S1. By a proximity theorem due to [
12
] (see Proposition 8.9 in [20] and Lproximity theorem in [21]) there exists a minimizer q of g(p + αq) such that 0 ≤ q ≤ (n − 1)1...
Kazuo Murota
.
On Steepest Descent Algorithms for Discrete Convex Functions
...We next introduce a proximity theorem of Lconvex functions. Theorem 2 (Lproximity theorem, [
16
])...
Kazuo Murota
,
et al.
Proximity theorems of discrete convex functions
...ation, Iwata and Shigeno [
10
] have devised a polynomialtime algorithm based on...
...algorithm of Iwata–Shigeno [
10
] is based on the proximity theorem for Lconvex...
Satoko Moriguchi
.
Capacity scaling algorithm for scalable Mconvex submodular flow probl...
Sort by:
Citations
(12)
MATHEMATICAL ENGINEERING TECHNICAL REPORTS Recent Developments in Discrete Convex Analysis
Kazuo MUROTA
Published in 2008.
Maximization in Discrete Convex Analysis
Kazuo MUROTA
Published in 2008.
Coordinatewise domain scaling algorithm for Mconvex function minimization
(
Citations: 5
)
Akihisa Tamura
Journal:
Mathematical Programming
, vol. 102, no. 2, pp. 339354, 2005
A capacity scaling algorithm for Mconvex submodular flow
(
Citations: 4
)
Satoru Iwata
,
Satoko Moriguchi
,
Kazuo Murota
Journal:
Mathematical Programming
, vol. 103, no. 1, pp. 181202, 2005
On Steepest Descent Algorithms for Discrete Convex Functions
(
Citations: 18
)
Kazuo Murota
Journal:
Siam Journal on Optimization  SIAMJO
, vol. 14, no. 3, pp. 699707, 2004