KNITRO

KNITRO is a solver for nonlinear optimization. It is the most powerful and versatile solver on the market, providing three state-of-the-art algorithms. The broad range of behaviors exhibited by nonlinear problems makes this an essential feature. KNITRO is designed for large problems with dimensions running into the hundred thousands. It is effective for solving linear, quadratic, and nonlinear smooth optimization problems, both convex and nonconvex. It is also effective for nonlinear regression, problems with complementarity constraints (MPCCs or MPECs), and mixed-integer programming (MIPs), particular convex mixed integer, nonlinear problems (MINLP). KNITRO is highly regarded for its robustness and efficiency. KNITRO provides a wide range of user options, and offers interfaces to C, C++, Fortran, Java, AMPL, AIMMS, GAMS, MPL, Mathematica, MATLAB Microsoft Excel, and LabVIEW. Continuing active development and support ensures that KNITRO will remain the leader in nonlinear optimization.


References in zbMATH (referenced in 127 articles , 1 standard article )

Showing results 1 to 20 of 127.
Sorted by year (citations)

1 2 3 ... 5 6 7 next

  1. Bonafini, M.: Convex relaxation and variational approximation of the Steiner problem: theory and numerics (2018)
  2. Jara-Moroni, Francisco; Pang, Jong-Shi; Wächter, Andreas: A study of the difference-of-convex approach for solving linear programs with complementarity constraints (2018)
  3. Putkaradze, Vakhtang; Rogers, Stuart: Constraint control of nonholonomic mechanical systems (2018)
  4. Akşin, Zeynep; Ata, Baris; Emadi, Seyed Morteza; Su, Che-Lin: Impact of delay announcements in call centers: an empirical approach (2017)
  5. Armand, Paul; Omheni, Riadh: A mixed logarithmic barrier-augmented Lagrangian method for nonlinear optimization (2017)
  6. Bongartz, Dominik; Mitsos, Alexander: Deterministic global optimization of process flowsheets in a reduced space using McCormick relaxations (2017)
  7. Hallac, David; Wong, Christopher; Diamond, Steven; Sharang, Abhijit; Sosič, Rok; Boyd, Stephen; Leskovec, Jure: SnapVX: a network-based convex optimization solver (2017)
  8. Huang, Kuo-Ling; Mehrotra, Sanjay: Solution of monotone complementarity and general convex programming problems using a modified potential reduction interior point method (2017)
  9. Liu, Changliu; Tomizuka, Masayoshi: Real time trajectory optimization for nonlinear robotic systems: relaxation and convexification (2017)
  10. Pčolka, Matej; Čelikovský, Sergej: Production-process optimization algorithm: application to fed-batch bioprocess (2017)
  11. Sinha, Ankur; Rämö, Janne; Malo, Pekka; Kallio, Markku; Tahvonen, Olli: Optimal management of naturally regenerating uneven-aged forests (2017)
  12. Sioshansi, Ramteen; Conejo, Antonio J.: Optimization in engineering. Models and algorithms (2017)
  13. Wan, Wei; Biegler, Lorenz T.: Structured regularization for barrier NLP solvers (2017)
  14. 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)
  15. Chrapary, Hagen; Ren, Yue: The software portal swMATH: a state of the art report and next steps (2016)
  16. Eggleston, Jonathan: An efficient decomposition of the expectation of the maximum for the multivariate normal and related distributions (2016)
  17. Lubin, Miles; Yamangil, Emre; Bent, Russell; Vielma, Juan Pablo: Extended formulations in mixed-integer convex programming (2016)
  18. Miles Lubin, Emre Yamangil, Russell Bent, Juan Pablo Vielma: Polyhedral approximation in mixed-integer convex optimization (2016) arXiv
  19. Rose, Daniel; Schmidt, Martin; Steinbach, Marc C.; Willert, Bernhard M.: Computational optimization of gas compressor stations: MINLP models versus continuous reformulations (2016)
  20. Schmidt, Martin; Steinbach, Marc C.; Willert, Bernhard M.: High detail stationary optimization models for gas networks: validation and results (2016)

1 2 3 ... 5 6 7 next