Inner approximation method for a reverse convex programming problem

Proceedings of the IEEE International Conference on Systems, Man and Cybernetics

Volumn 3, Issue , 1999, Pages

  Yamada, S ^a   Tanino, T ^a   Inuiguchi, M ^a   Tatsumi, K ^a  

^a OSAKA UNIVERSITY   (Japan)

Author keywords

[No Author keywords available]

Indexed keywords

GLOBAL OPTIMIZATION; INNER APPROXIMATION METHOD; PENALTY FUNCTION METHOD; REVERSE CONVEX PROGRAMMING PROBLEM;

ALGORITHMS; APPROXIMATION THEORY; CONSTRAINT THEORY; CONVERGENCE OF NUMERICAL METHODS; INVERSE PROBLEMS; ITERATIVE METHODS; MATHEMATICAL TRANSFORMATIONS; PROBLEM SOLVING; SET THEORY;

MATHEMATICAL PROGRAMMING;

EID: 17144460743     PISSN: 08843627     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (5)

1. Bazaraa, M.S., H.D. Sherali and C.M. Shetty, Nonlinear Programming: Theory and Algorithms, 2nd ed., John Wiley, New York (1993).
2. Horst, R. and H. Tuy, Global Optimization: Deterministic Approaches, Third, Revised and Enlarged Edition, Springer-Verlag, Berlin (1996).
3. Horst, R. and P.M. Pardalos, Handbook of Global Optimization, Kluwer Academic Publishers, Dordrecht (1995).
4. Konno, H., P.T. Thach and H. Tuy, Optimization on Low Rank Nonconvex Structures, Kluwer Academic Publishers, Dordrecht (1997).
5. Tuy, H., Convex Analysis and Global Optimization, Kluwer Academic Publishers, Dordrecht (1998).