DCP HOME

Pseudo-Separable Absolute L-Convex Minimization

For a finite set V={1,2,...,n} and a family of univariate discrete convex functions f_ij and f_i indexed by ijV and iV, the function defined by

def-lseparable def-pluslseparable

is an L-convex function [1,2].

Here we consider a absolute L-convex function:

In this web application, you can choose the dimension n from 1 to 10.

dimension n =

You can input parameters sij, tij, ai and bi in the ranges 0 < sij, ai<100 and -100< tij, bi< 100.

You can also input an initial solution x.

s 1 2 3
1
2
3

t 1 2 3
1
2
3

1 2 3
a
b
x

(Note: "Reset" button resets your inputs to default values.
An inappropriate input value will be replaced with a random number.)


This web application minimizes f(x) using ODICON.

[1] K. Murota (2001): "Discrete Convex Analysis---An Introduction (in Japanese)," Kyoritsu Publishing Company, Tokyo. Section 5.2.

[2] K. Murota (2003): "Discrete Convex Analysis," SIAM. Section 7.3.


Nobuyuki Tsuchimura, Satoko Moriguchi