Hoàng Tụy
Hoàng Tụy (born 1927) is a prominent Vietnamese applied mathematician. He received his PhD in mathematics from Moscow State University in 1959. He has worked mainly in the field of global optimization. He presently is at the Institute of Mathematics of the Vietnamese Academy of Science and Technology, where he was director from 1980 to 1990.
An Interview with Hoang Tuy--- Takahito Kuno Personal Interview --- Hoang Tuy
Interviewee: Hoang Tuy Interviewer: Takahito Kuno Interview Date: August 2002
1. Your full name, address and E-mail address
HOANG TUY Institute of Mathematics, P.O. Box 631, 10 000 Hanoi, Vietnam htuy@thevinh.ncst.ac.vn
2. Your highest degree, awarding institution and year
- Ph.D. (Mathematics), Moscow State University, 1959 - Honorary Doctor, Linkoping Institute of Technology, 1995
3. How many research papers have you published (including papers accepted for publication) in optimization?
Above 120
4. Your research interests:
Convex Analysis, especially: convex inequalities, minimax and fixed point. Global Optimization, especially: D.C. Optimization (theory, methods and algorithms for optimization problems described in terms of differences of convex functions); Low rank non convex optimization problems; D.M. Optimization (theory, methods and algorithms for optimization problems described in terms of differences of monotonic functions).
5. Some of your most representative papers or books
Books:
Global Optimization (Deterministic Approaches)(with R. Horst), third edition, Springer-Verlag. 1996 Optimization on Low Rank Non convex Structures (with H. Konno and P.T. Thach), Kluwer Academic Publishers 1997. Convex Analysis and Global Optimization, Kluwer Academic Publishers, 1998.
Papers:
Concave Programming under linear constraints, Soviet Mathematics 5(1964), 1437-1440 Convex inequalities and the Hahn-Banach Theorem, Dissertationes Mathematicae, XCVII (1972). A general minimax theorem, Doklady Akad. Nauk SSSR, 219:4(1974), 818-822 (in Russian) D.C. Optimization: Theory, Methods and Algorithms, in Handbook of Global Optimization, R. Horst and P. Pardalos eds, Kluwer Academic Publishers 1995, 149-216. The Complementary Convex Structure in Global Optimization, Journal of Global Optimization, 2(1992), 21-40. The relief indicator method for constrained global optimization, (with P.T. Thach), Naval Research Logistics, 37(1990)473-497. Strongly Polynomial Algorithm for a Concave Production-Transportation Problem With a Fixed Number of Nonlinear Variables. (with S. Ghannadan, A. Migdalas and P. Varbrand), Mathematical Programming 72(1996), 229-258. A General D.C. Approach to Location Problems, in `State of the Art in Global Optimization: Computational Methods and Applications', C. Floudas and P. Pardalos eds, Kluwer 413-432 (1996) Convexity and Monotonicity in Global Optimization, in 'Advances in Convex Analysis and Optimization', N. Hadjisavvas and P.M. Pardalos eds, Kluwer 2001, 569-594. Monotonic Optimization: Problems and Solution Approaches, 'SIAM Journal on Optimization', Vol. 11, No. 2 (2000), 464-494.
6. Please describe your major contributions in optimization
General minimax theorem, Inconsistency conditions for convex and non-convex inequalities Deterministic Global optimization: theoretical foundations, basic methods, basic algorithms of concave programming, D.C. programming, in particular: optimality criteria, concavity cuts, polyhedral annexation, duality, branch and bound, outer and inner approximation, decomposition Monotonic and D.M. (difference of monotonic) optimization General D.C. optimization approach to location and distance geometry problems
7. Names of your Ph.D. Students (and the titles of the theses, the place and year of defense if you memorize them)
N.Q. Thai D.V. Luu N.X. Tan N.V. Thoai N.V. Thuong V.T. Ban L.D. Muu P.T. Thach S. Ghannadan L.T. Luc ........
8. What are the most important recent developments in the optimization branch you are working on? Please specify the name of the branch
Applications of global optimization to various fields Monotonic and D.M. (difference of monotonic) optimization Discrete monotonic optimization.
9. What are the most interesting unsolved problem in the optimization branch you are working on?
Maximizing the product of pair wise distances between k points on the unit sphere in R^n. Although this problem can be reformulated as a D.C. optimization or as a D.M. optimization problem, its difficulty remains enormous.