#### DMCA

## Benchmarking Optimization Software with Performance Profiles (2001)

Citations: | 386 - 8 self |

### Citations

1159 | Accuracy and Stability of Numerical Algorithms. - Higham - 2002 |

483 |
AMPL: A Modeling Language for
- Fourer, Gay, et al.
- 2003
(Show Context)
Citation Context ...ta The timing data used to compute the performance proles in Sections 4 and 5 is generated with the COPS test set, which currently consists of seventeen dierent applications, all models in the AMPL =-=[9]-=- modeling language. The choice of the test problem set P is always a source of disagreement because there is no consensus on how to choose problems. The COPS problems are selected to be interesting an... |

199 | An interior point algorithm for nonconvex nonlinear programming
- Vanderbei, Shanno
- 1999
(Show Context)
Citation Context ...re improvements. Although Mittelmann's eorts have gained the most notice, other researchers have been concerned with the evaluation and performance of optimization codes. As recent examples, we cite =-=[1, 2, 3, 4, 6, 12, 17]-=-. The interpretation and analysis of the data generated by the benchmarking process are the main technical issues addressed in this paper. Most benchmarking eorts involve tables displaying the perfor... |

117 | Interior-point methods for nonconvex nonlinear programming: jamming and comparative numerical testing
- Benson, Shano, et al.
- 2000
(Show Context)
Citation Context ...re improvements. Although Mittelmann's eorts have gained the most notice, other researchers have been concerned with the evaluation and performance of optimization codes. As recent examples, we cite =-=[1, 2, 3, 4, 6, 12, 17]-=-. The interpretation and analysis of the data generated by the benchmarking process are the main technical issues addressed in this paper. Most benchmarking eorts involve tables displaying the perfor... |

91 |
A Numerical study of the limited memory BFGS method and the truncated-Newton method for large-scale optimization,”
- Nash, Nocedal
- 1991
(Show Context)
Citation Context ...atics and Computer Science Division, Argonne National Laboratory, Argonne, Illinois 60439 (more@mcs.anl.gov). 1 To address the shortcomings of the previous approach, some researchers rank the solvers =-=[4, 6, 15, 17]-=-. In other words, they count the number of times that a solver comes in kth place, usually for k = 1; 2; 3. Ranking the solvers' performance for each problem helps prevent a minority of the problems f... |

87 |
MINOS 5.4 user’s guide.
- Murtagh, Saunders
- 1993
(Show Context)
Citation Context ...rements, Section 6 shows the performance of linear programming solvers. 5 4 Case Study: Optimal Control and Parameter Estimation Problems We now examine the performance proles of LANCELOT [5], MINOS =-=[14]-=-, SNOPT [10], and LOQO [16] on the subset of the optimal control and parameter estimation problems in the COPS [7] test set. Figures 4.1 and 4.2 show the performance proles in dierent ranges to re e... |

31 | LOQO user's manual (Version 3.10)”,
- Vanderbei
- 1999
(Show Context)
Citation Context ...e performance of linear programming solvers. 5 4 Case Study: Optimal Control and Parameter Estimation Problems We now examine the performance proles of LANCELOT [5], MINOS [14], SNOPT [10], and LOQO =-=[16]-=- on the subset of the optimal control and parameter estimation problems in the COPS [7] test set. Figures 4.1 and 4.2 show the performance proles in dierent ranges to re ect various areas of interes... |

22 | COPS: Large-scale nonlinearly constrained optimization problems,
- Bondarenko, Bortz, et al.
- 1999
(Show Context)
Citation Context ...re improvements. Although Mittelmann's eorts have gained the most notice, other researchers have been concerned with the evaluation and performance of optimization codes. As recent examples, we cite =-=[1, 2, 3, 4, 6, 12, 17]-=-. The interpretation and analysis of the data generated by the benchmarking process are the main technical issues addressed in this paper. Most benchmarking eorts involve tables displaying the perfor... |

19 |
Benchmarking optimization software with
- Dolan, Moré
(Show Context)
Citation Context ...e benchmark results of Sections 4 and 5. This analysis is necessary to understand the limitations of the benchmarking process. Sections 4 and 5 demonstrate the use of performance proles with results =-=[8]-=- obtained with version 2.0 of the COPS [7] test set. We show that performance proles eliminate the in uence of a small number of problems on the benchmarking process and the sensitivity of results as... |

14 | A comparison of algorithms for large-scale mixed complementarity problems - Billups, Dirkse, et al. - 1995 |

10 |
Snopt: An algorithm for large-scale constrained optimization
- Gill, Murray, et al.
(Show Context)
Citation Context ...tion 6 shows the performance of linear programming solvers. 5 4 Case Study: Optimal Control and Parameter Estimation Problems We now examine the performance proles of LANCELOT [5], MINOS [14], SNOPT =-=[10]-=-, and LOQO [16] on the subset of the optimal control and parameter estimation problems in the COPS [7] test set. Figures 4.1 and 4.2 show the performance proles in dierent ranges to re ect various a... |

9 | Benchmarking interior point LP/QP solvers
- Mittelmann
- 1998
(Show Context)
Citation Context |

7 | A numerical comparison between the LANCELOT and MINOS packages for large-scale nonlinear optimization: The complete results
- Bongartz, Conn, et al.
- 1997
(Show Context)
Citation Context |

3 |
experiments with the LANCELOT package (Release A) for large-scale nonlinear optimization
- Numerical
- 1996
(Show Context)
Citation Context |