MINOS is a large-scale optimization system, for the solution of sparse linear and nonlinear programs. The objective function and constraints may be linear or nonlinear, or a mixture of both. The nonlinear functions must be smooth. Stable numerical methods are employed throughout. Features include a new basis package (for maintaining sparse LU factors of the basis matrix), automatic scaling of linear contraints, and automatic estimation of some or all gradients. Upper and lower bounds on the variables are handled efficiently. File formats for constraint and basis data are compatible with the industry MPS format. The source code is suitable for machines with a Fortran 66 or 77 compiler and at least 500K bytes of storage. (Source: http://plato.asu.edu)

References in zbMATH (referenced in 404 articles )

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

1 2 3 ... 19 20 21 next

  1. Brás, Carmo; Eichfelder, Gabriele; Júdice, Joaquim: Copositivity tests based on the linear complementarity problem (2016)
  2. Qiu, Songqiang; Chen, Zhongwen: A globally convergent penalty-free method for optimization with equality constraints and simple bounds (2016)
  3. Bao, Xiaowei; Khajavirad, Aida; Sahinidis, Nikolaos V.; Tawarmalani, Mohit: Global optimization of nonconvex problems with multilinear intermediates (2015)
  4. Cai, Yongyang; Judd, Kenneth L.: Dynamic programming with Hermite approximation (2015)
  5. Goldberg, Noam; Leyffer, Sven: An active-set method for second-order conic-constrained quadratic programming (2015)
  6. Izmailov, A.F.; Solodov, M.V.: Newton-type methods: a broader view (2015)
  7. Izmailov, A.F.; Solodov, M.V.: Critical Lagrange multipliers: what we currently know about them, how they spoil our lives, and what we can do about it (2015)
  8. Janka, Dennis: Sequential quadratic programming with indefinite Hessian approximations for nonlinear optimum experimental design for parameter estimation in differential-algebraic equations (2015)
  9. Birgin, E.G.; Martínez, J.M.; Prudente, L.F.: Augmented Lagrangians with possible infeasibility and finite termination for global nonlinear programming (2014)
  10. Fernandes, Luís M.; Júdice, Joaquim J.; Sherali, Hanif D.; Forjaz, Maria A.: On an enumerative algorithm for solving eigenvalue complementarity problems (2014)
  11. Kadziński, Miłosz; Corrente, Salvatore; Greco, Salvatore; Słowiński, Roman: Preferential reducts and constructs in robust multiple criteria ranking and sorting (2014)
  12. Kleniati, Polyxeni-M.; Adjiman, Claire S.: Branch-and-sandwich: a deterministic global optimization algorithm for optimistic bilevel programming problems. Part II: Convergence analysis and numerical results (2014)
  13. Pan, Ping-Qi: Linear programming computation (2014)
  14. Zhu, Zhichuan; Yu, Bo; Yang, Li: Globally convergent homotopy method for designing piecewise linear deterministic contractual function (2014)
  15. Kirches, Christian; Leyffer, Sven: TACO: a toolkit for AMPL control optimization (2013)
  16. Palma-Benhke, Rodrigo; Philpott, Andy; Jofré, Alejandro; Cortés-Carmona, Marcelo: Modelling network constrained economic dispatch problems (2013)
  17. Van Dinter, Jennifer; Rebennack, Steffen; Kallrath, Josef; Denholm, Paul; Newman, Alexandra: The unit commitment model with concave emissions costs: a hybrid Benders’ decomposition with nonconvex master problems (2013)
  18. Bentobache, Mohand; Bibi, Mohand Ouamer: A two-phase support method for solving linear programs: numerical experiments (2012)
  19. Bonami, Pierre; Kilinç, Mustafa; Linderoth, Jeff: Algorithms and software for convex mixed integer nonlinear programs (2012)
  20. Brás, Carmo P.; Fukushima, Masao; Júdice, Joaquim J.; Rosa, Silvé’erio S.: Variational inequality formulation of the asymmetric eigenvalue complementarity problem and its solution by means of gap functions (2012)

1 2 3 ... 19 20 21 next