People all over the world interested in Modeling and Optimization


  • Farid Alizadeh, Rutgers University. Combinatorial optimization, Numerical methods in optimization.
  • Brien Alkire, UCLA Electrical Engineering Department. Mathematical optimization, especially semidefinite programming, Applications of optimization to filter design and signal processing, Techniques of applied numerical linear algebra, Parallel computing, Applied probability, Applications in telecommunications.
  • Erling D. Andersen, MOSEK APS. Linear and nonlinear programming, Interior point methods.
  • Knud D. Andersen, Apt: 213, 530 West Arlington Place, Chicago. Presolving in linear programming, Interior point methods.
  • Kurt M. Anstreicher, The University of Iowa, Iowa City, IA 52242-1000. Interior point methods for linear, nonlinear, and semidefinite programming, and in the application of continuous nonlinear relaxations to obtain bounds on integer nonlinear programming problems.
  • Mario Arioli, Rutherford Appleton Laboratory, round-off error analysis, parallel computing, sparse matrices, iterative and direct solvers for linear systems of equations, iterative solvers for non linear equations.
  • Hossein Arsham, University of Baltimore. Stochastic optimization.
  • Mordecai Avriel, Technion - Israel Institute of Technology. Optimal stowage of containers in container ships, Mathematical programming under uncertainty , Asset Allocation, Risk Management, Decision Support Systems


  • Egon Balas, Graduate School of Industrial Administration, Carnegie Mellon. Mathematical Programming, in particular integer programming, discrete and combinatorial optimization, graphs, networks, scheduling theory.
  • Viorel Barbu , "Alexandru Ioan Cuza" University, Iassy - Romania. Differential Equations, Optimization.
  • James C. Bean, University of Michigan. Genetic Algorithms.
  • John Beasley, Imperial College, London. Combinatorial Optimization, Data Envelope Analysis.
  • Aharon Ben-Tal, Technion - Israel Institute of Technology Technion City, Haifa, Israel. Convex analysis, nonsmooth optimization, Robust optimization, Algorithms for large-scale nonlinear programming, Optimal engineering design, Medical Imaging
  • Dimitri P. Bertsekas, Massachusetts Institute of Technology. Linear and nonlinear programming, Dynamic programming, Data communication networks, Parallel and distributed computation, Neural networks, Neuro-dynamic programming.
  • Dimitris Bertsimas, Sloan School of Management, MIT. Stochastic systems, Mathematical optimization.
  • Michael J. Best, University of Waterloo. Portfolio Optimization and Finance, Nonconvex Quadratic Minimization.
  • Lorenz T. Biegler, Carnegie Mellon. Optimization methods for process design, analysis, and control.
  • Louis J. Billera, Cornell University. Application of algebraic techniques to combinatorial problems.
  • Stephen C. Billups, University of Colorado at Denver. developing robust algorithms for solving complementarity problems, and several related problems including variational inequalities, nonsmooth systems of equations, and generalized equations.
  • John R. Birge, University of Michigan. Stochastic programming.
  • Robert E. Bixby, Rice University. Combinatorial Optimization, Matroid Theory, Large-Scale Linear Programming.
  • Robert G. Bland, Cornell University. Linear programming.
  • H. Georg Bock, University of Heidelberg. Boundary value problem methods for parameter estimation and optimal control, Interior point methods, Branch and cut algorithms. Algorithms and software for large scale mixed integer programming in industrial scheduling.
  • Brian Borchers, New Mexico Tech. Optimization and inverse problems. Interior point methods for linear and semidefinite programming and applications of these techniques to combinatorial optimization problems.
  • Stephen P. Boyd, Stanford University. Convex optimization, especially interior-point methods for engineering problems, Engineering applications of convex optimization.
  • Oleg P. Burdakov, Linköping University, Sweden. Constrained and unconstrained optimization, Nonlinear equations.
  • James V. Burke, University of Washington. Numerical Optimization.
  • Richard Byrd, University of Colorado, Boulder. Algorithms for constrained and unconstrained nonlinear optimization, nonlinear data fitting, global optimization in molecular chemistry, parallel computing, numerical linear algebra. Trust region methods for nonlinearly constrained optimization, Global optimization in molecular chemistry, Limited memory methods for large-scale optimization, Analysis of quasi-Newton methods.


  • Paul Calamai, University of Waterloo. Facility Location and Resource Allocation, Multidisciplinary Design Optimization and Decision Support Systems.
  • Tom Cavalier, The Pennsylvania State University. Mathematical Programming and Applied Optimization, Facility Location, Routing and Distribution Problems, Scheduling, Network Optimization.
  • Françoise Chaitin-Chatelin, CERFACS, 42, av. G. Coriolis, Toulouse, France. Qualitative Computing, Linear algebra.
  • Zhi-Long Chen, University of Pennsylvania. Combinatorial Optimization (computational complexity analysis, dynamic programming, integer programming, exact solution algorithms & heuristics), Large-Scale Optimization (column generation, Benders decomposition, Lagrangian relaxation), Optimization under Uncertainty (stochastic programming with recourse).
  • Paulina Chin, Wilfrid Laurier University, Waterloo, Ontario. Computational Techniques for Engineering Problems, Numerical Methods for Linear Algebra, Numerical Methods for Optimization, Iterative Linear Solvers, Interior-Point Algorithms.
  • John W. Chinneck,Carleton University. Algorithms and software to assist in the automated formulation and "debugging" of large mathematical programs of all types (linear, nonlinear, integer, mixed, multiple objective, etc.), Applied optimization, Practical methods for global or near-global optimization of complex systems characterized by ill-behaved nonlinear functions and numerous equality constraints, as is common in engineering models.
  • Vasek Chvátal, Rutgers, The State University of NJ. Analysis of algorithms, Combinatorial Optimization, Linear Programming.
  • Thomas F. Coleman, Cornell Theory Cente, Center for Applied Mathematics. Numerical algorithms for continuous optimization problems. Large-scale optimization. Image segmentation and computational finance.
  • Michele Conforti, University of Padova. Integer Programming, Combinatorial Optimization, Graph Theory, Design and Analysis of Combinatorial Algorithms, Polyhedra and Inequalities.
  • Constantin C. Corduneanu, University of Texas at Arlington. Volterra Operators.
  • Richard W. (Dick) Cottle, Stanford University. Complementarity theory, Linear programming, Quadratic programming, Nonlinear programming, Variational inequalities, Matrix theory.
  • Collette R. Coullard, Northwestern University. Mathematical Programming, Combinatorial Optimization, Network Modeling and Optimization, Polyhedral Theory, Matroid Theory.
  • Teodor Gabriel Crainic, Université du Québec à Montréal. Searching Algorithms.
  • Joseph (Joe) Culberson, University of Alberta. Genetic algorithms, and related topics.


  • George B. Dantzig
  • William C. Davidon, Haverford College, Nonlinear Optimization, locating maxima and minima of differentiable functions, Nonstandard Analysis, generalizing the intuitive notion of infinitesimals.
  • Stephan Dempe, Technische Universität Bergakademie Freiberg. Theory and Algorithms for Nondifferentiable Optimization and Discrete Programming Problems, Parametric Optimization, Bilevel and Multilevel Programming, Applications of Mathematical Programming.
  • John E. Dennis, Jr., Rice University. Nonlinear optimization.
  • David S. Dilworth, Systems Research, Ann Arbor, Michigan. Electronic and film holography, Coherent optics, Digital image processing, Advanced computing systems for R & D, Market, corporate, and organizational strategies.
  • Jack Dongarra, University of Tennessee. High-performance computing.
  • Sever S. Dragomir, Victoria University of Technology, Australia. Theory of Mathematical Inequalities.
  • Irinel Dragan,University of Texas at Arlington. Mathematical Game Theory, linear and nonlinear programming.
  • Iain Duff, Rutherford Appleton Laboratory. Sparse matrices.


  • Jonathan Eckstein, Rutgers University. Parallel algorithms for numerical optimization, and monotone-operator based methods for optimization and variational problems.
  • Olivier Epelly,3340, HEC-Geneva, Department of Management Studies, 40 Bld. du Pont d'Arve, CH-1211 Geneva 4, Switzerland Phone number: +41 22 705 88 32, Fax number: +41 22 781 41 00. Energy-Environmental-Economic Systems, Decision-making and optimization.
  • Yury G. Evtushenko, Computing Centre of the Russian Academy of Sciences, Vavilov str., 40, Moscow, 119991, GSP-1, Russia, Office Phone: (095)-135-24-89, E-mail:, Linear and Nonlinear Programming, Decision Spport Systems, Optimal Control, Optimization Techniques, Numerical Methods and Software for Solving Global Multycriterion Optimization Problems.


  • Leonid Faybusovich, Univ of Notre Dame, Notre Dame, IN. Dynamical systems, Control Theory, Optimization.
  • Rolf Felkel, Technische Universität Darmstadt, Fachbereich Mathematik, Schloßgartenstraße 7 , D-64289 Darmstadt Raum : 2d/351, Telefon : 06151/16-3284, E-Mail : Large-scale quadratic optimization (QP) , Nonlinear optimization (NLP)
  • Carlos Eduardo Ferreira, University of São Paulo. Combinatorial Optimization.
  • Michael C. Ferris, University of Wisconsin. Robust methods for solving large-scale variational inequality and nonlinear programming problems with applications to problems in economics and engineering, Parallel architectures for solving problems in nonlinear optimization, Graph partitioning techniques to determine underlying structure is being investigated as a tool for general purpose parallel optimization.
  • Matteo Fischetti, University of Padova. Combinatorial Optimization, Vehicle Routing and Scheduling Problems, Integer Programming, Graph Theory, Design and Analysis of Combinatorial Algorithms, Polyhedral Combinatorics.
  • Roger Fletcher , The University of Dundee. Optimization Methods, Theory and Applications, Numerical Linear Algebra .
  • Christodoulos A. Floudas, Princeton University. Discrete-continuous nonlinear optimization, local and global optimization, and computational chemistry and biology.
  • Fedor Fomin, St. Petersburg State University, Russia. Graph theory: theory, algorithmic and application issues.
  • Anders Forsgren, Royal Institute of Technology (KTH), Stockholm, Sweden. Nonlinear programming.
  • Robert Fourer, Northwestern University. Modeling languages, System for large-scale linear and nonlinear programming.
  • Carla De Francesco, University of Padova. Theoretical integer programming, Integrality of polyhedra, Interior point methods for linear programming.
  • Antonio Frangioni, Università di Pisa. Multicommodity Flows, NonDifferentiable Optimization.
  • Robert M. Freund, Sloan School of Management, M.I.T. Mathematical Programming and Nonlinear Optimization, Computational complexity of nonlinear optimization, Interior-point methods in mathematical programming, Linear programming, Fixed-point methods, Related mathematical systems, Applied Optimization in Management and Engineering.
  • Roland W. Freund, Bell Laboratories. Scientific computing, numerical linear algebra, large-scale optimization, and algorithms for circuit simulation.


  • Saul I. Gass, College of Business and Management, University of Maryland. Linear programming, large-scale systems, model validation and evaluation, game theory, multi-objective decision analysis, and the application of operations research methodologies.
  • David M. Gay, Bell Laboratories. AMPL modeling language or mathematical programming (optimization), Nonlinear optimization.
  • Arthur Geoffrion, The Anderson School, UCLA. Formal modeling. Structured modeling.
  • Alan George, Waterloo University, Ontario. Scientific computation generally, mainly in numerical linear algebra.
  • Laurent El Ghaoui , EECS Department, University of California at Berkeley . Decision-making under uncertainty, convex optimization, semidefinite programming.
  • Jean Charles Gilbert,ESTIME Team, INRIA Rocquencourt, Domaine de Voluceau, BP 105, 78153 Le Chesnay Cedex, France. Optimization (theory and algorithms), computational differentiation, optimal control of PDEs, application of optimization.
  • Philip E. Gill, University of California, San Diego. Linear programming, nonlinear programming, sparse matrix methods, interior methods. Design and implementation of algorithms for unconstrained optimization, constrained optimization and nonlinear least squares.
  • Fred Glover, University of Colorado. Applications of computers to the fields of optimization, decision support, industrial planning, financial analysis, systems design, multicriteria analysis, applied artificial intelligence, energy, natural resources planning, logistics, transportation, large scale allocation models.
  • Donald Goldfarb, Columbia University in the City of New York. Algorithms for linear, quadratic, and nonlinear programming, Network flows, Large sparse systems, Telecommunications applications.
  • Meredith Goldsmith, Terman Engineering Center, Stanford. Optimization (linear/nonlinear/combinatorial), Mathematical modeling.
  • Gene H. Golub, Stanford University. Numerical analysis, Mathematical programming, and Statistical computing. Algorithms for solving linear systems with special structure, computes eigenvalues of sequences of matrices, and estimates functions of matrices.
  • Jacek Gondzio, The University of Edinburgh, Scotland, UK. Large scale optimization, Sparse matrix methods in optimization.
  • Vipin Gopal, Principal Research Scientist Honeywell Technology Center . Chemical Engineering Design, Synthesis, Optimization and Control.
  • Nick Gould, Rutherford Appleton Laboratory. Large-scale nonlinear constrained optimization, Sparse matrices.
  • Harvey J. Greenberg, University of Colorado at Denver. Optimization, Modeling, Artificial intelligence.
  • Andreas Griewank, Humboldt-Universität zu Berlin, Germany, Institut für Mathematik. Nonlinear Optimization Algorithmic/Automatic Differentiation.
  • Ignacio Grossmann, Center for Advanced Process Decision-Making, Department of Chemical Engineering, Carnegie Mellon University. Development of discrete-continuous optimization models and methods for problems in process systems engineering.
  • Monique Guignard-Spielberg , The Wharton School, University of Pennsylvania, Philadelphia. Theoretical as well as algorithmic, modeling and application aspects of integer programmming/combinatorial optimization. Integration of tools from Lagrangean relaxation and its extensions, and column/cut generation.
  • Osman Güler, University of Maryland Baltimore County. Mathematical programming, operations research, convex analysis, and complexity.


  • William W. Hager, University of Florida. Numerical Analysis, Optimization, Optimal control.
  • Peter Hammer
  • Matthias Heinkenschloss, Rice University. Optimization, Optimal Control, Numerical Analysis, Partial Differential Equations.
  • Richard V. Helgason, Southern Methodist University, Computer Science and Engineering. Optimizations, Network Flow, Computational Geometry.
  • Christoph Helmberg, Konrad-Zuse-Zentrum für Informationstechnik Berlin. Semidefinite Programming and its application to combinatorial optimization.
  • Mika Hirvensalo, Turku Centre for Computer Science. Quantum computation , Coding theory, Algebraic number theory, Alternative quantum computation, ALTAVISTA , Building quantum computers
  • Allen Holder, Interior point methods, Linear optimization, Post optimal and sensitivity analysis, Goal and multiple criteria optimization, Applications to radiation oncology.
  • Kenneth Holmström, Mälardalen University, Västerås, Sweden. Mathematical modeling and optimization, Algorithms and software for chemical equilibrium analysis, Nonlinear parameter estimation, Nonlinear least squares, Approximation problems, Optimization problems in control theory, System identification, Practical Methods for Mixed Integer Nonlinear Programming (MINLP).
  • John Hooker, Carnegie Mellon University. Logical Inference and Optimization, Empirical Analysis.



  • Florian Jarre , University of Notre Dame. Continuous Optimization and Applications, in particular Interior-Point Methods, Numerical Linear Algebra.


  • Christian Kanzow, Universität Hamburg. Optimization, complementarity and variational inequality problems.
  • R. Baker Kearfott, University of Louisiana at Lafayette, Louisiana. Nonlinear equations and global optimization, Programming language standardization.
  • Andy Keane, School of Engineering Sciences at Southampton University. Evolutionary Optimization, Structural Dynamics.
  • C. T. (Tim) Kelley, North Carolina State University. Linear/nonlinear equations, multilevel methods for integral equations , radiative transfer problems, and optimal control , large scale optimization , optimization of noisy functions , and flow in porous media .
  • Jeffery L. Kennington, Southern Methodist University, Computer Science and Engineering. Design and analysis of algorithms for network optimization.
  • Leonid Khachiyan
  • Masakazu Kojima, Tokyo Institute of Technology. Semidefinite Programming, Interior-Point Method, Linear Programming, Nonlinear Programming, Combinatorial Optimization.
  • Kartik Krishnan, Rensselaer Polytechnic Institute. Mathematical Programming , especially Semidefinite Programming , Combinatorial Optimisation, Interior Point Methods and Graph Algorithms.
  • Alexei V. Kuntsevich , Karl-Franzens Universität Graz, Institut für Mathematik. Practical tools for local and global (nonsmooth) optimization, transportation problems on networks, multicommodity network traffic problems, large-scale optimal planning problems, robust and adaptive control under non-stochastic uncertainty, system modeling and set-membership parameter identification under uncontrolled bounded disturbances.


  • Leon Lasdon, The University of Texas at Austin, Management Science, Optimization, Financial Optimization.
  • Adam B. Levy , Bowdoin College, Brunswick, Maine. Applied Mathematics, Optimization, Variational Analysis, Control Theory.
  • Adrian Lewis, University of Waterloo. Convex and nonsmooth optimization and analysis.
  • Sven Leyffer, The University of Dundee. Large Scale Nonlinear Programming, Mixed Integer Nonlinear Programming, Test Problems for Mixed Integer Nonlinear Programming , Branch--and--bound for Mixed Integer Quadratic Programming.
  • Thomas M. Liebling , EPFL-DMA, CH-1015 Lausanne (Switzerland), Combinatorial optimization, Operations research, Simulation, Stock management.
  • Chih-Jen Lin, National Taiwan University. Large-scale Nonlinear Optimization, Numerical Optimization Software, Internet-based Numerical Software, Support vector machines for pattern recognition.
  • Per Lindström, Umeå University, Sweden. Numerical analysis, Nonlinear least squares.
  • Andreas M. Löbel, Konrad-Zuse-Zentrum für Informationstechnik Berlin (ZIB). Optimizing systems in public mass transit, Linear and integer programming , Network and multicommodity flows, Combinatorial optimization, Large-scale optimization.
  • David Luenberger, Stanford University. Control Theory, General Optimization, Mathematical Programming, Microeconomics, Investment Science.
  • Ladislav Luksan, Academy of Sciences of the Czech Republic. Nonlinear Optimization and Approximation. Nonsmooth Analysis. Numerical linear algebra. Sparse iterative solvers.
  • Irvin Lustig, ILOG CPLEX Division. Linear programming, Interior point methods.


  • Kaj Madesen, Technical University of Denmark. Nonlinear optimization, interval analysis, parallel computing.
  • Olvi L. Mangasarian, University of Wisconsin. Optimization theory.
  • Marek Makowski, IIASA, Schlossplatz 1, A-2361 Laxenburg, Austria. Methodology of Decision Analysis.
  • Tom Manteuffel, University of Colorado at Boulder. Iterative methods for solving large sparse linear systems, multigrid methods for solving partial differential equations and numerical solution of mathematical models of the transport of neutral and charged particles.
  • Ernesto Martins, Universidade de Coimbra. Network Optimization.
  • Tomomi Matsui, University of Tokyo. Combinatorial optimization.
  • Bruce McCarl, Texas A&M University. Climate Change Mitigation, Climate Change Effects, El Nino, Water, Mathematical Programming.
  • Thomas McCormick, The University of British Columbia. Applied combinatorial optimization, analysis of algorithms, flows in networks, scheduling, routing.
  • Kurt Mehlhorn, Max-Planck-Institut für Informatik, Algorithms and Complexity Group (AG1), Stuhlsatzenhausweg 85, 66123 Saarbrücken, Germany. Data structures, Graph algorithms, Computational geometry, Algorithm Engineering, Software libraries, LEDA, CGAL , LEDA-SM, Computational complexity .
  • Juan Meza, Sandia National Laboratories. Parallel Optimization, Object-oriented programming, Optimization in Statistics, Molecular Conformation.
  • John E. Mitchell, Rensselaer Polytechnic Institute. Integer Programming, Nonlinear Programming, Interior Point.
  • Gautam Mitra, Brunel University, London. Development of Large Scale Linear and Discrete Optimization Systems for high performance computers.
  • Hans D. Mittelmann, Arizona State University. Scientific Computing with emphasis on partial differential equations, optimization and parallel computing. Finite element methods, flow problems, stability, capillarity phenomena, multisplitting methods, bifurcation problems.
  • Shinji Mizuno, Tokyo Institute of Technology. Linear programming, Interior point methods.
  • Renato D. C. Monteiro, Georgia Institute of Technology. Mathematical Programming Algorithms: Linear, Nonlinear Optimization, Interior Point Algorithms.
  • Jorge Moré, Argonne National Laboratory, Algorithms and software for large-scale optimization.
  • Pablo Moscato, Universidade Estadual de Campinas, Brazil. Optimization, Combinatorial Optimization, Approximation algorithms, Heuristic and Metaheuristic approaches for large scale problems, Simulated Annealing, Tabu Search, Genetic Algoritms and Memetic Algorithms.
  • Masakazu Muramatsu, Department of Mechanical Engineering, Sophia University, Chiyoda-ku, Tokyo 102-8554 Japan. Interior point method for linear programming. Interior point method for nonlinear programming and semidefinite programming, Simplex Method, Network Simplex Method, Numerical analysis.
  • Frederic Holmes Murphy, Modeling, Decision support systems
  • Walter Murray, Stanford University. The design and analysis of algorithms for linear and nonlinear optimization and sparse linear equations.


  • Stephen Nash, George Mason University. Nonlinear Programming.
  • John Lawrence (Larry) Nazareth, Professor Emeritus, Washington State University and Affiliate Professor, University of Washington . Nonlinear optimization.
  • Ionel Michael Navon, Florida State University. Finite Element Research, Variational 4-D Data-Assimilation Methods, Large-Scale Minimization, Domain Decomposition Methods.
  • Arkadi Nemirovski, Faculty of Industrial Engineering at Technion. Convex Programming, with emphasis on investigating complexity and on design of theoretically optimal algorithms.
  • George L. Nemhauser, School of Industrial and Systems Engineering , Georgia Institute of Technology. Operations Research, Combinatorial Optimization .
  • Arnold Neumaier, Universität Wien. Global Optimization, Numerical Analysis, Statistics, Combinatorics.
  • Jorge Nocedal, Northwestern University. Unconstrained and bound constrained optimization.


  • Dianne P. O'Leary, University of Maryland at College Park. Computational linear algebra, Optimization, Scientific computing, Parallel numeric algorithms.
  • Dominique Orban, CERFACS, Parallel Algorithms Project, Toulouse, France. Optimization and systems of nonlinear equations.
  • James B. Orlin, MIT Operations Research Center. Network and combinatorial optimization.
  • Michael L. Overton, New York University. Numerical algorithms, their analysis, and related issues, primarily in the areas of optimization and linear algebra. Analysis of eigenvalues, which arise in many different areas of applied mathematics. Semidefinite programming.
  • Jonathan H. Owen, Northwestern University. General Mixed-Integer Linear Programming, Graphical Implementation Development Environment for Networks.


  • Todd Plantenga, Sandia National Laboratories. Large-scale constrained optimization, Optimal Control, Radiation Modeling, Computational Chemistry.
  • Florian A. Potra, University of of Maryland, Baltimore County. Numerical Optimization. Numerical solution of nonlinear differential and integral equations. Applied functional analysis. Numerical algorithms for parallel computers.
  • Mike Powell, University of Cambridge. Numerical optimization.
  • Abraham P Punnen, University of New Brunswick - Saint John. Combinatorial Optimization, Integer Programming, Network Flows, Routing and Scheduling, Approximation Algorithms, Tabu Search, Genetic Algorithms, Implementation and Testing of Algorithms.


  • John Reid, Rutherford Appleton Laboratory, Oxfordshire, UK. Sparse matrix technology, Fortran 90.
  • James Renegar, Cornell University. Development of mathematical frameworks for studying optimization algorithms that have roots in analysis.
  • Mauricio G. C. Resende, AT&T Labs Research. Combinatorial optimization, design and analysis of computer algorithms, graph theory, interior point methods, mathematical programming, meta-heuristics, network flows, network design, operations research modeling, parallel computing in mathematical programming, scientific computing, and software design and development.
  • Tyrrell Rockafellar,University of Washington, Department of Applied Mathematics, Seattle. Development of optimization methodology for modeling large-scale problems... .
  • Joseph V. Romanovsky, Smirnov Research Institute. Mathematical programming, dynamic programming.


  • Romesh Saigal, University of Michigan. Interior Point Methods for Linear and Convex Programming. Kalman Filtering and Stochastic Programming. Continuous Optimization. Large Scale Optimization and efficient implementations. Applications of Game Theory to Accounting. Complementarity and Fixed Point Computing.
  • Mehmet Polat Saka, Matrix Analysis of Structures, Nonlinear Analysis of Structures, Plastic Design of Structures, Advanced Steel Design, Advanced Mechanics of Materials, Optimization Techniques, Structural Stability, Advanced Numerical Methods in Engineering.
  • Michael Saunders, Stanford University. Linear programming, nonlinear programming, sparse matrix methods, iterative solvers. Design and implementation of algorithms for constrained optimization and sparse linear equations (including sparse least squares).
  • Klaus Schittkowski, Universität Bayreuth, Germany . Nonlinear programming.
  • Tamar Schlick, New York University. Unconstrained optimization.
  • Bobby Schnabel, University of Colorado at Boulder. Numerical computation including numerical solution of unconstrained and constrained optimization problems, solution of systems of nonlinear equations, and nonlinear least squares; Parallel and distributed computation including parallel numerical languages and tools, and parallel algorithms; Applications of optimization to molecular chemistry.
  • Volker Schulz , Weierstrass Institute for Applied Analysis and Stochastics, Berlin. Nonlinear Optimization and Inverse Problems.
  • Yaroslav D. Sergeyev, Global optimization, parallel computing, space filling curves, interval analysis, data mining, software for high and secondary school.
  • David Shanno, Rutgers University. Linear and nonlinear programming. Interior point methods.
  • Alexander Shapiro, School of Industrial and Systems Engineering, Georgia Institute of Technology. Stochastic programming, simulation based optimization, nondifferentiable optimization and nonsmooth analysis, sensitivity analysis and optimization of queueing networks, sensitvity analysis of nonlinear programs, multivariate statistical analylsis.
  • William F. Sharpe, Graduate School of Business, Stanford University. Portfolio Theory and Capital Markets, Fundamentals of Investments. Nobelist 1990 - Economic Sciences.
  • Ariela Sofer, George Mason University. Mmathematical programming, numerical optimization, Applications in medical imaging.
  • Steve Smale, University of California, Berkeley. Simplex method. Probabilistic analysis.
  • Moshe Sniedovich, Department of Mathematics and Statistics, The University of Melbourne Parkville, VIC, Australia. Sequential decision making in general and dynamic programming in particular, Non linear optimization via composite linearization, Interactive computing and modelling, Constraint programming.
  • Peter Spellucci, Technical University Darmastadt, Germany. Numerical approximation; numerical linear algebra; Numerical solution of ordinary differential equations; Numerical (continuous) optimization.
  • Georgios E. Stavroulakis, Technical University of Crete, Department of Production Engineering and Management, GR-73100 Chania, Greece. Modeling and Optimization, Mechanics.
  • Jos F. Sturm, Maastricht University. Interior point, Semidefinite Programming.


  • Richard Tapia, Rice University. Numerical Analysis of Computer Algorithms for Optimization Theory.
  • Éva Tardos, Cornell University. Design and analysis of algorithms for fundamental problems in network, combinatorial optimization, approximation algorithms, on-line algorithms, linear and integer programming, and their applications to various problems.
  • André L. Tits, University of Maryland, College Park. Numerical optimization, optimization-based system design and robust control with emphasis on numerical methods.
  • Michael J. Todd, Cornell University. Interior-point methods, algorithms for linear and convex programming, particularly semidefinite programming.
  • Philippe Toint, University of Namur (FUNDP). Smooth nonlinear optimization, with an emphasis on the algorithmic viewpoint, ranging from convergence theory to numerical considerations and software development.
  • Michael Trick, Carnegie Mellon University. Computational Combinatorial Optimization.
  • Virginia Torczon, College of William & Mary , Department of Computer Science , P.O. Box 8795, Williamsburg, VA 23187-8795. Nonlinear programming, multidisciplinary design optimization, parallel and distributed computing, and computational science.
  • Leslie E. Trotter, Jr., Cornell University. Linear and integer programming analysis.
  • Paul Tseng, University of Washington. Continuous optimization, with side interests in discrete optimization, parallel optimization, network and graph algorithms.
  • John N. Tsitsiklis, Massachusetts Institute of Technology. Optimization, control, and system identification, Parallel and distributed computation, Computational complexity in systems and control, Neuro-Dynamic Programming.
  • Levent Tunçel, University of Waterloo. Mathematical programming and mathematics of operations research.
  • Reha Tütüncü, Cornell University. Optimization focusing on the development, analysis, and implementation of interior-point methods for the solution of linear and semidefinite programming problems.



  • Lieven Vandenberghe , UCLA Electrical Engineering Department. Convex optimization in engineering, Interior-point algorithms, Semidefinite programming, linear matrix inequalities in systems and control, Applications of optimization in VLSI design.
  • Robert Vanderbei, Princeton University, Princeton, NJ 08544, (609) 258-0876, E-mail: Linear programming, nonlinear programming, interior point methods.
  • Stephen A. Vavasis, Cornell University. Numerical optimization and complexity issues, Numerical methods for boundary value problems, Geometric problems arising in scientific computing, Sparse matrix computations.
  • Ismael Vaz, Departamento de Produção e Sistemas, Escola de Engenharia, Universidade do Minho, Campus de Gualtar, 4710 Braga, Portugal. Nonlinear Programming; Semi-infinite Programming.
  • Jean-Philippe Vial , University of Geneva. Non-smooth optimization, Operations Research Models.


  • Andreas Wächter, Development of a (quasi-Newton) Interior-Point algorithm for large-scale nonlinear nonconvex optimization. Applications in Chemical Engineering include process optimization, dynamic optimization of differential-algebraic systems, and parameter estimation.
  • Martin Wechs, The analytical behavior of central paths in the context of interior-point methods. Efficient solving methods for large scale linear programming and complementarity problems.
  • Paul Williams, University of Southampton, United Kingdom. Mathematical Programming Modelling, Logical Linear Programming, Integer Programming.
  • David P. Williamson, IBM T.J. Watson Research Labs. Combinatorial optimization, Theoretical computer science and mathematical programming.
  • Henry Wolkowicz, University of Waterloo. Combinatorial Optimization, Linear Programming, Matrix Completion Problems, Nonlinear Programming.
  • Margaret H. Wright, Bell Laboratories. Nonlinear optimization.
  • Steve Wright, Argonne National Laboratory. Interior-point methods.



  • Yinyu Ye, The University of Iowa. Mathematical Programming, Optimization Algorithm Design and Analysis, Computational Complexity, Operations Research and Its Applications.


  • Stavros A. Zenios, University of Cyprus. Financial Applications, Parallel computation.
  • Jun Zhang, Department of Computer Science, University of Kentucky. Scientific and parallel computing; Numerical simulations of physical processes; Computational Sciences; Applied Numerical Algorithms; Knowledge discovery and data mining in scientific computing.
  • Yin Zhang, Rice University. Interior-point methods: Integrating theory and practice, Linear, Nonlinear and Semidefinite programming, Optimization Problems in Computational Biology, Optimization Software development.
  • Uwe T. Zimmermann, Technische Universität Braunschweig. Train Schedule Optimization in Public Transportation, Optimal Scheduling of Switching Engines at Industrial Freight Railroads
  • Jochem Zowe, Universität Erlangen-Nürnberg, Germany. Optimization and Operations Research, Nonsmooth Optimization, Applications (engineering).