Global Optimization

Jean-Marc Alliot (genetic algorithms in air traffic control)
Mahyar Amouzegar (nonlinear bilevel programming)
Charles Audet (non-convex and bilevel programming)

Julio R. Banga (stochastic global optimization and optimal control)
George Bilchev (deterministic and stochastic global optimization)
Wilfried Bollweg (simulated annealing in crystallography)
Brian Borchers (mixed integer nonlinear programming; inverse problems in hydrology and geophysics)
Stephen P. Boyd (control system analysis and design)
Rainer E. Burkard (discrete optimization)
Richard Byrd (global optimization of molecular energy surfaces)

Yao-Jen Chang (satisfiability by continuation)
Leonid Churilov (composite concave programming)
Tibor Csendes (interval methods)

Rina Dechter (artificial intelligence, constraint satisfaction)
Rutvik Desai (genetic algorithms and simulated annealing)
Immo Diener (continuation methods)
Marco Dorigo (evolutionary optimization)
Michael Dorneich (layout and compaction of multichip modules)

Jonathan Eckstein (parallel branch and bound)
Maarten van Emden (logic constraint programming)
Tom Epperly (chemical engineering applications)
Betty Eskow (molecular conformation problems)

Chris Floudas (constrained global optimization; nonlinear mixed integer programming; process synthesis, design and control; computational chemistry)

Efim Galperin (global optimization in game theory)
Saied Ghannadan (global optimization of network flows)
Fred Glover (tabu search)
David Goldberg (genetic algorithms)
Eric Gourdin (bilinear and Lipschitz programming)
John Grefenstette (evolutionary computation, machine learning, computational biology)
Andreas Griewank (automatic differentiation)
Ignacio Grossmann (chemical engineering applications)
Jun Gu (satisfiability, VLSI circuit design, etc.)

Beidi Hamma (Global optimization of aircraft and spacecraft trajectories)
William E. Hart (genetic algorithms, protein folding)
André van der Hoek (global optimization of molecular potentials)
Reiner Horst (dc-methods)

Lester Ingber (simulated annealing)
Ronald Van Iwaarden (interval methods, automatic differentiation)

Stephen Jacobsen (reverse convex programming)
Jeff Joines (genetic algorithms)

David Karger (minimum cuts, etc.)
Stefan Karisch (nonlinear approaches to combinatorial optimization)
David E. Kaufman (random search)
Andy Keane Evolutionary Optimization
R. Baker Kearfott (interval methods for factorable constraints)
Olaf Knüppel (interval methods)
John Koza (genetic programming)

Anthony P. Leclerc (parallel interval methods)
Eva K. Lee (mixed integer programming)

Ernesto Martins (path and flow algorithms)
Anil Menon (replicators, majorization and genetic algorithms)
Zbigniew Michalewicz (evolutionary computation)
Melanie Mitchell (genetic algorithms)
Audris Mockus (stochastic global optimization)
Marcel Mongeau (chemical and phase equilibrium problems)
Jorge Moré (large-scale optimization, local and global)
Khosrow Moshirvaziri (bilevel and concave programming)
Pablo Moscato (memetic algorithms)
Sreerama K. Murthy (decision trees)

Prasanth Nair (evolutionary computation; structural system identification)
Jorge Nocedal (large-scale optimization)

Panos Pardalos (constrained global optimization)
Stefano De Pascale (constraint satisfaction, interval analysis)
Andy Phillips (protein folding)
Janos D. Pinter (continuos and Lipschitz global optimization; engineering and environmental applications)
Patrick Prosser (constraint satisfaction, scheduling)

Raychel Ramoldov (simulated annealing)
Dietmar Ratz (interval techniques)
Franz Rendl (nonlinear approaches to combinatorial optimization)
Mauricio Resende (network flow, quadratic assignment, GRASP)
Nicolas Roddier (global optimization via neural networks and D.C. programming)

Nikos Sahinidis (mixed integer nonlinear programming)
Martin Savelsbergh (mixed integer programming)
Dirk Schlierkamp-Voosen (genetic algorithms)
Bobby Schnabel (nonlinear equations; parallelization; applications in molecular chemistry)
Fabio Schoen (stochastic global optimization)
Hans-Paul Schwefel (evolutionary optimization)
Yaroslav Sergeyev (Lipschitz global optimization, engineering applications)
Gregory Seront (evolutionary optimization)
Rainer Storn (genetic algorithms)
Simon Streltsov (stochastic optimization)
Ray L. Sun (chemical system design)

Aimo Törn (stochastic clustering methods)

Sami Viitanen (stochastic optimization)

Michael Wolfe (interval methods)
Henry Wolkowicz (quadratic assignment; combinatorial optimization via semidefinite relaxation, etc.)
Zhijun Wu (distance geometry and molecular systems)

Zelda Zabinsky (stochastic global optimization)

Local Optimization

Farid Alizadeh (semidefinite programming)
Fernando L. Alvarado (power system optimization; sparse matrices)
Hossein Arsham (fractional and stochastic programming)

Arjan B. Berkelaar (semidefinite programming)

Stephan Dempe (nondifferentiable optimization; multilevel programming)

Leonid Faybusovich (interior-point algorithms and Euclidean Jordan algebras)
Roger Fletcher
Robert M. Freund (interior point methods)

Philip E. Gill
Harvey J. Greenberg (model formulation and analysis, artificial intelligence)

Bernhard Korte

Olvi L. Mangasarian
Shinji. Mizuno (interior point methods)
Renato Monteiro
Walter Murray (large-scale nonlinear programming)

Michael Overton (optimization of eigenvalues)

Florian Potra
Danny Ralph (nonsmooth optimization)

Michael Saunders
Klaus Schittkowski (nonlinear programming)
Peter Spellucci (large scale optimization)

Mike Todd (interior point methods)
Philippe Toint

Bob Vanderbei (interior point methods)
Steve Wright

Yinyu Ye (interior point methods)

Yin Zhang