Abstract
Projections appear in many areas of optimization. In linear programming we mention the interior gradient projection method of Pyle and Cline [299], [298] and the interior point method of Karmarkar. Papers [349], [328], [166], [211] on projections are related to the Karmarkar algorithm. In nonlinear programming the gradient projection methods and the convex feasibility problem are perhaps the most important applications of projections. Further typical applications can be found in papers [185], [238], [192], [77], [78], [313], [82], [99].
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 2004 Springer Science+Business Media New York
About this chapter
Cite this chapter
Galántai, A. (2004). Projection Methods in Optimization. In: Projectors and Projection Methods. Advances in Mathematics, vol 6. Springer, Boston, MA. https://doi.org/10.1007/978-1-4419-9180-5_6
Download citation
DOI: https://doi.org/10.1007/978-1-4419-9180-5_6
Publisher Name: Springer, Boston, MA
Print ISBN: 978-1-4613-4825-2
Online ISBN: 978-1-4419-9180-5
eBook Packages: Springer Book Archive