Sven Leyffer

Numerical Analysis · SIAM Journal on Optimization · 2002–2014

A researcher in the Science corpus: 8 papers; trusts 10 researchers and is trusted by 43 researchers here, as inferred from the citation graph.

Subfields

• Numerical Analysis — 40 citations into it; #162 of 3,586 by trust here, #210 by citations
• Computer Networks and Communications — 28 citations into it
• Computational Theory and Mathematics — 25 citations into it; #612 of 12,182 by trust here, #1,409 by citations
• Control and Systems Engineering — 22 citations into it; #363 of 8,257 by trust here, #946 by citations

Whom Sven Leyffer trusts overall

Their strongest outbound trust, strongest first, inferred from their citations.

1. Roger Fletcher
2. Mihai Anitescu
3. Philip E. Gill
4. Walter Murray
5. Stefan Scholtes
6. Philippe L. Toint
7. Michael A. Saunders
8. D. Ralph
9. Ignacio E. Grossmann
10. S. Burer

Who trusts Sven Leyffer overall

1. Andreas Wächter
2. Lorenz T. Biegler
3. Mark A. Abramson
4. Charles Audet
5. Roger Fletcher
6. N. Gould
7. Joel A. E. Andersson
8. Ya-Xiang Yuan
9. Philip E. Gill
10. Rabih A. Jabr

Papers from Sven Leyffer's perspective

Ordered by how strongly the researchers Sven Leyffer trusts endorse each paper. Same corpus, a different order for every researcher.

1. SNOPT: An SQP Algorithm for Large-Scale Constrained Optimization (SIAM Journal on Optimization)
2. Some NP-complete problems in quadratic and nonlinear programming
3. Practical Methods of Optimization: Fletcher/Practical Methods of Optimization
4. Convergence Properties of a Regularization Scheme for Mathematical Programs with Complementarity Constraints (SIAM Journal on Optimization)
5. On Solving Mathematical Programs With Complementarity Constraints As Nonlinear Programs
6. On the Global Convergence of a Filter--SQP Algorithm (SIAM Journal on Optimization)
7. Benchmarking optimization software with performance profiles
8. Global optimization of mixed-integer nonlinear programs: A theoretical and computational study (Mathematical programming)
9. Branching rules revisited
10. Branching and bounds tighteningtechniques for non-convex MINLP (Optim. Methods Softw.)

Their papers

• Nonlinear programming without a penalty function (2002) — 967 citations
• Global Convergence of a Trust-Region SQP-Filter Algorithm for General Nonlinear Programming (2002) — 304 citations
• Local Convergence of SQP Methods for Mathematical Programs with Equilibrium Constraints (2006) — 299 citations
• Mixed-integer nonlinear optimization*† (2013) — 764 citations
• Addressing failures in exascale computing (2014) — 479 citations
• SIAM Journal on Optimization (2012) — 143 citations
• Complementarity constraints as nonlinear equations: Theory and numerical experience (2006) — 72 citations
• On the Global Convergence of a Filter--SQP Algorithm (2002) — 349 citations