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 432 articles )

Showing results 401 to 420 of 432.
Sorted by year (citations)

previous 1 2 3 ... 19 20 21 22 next

  1. Tan, H. H.; Potts, R. B.: A discrete path/trajectory planner for robotic arms (1989)
  2. Bixby, Robert E.; Fourer, Robert: Finding embedded network rows in linear programs. I: Extraction heuristics (1988)
  3. Byrd, Richard H.; Schnabel, Robert B.; Shultz, Gerald A.: Parallel quasi-Newton methods for unconstrained optimization (1988)
  4. Dantzig, George B.; McAllister, Patrick H.; Stone, John C.: Formulating an objective for an economy (1988)
  5. Fang, S. C.; Peterson, E. L.; Rajasekera, J. R.: Controlled dual perturbations for posynomial programs (1988)
  6. Feijoo, B.; Meyer, R. R.: Piecewise-linear approximation methods for nonseparable convex optimization (1988)
  7. Gill, Philip E.; Murray, Walter; Saunders, Michael A.; Wright, Margaret H.: Recent developments in constrained optimization (1988)
  8. Goh, C. J.; Teo, K. L.: Control parametrization: a unified approach to optimal control problems with general constraints (1988)
  9. Nazareth, L.; Wets, R. J.-B.: Nonlinear programming techniques applied to stochastic programs with recourse (1988)
  10. Pardalos, P. M.: Linear complementarity problems solvable by integer programming (1988)
  11. Teo, K. L.; Goh, C. J.: On constrained optimization problems with nonsmooth cost functionals (1988)
  12. Fang, S. C.; Rajasekera, J. R.: A perturbation approach to the main duality theorem of quadratic geometric programming (1987)
  13. Gill, Philip E.; Murray, Walter; Saunders, Michael A.; Wright, Margaret H.: Maintaining LU factors of a general sparse matrix (1987)
  14. Jackson, Peter L.; Lynch, David F.: Revised Dantzig-Wolfe decomposition for staircase-structured linear programs (1987)
  15. Little, G. H.: An efficient computer program for the large deflection analysis of rectangular orthotropic plates (1987)
  16. Monma, Clyde L.; Morton, Andrew J.: Computational experience with a dual affine variant of Karmarkar’s method for linear programming (1987)
  17. Noël, Marie-Cécile; Smeers, Yves: Nested decomposition of multistage nonlinear programs with recourse (1987)
  18. Pardalos, P. M.; Glick, J. H.; Rosen, J. B.: Global minimization of indefinite quadratic problems (1987)
  19. Duran, Marco A.; Grossmann, Ignacio E.: An outer-approximation algorithm for a class of mixed-integer nonlinear programs (1986)
  20. Fang, S. C.; Rajasekera, J. R.: Controlled dual perturbations for (\ell_ p)-programming (1986)

previous 1 2 3 ... 19 20 21 22 next