LSSOL is a set of Fortran 77 subroutines for linearly constrained least-squares and convex quadratic programming. It uses a two-phase active-set method. Two main features are its exploitation of convexity and treatment of singularity. LSSOL may also be used for linear programming, and to find a feasible point with respect to a set of linear inequality constraints. LSSOL treats all matrices as dense, and is not intended for large sparse problems.

References in zbMATH (referenced in 17 articles )

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

  1. Royset, J. O.; Pee, E. Y.: Rate of convergence analysis of discretization and smoothing algorithms for semiinfinite minimax problems (2012)
  2. Pee, E. Y.; Royset, J. O.: On solving large-scale finite minimax problems using exponential smoothing (2011)
  3. Gallardo, Luis A.; Meju, Max A.; Pérez-Flores, Marco A.: A quadratic programming approach for joint image reconstruction: mathematical and geophysical examples (2005)
  4. Melvin, R. G.; Huffman, W. P.; Young, D. P.; Johnson, F. T.; Hilmes, C. L.; Bieterman, M. B.: Recent progress in aerodynamic design optimization (1999)
  5. Madsen, Kaj; Nielsen, Hans Bruun; Pinar, Mustafa Çelebi: A finite continuation algorithm for bound constrained quadratic programming (1998)
  6. Pınar, Mustafa Ç.: Newton’s method for linear inequality systems (1998)
  7. Pinar, M. Ç.: Piecewise-linear pathways to the optimal solution set in linear programming (1997)
  8. Pinar, M. Ç.: Duality in robust linear regression using Huber’s (M)-estimator (1997)
  9. Hartmann, Wolfgang M.; Hartwig, Robert E.: Computing the Moore-Penrose inverse for the covariance matrix in constrained nonlinear estimation (1996)
  10. Madsen, Kaj; Nielsen, Hans Bruun; Pinar, Mustafa Ç.: A new finite continuation algorithm for linear programming (1996)
  11. Pinar, Mustafa Ç.: Linear programming via a quadratic penalty function (1996)
  12. Brännlund, Ulf: A descent method with relaxation type step (1994)
  13. Wiest, E. J.; Polak, E.: A generalized quadratic programming-based phase I--phase II method for inequality-constrained optimization (1992)
  14. Wiest, E. J.; Polak, E.: On the rate of convergence of two minimax algorithms (1991)
  15. Higgins, J. E.; Polak, E.: Minimizing pseudoconvex functions on convex compact sets (1990)
  16. Polak, E.; Wiest, E. J.: Variable-metric technique for the solution of affinely parametrized nondifferentiable optimal design problems (1990)
  17. Gill, Philip E.; Murray, Walter; Saunders, Michael A.; Wright, Margaret H.: A practical anti-cycling procedure for linearly constrained optimization (1989)