Linearly constrained global optimization via piecewise-linear approximation

Journal of Computational and Applied Mathematics

Volumn 214, Issue 1, 2008, Pages 111-120

  Zhang, Hao ^a   Wang, Shuning ^a  

^a TSINGHUA UNIVERSITY   (China)

Author keywords

Global optimization; Lattice piecewise linear model; Nonlinear programming; Piecewise linear approximation

Indexed keywords

APPROXIMATION ALGORITHMS; COMPUTATIONAL COMPLEXITY; CONSTRAINED OPTIMIZATION; NONLINEAR ANALYSIS; NUMERICAL METHODS; PIECEWISE LINEAR TECHNIQUES; PROBLEM SOLVING;

COMPLEX NONLINEAR PROBLEMS; LATTICE PIECEWISE-LINEAR MODEL; NUMERICAL EXAMPLE;

GLOBAL OPTIMIZATION;

EID: 38949189335     PISSN: 03770427     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.cam.2007.02.006     Document Type: Article

References (7)

1. Chien M.J., and Kuh E. Solving nonlinear resistive networks using piecewise-linear analysis and simplicial subdivision. IEEE Trans. Circuits Systems-I: Fund. Theory Appl. 24 (1977) 305-317
2. Dantzig G.B. Linear Programming and Extensions (1963), Princeton University Press, Princeton, NJ
3. Hosrst R., Pardalos P.M., and Thoai N.V. Introduction to Global Optimization. second ed. (2000), Kluwer Academic Publishers, Boston
4. Padberg M.W. Approximating separable nonlinear functions via mixed zero-one programs. Oper. Res. Lett. 27 (2000) 1-5
5. Sherali H.D. On mixed-integer zero-one representations for separable lower-semicontinuous piecewise-linear functions. Oper. Res. Lett. 28 (2001) 155-160
6. Tarela J.M., and Martínez M.V. Region configurations for realizability of lattice piecewise-linear models. Math. Comput. Modelling 30 (1999) 17-27
7. Zhang H., and Wang S. Global optimization of separable objective functions on convex polyhedra via piecewise-linear approximation. J. Comput. Appl. Math. 197 (2006) 212-217