World's Best Scientists 2026 revealed!

D-Index & Metrics

Computer Science

D-Index
34
Citations
9586
World Ranking
11908
National Ranking
4857

Research.com Recognitions

  • 2009 - SIAM Fellow For contributions to large-scale nonlinear optimization.

Overview

Sven Leyffer is affiliated with Argonne National Laboratory in the United States. Their research primarily focuses on areas within computer science and engineering, with significant contributions across subfields such as artificial intelligence, computational theory and mathematics, numerical analysis, control and systems engineering, and atomic and molecular physics and optics.

Their published work spans a variety of main topics including advanced optimization algorithms research, probabilistic and robust engineering design, advanced multi-objective optimization algorithms, advanced control systems optimization, quantum computing algorithms and architecture, quantum information and cryptography, and risk and portfolio optimization.

Frequent collaborators in their research include Todd Munson, Jeffrey Larson, Paul Manns, Xinyu Fei, and Lucas T. Brady, with multiple publications co-authored with each.

Key venues where Sven Leyffer has published include:

  • arXiv (Cornell University)
  • Computational Optimization and Applications
  • INFORMS Journal on Computing
  • Mathematical Programming
  • SIAM Journal on Scientific Computing

Notable recent papers by Sven Leyffer include:

  • A survey of nonlinear robust optimization, 2020, INFOR Information Systems and Operational Research

Other influential recent papers relevant to their research include:

  • Minotaur: a mixed-integer nonlinear optimization toolkit, 2020, Mathematical Programming Computation
  • Apprentice for Event Generator Tuning, 2021, EPJ Web of Conferences
  • Practical algorithms for multivariate rational approximation, 2020, Computer Physics Communications
  • Modeling design and control problems involving neural network surrogates, 2022, Computational Optimization and Applications

In 2009, Sven Leyffer was recognized as a SIAM Fellow for contributions to large-scale nonlinear optimization.

Best Publications

  • Nonlinear programming without a penalty function

    Roger Fletcher;Sven Leyffer

  • Solving mixed integer nonlinear programs by outer approximation

    Roger Fletcher;Sven Leyffer

  • Mixed-integer nonlinear optimization

    Pietro Belotti;Christian Kirches;Sven Leyffer;Jeff T. Linderoth

  • Mixed Integer Nonlinear Programming

    Jon Lee;Sven Leyffer

  • On the Global Convergence of a Filter--SQP Algorithm

    Roger Fletcher;Sven Leyffer;Philippe L. Toint

  • Addressing failures in exascale computing

    Marc Snir;Robert W Wisniewski;Jacob A Abraham;Sarita V Adve

  • Global Convergence of a Trust-Region SQP-Filter Algorithm for General Nonlinear Programming

    Roger Fletcher;Nicholas I. M. Gould;Sven Leyffer;Philippe L. Toint

  • Local Convergence of SQP Methods for Mathematical Programs with Equilibrium Constraints

    Roger Fletcher;Sven Leyffer;Danny Ralph;Stefan Scholtes

  • Integrating SQP and Branch-and-Bound for Mixed Integer Nonlinear Programming

    Sven Leyffer

  • Numerical Experience with Lower Bounds for MIQP Branch-And-Bound

    Roger Fletcher;Sven Leyffer

  • Interior Methods for Mathematical Programs with Complementarity Constraints

    Sven Leyffer;Gabriel López-Calva;Jorge Nocedal

  • Solving mathematical programs with complementarity constraints as nonlinear programs

    Roger Fletcher;Sven Leyffer

  • Solving multi-leader-common-follower games

    Sven Leyffer;Todd Munson

  • DOE Advanced Scientific Computing Advisory Subcommittee (ASCAC) Report: Top Ten Exascale Research Challenges

    Robert Lucas;James Ang;Keren Bergman;Shekhar Borkar

  • FilMINT: An Outer Approximation-Based Solver for Convex Mixed-Integer Nonlinear Programs

    Kumar Abhishek;Sven Leyffer;Jeff Linderoth

  • A Multidimensional Filter Algorithm for Nonlinear Equations and Nonlinear Least-Squares

    Nicholas I. M. Gould;Sven Leyffer;Philippe L. Toint

  • Deterministic Methods for Mixed Integer Nonlinear Programming

    Sven Leyffer

  • Leader-Follower Equilibria for Electric Power and NO x Allowances Markets

    Yihsu Chen;Benjamin F. Hobbs;Sven Leyffer;Todd S. Munson

  • FilMINT: An Outer-Approximation-Based Solver for Nonlinear Mixed Integer Programs

    Kumar Abhishek;Sven Leyffer;Jeffrey T. Linderoth

  • A brief history of filter methods.

    R. Fletcher;S. Leyffer;P. Toint

  • Complementarity constraints as nonlinear equations: Theory and numerical experience

    Sven Leyffer

  • Global Convergence of Trust-Region SQP-Filter Algorithms for General Nonlinear Programming

    R Fletcher;N I M Gould;S Leyffer;PL Toint

  • SIAM Journal on Optimization

    C Audet;H H Bauschke;L T Biegler;P L Combettes

Frequent Co-Authors

Stefan M. Wild
Stefan M. Wild Lawrence Berkeley National Laboratory
Roger Fletcher
Roger Fletcher University of Dundee
Philippe L. Toint
Philippe L. Toint University of Namur
Nicholas I. M. Gould
Nicholas I. M. Gould University of Oxford
Mohan Krishnamoorthy
Mohan Krishnamoorthy University of Queensland
Z. Marshall
Z. Marshall Lawrence Berkeley National Laboratory
Marc Snir
Marc Snir University of Illinois at Urbana-Champaign
Jorge Nocedal
Jorge Nocedal Northwestern University
Robert Schreiber
Robert Schreiber Cerebras Systems
Paul W. Coteus
Paul W. Coteus IBM (United States)

If you think any of the details on this page are incorrect, let us know.

Report an issue

We appreciate your kind effort to assist us to improve this page, it would be helpful providing us with as much detail as possible in the text box below:

Related Online Degrees & Career Pathways

The landscape of online learning has made it easier than ever to pursue a Computer Science degree in the USA. Many students seek cheap online degrees fast, allowing them to save both time and money without sacrificing educational quality.

Flexibility is another major advantage. For those who may not have a perfect academic history, there are online schools that accept low gpa, making a degree in Computer Science more accessible than ever before.

Career opportunities are not limited to typical tech roles. With the right foundation, graduates can also explore interdisciplinary fields. For instance, those interested in sustainability can review jobs for environmental science majors, which often intersect with data analysis and software development.

For those eager to enter the workforce quickly, consider the fastest computer science degree options. These accelerated programs help students launch rewarding tech careers in less time.

Best Scientists Citing Sven Leyffer

Trending Scientists

Recently Published Articles