On the Resolution of Linearly Constrained Convex Minimization Problems
- 1 May 1994
- journal article
- Published by Society for Industrial & Applied Mathematics (SIAM) in SIAM Journal on Optimization
- Vol. 4 (2), 331-339
- https://doi.org/10.1137/0804018
Abstract
No abstract availableKeywords
This publication has 9 references indexed in Scilit:
- On the Maximization of a Concave Quadratic Function with Box ConstraintsSIAM Journal on Optimization, 1994
- A Globally Convergent Augmented Lagrangian Algorithm for Optimization with General Constraints and Simple BoundsSIAM Journal on Numerical Analysis, 1991
- On the Solution of Large Quadratic Programming Problems with Bound ConstraintsSIAM Journal on Optimization, 1991
- Bayesian reconstructions from emission tomography data using a modified EM algorithmIEEE Transactions on Medical Imaging, 1990
- Convergence of EM image reconstruction algorithms with Gibbs smoothingIEEE Transactions on Medical Imaging, 1990
- Algorithms for bound constrained quadratic programming problemsNumerische Mathematik, 1989
- A sparse sequential quadratic programming algorithmJournal of Optimization Theory and Applications, 1989
- Global Convergence of a Class of Trust Region Algorithms for Optimization with Simple BoundsSIAM Journal on Numerical Analysis, 1988
- Testing a class of methods for solving minimization problems with simple bounds on the variablesMathematics of Computation, 1988