I received my B.Sc. from
Queens University (Canada) in 1981 and
my Ph.D. from
Massachusetts Institute of Technology (U.S.A.) in 1986. After spending one year at the
University of British Columbia and three years at Massachusetts Institute of Technology, I came to the University of Washington in 1990.
My research area is mainly in continuous optimization, with side
interests in discrete optimization, distributed
computation, network and graph algorithms. My free-time interests include
drawing/painting, various sports, and traveling (preferrably by bicycle or kayak)
to anywhere in the world.
Here are photos from my
bicycling trips, 1986-2000 ,
kayaking trips, 2001
on the Danube and elsewhere,
kayaking trip, 2002 on the Mekong,
bicycling trip, 2003 along the Baltic shores,
backpacking trip, 2004 in Kenya,
kayaking trips, 2005 on the Nile, Red Sea, and Vancouver Island,
kayaking trips, 2006 on the Danube and Yellow River, China,
kayaking trips, 2008 on the Rio Madre de Dios, Peru, a headwater
tributary of the Amazon river.
Web Philosophy: Minimalism.
A Simplex method:
In a simplex method of Nelder-Mead type, a simplex is reflected with respect to a point on its boundary. The top figure shows the reflected simplex (drawn in red dashed line) when the point (the black dot) is the centroid of three vertices a, b, c. The middle figure shows the reflected simplex when the point is the centroid of two vertices a, b. The bottom figure shows the reflected simplex when the point is the vertex a.