COPS
Benchmarking optimization software with COPS. We are continuing the development of COPS, a large-scale Constrained Optimization Problem Set. The primary purpose of this collection is to provide difficult test cases for optimization software. Problems in the current version of the collection come from fluid dynamics, population dynamics, optimal design, mesh smoothing, and optimal control. For each problem we provide a short description of the problem, notes on the formulation of the problem, and results of computational experiments with general optimization solvers. Each problem has been implemented in AMPL. The models from COPS 2.0 are also available in GAMS, courtesy of GAMS Development Corporation.
Keywords for this software
References in zbMATH (referenced in 33 articles )
Showing results 1 to 20 of 33.
Sorted by year (- Gill, Philip E.; Kungurtsev, Vyacheslav; Robinson, Daniel P.: A shifted primal-dual penalty-barrier method for nonlinear optimization (2020)
- Yuan, Gonglin; Li, Tingting; Hu, Wujie: A conjugate gradient algorithm for large-scale nonlinear equations and image restoration problems (2020)
- Pintér, János D.: How difficult is nonlinear optimization? A practical solver tuning approach, with illustrative results (2018)
- Armand, Paul; Omheni, Riadh: A mixed logarithmic barrier-augmented Lagrangian method for nonlinear optimization (2017)
- Beiranvand, Vahid; Hare, Warren; Lucet, Yves: Best practices for comparing optimization algorithms (2017)
- Dunning, Iain; Huchette, Joey; Lubin, Miles: JuMP: a modeling language for mathematical optimization (2017)
- Puranik, Yash; Sahinidis, Nikolaos V.: Bounds tightening based on optimality conditions for nonconvex box-constrained optimization (2017)
- Arreckx, Sylvain; Lambe, Andrew; Martins, Joaquim R. R. A.; Orban, Dominique: A matrix-free augmented Lagrangian algorithm with application to large-scale structural design optimization (2016)
- Janka, Dennis; Kirches, Christian; Sager, Sebastian; Wächter, Andreas: An SR1/BFGS SQP algorithm for nonconvex nonlinear programs with block-diagonal Hessian matrix (2016)
- Qiu, Songqiang; Chen, Zhongwen: A globally convergent penalty-free method for optimization with equality constraints and simple bounds (2016)
- Curtis, Frank E.; Jiang, Hao; Robinson, Daniel P.: An adaptive augmented Lagrangian method for large-scale constrained optimization (2015)
- Gill, Philip E.; Wong, Elizabeth: Methods for convex and general quadratic programming (2015)
- Armand, Paul; Benoist, Joël; Omheni, Riadh; Pateloup, Vincent: Study of a primal-dual algorithm for equality constrained minimization (2014)
- Bussieck, Michael R.; Dirkse, Steven P.; Vigerske, Stefan: PAVER 2.0: an open source environment for automated performance analysis of benchmarking data (2014)
- Domes, Ferenc; Fuchs, Martin; Schichl, Hermann; Neumaier, Arnold: The optimization test environment (2014)
- Jan Fiala, Michal Kocvara, Michael Stingl: PENLAB: A MATLAB solver for nonlinear semidefinite optimization (2013) arXiv
- Kirches, Christian; Leyffer, Sven: TACO: a toolkit for AMPL control optimization (2013)
- Pintér, János D.; Kampas, Frank J.: Benchmarking nonlinear optimization software in technical computing environments (2013)
- Wen, Zaiwen; Yin, Wotao: A feasible method for optimization with orthogonality constraints (2013)
- Gratton, Serge; Mouffe, Mélodie; Toint, Philippe L.: Stopping rules and backward error analysis for bound-constrained optimization (2011)