Part of the Nonconvex Optimization and Its Applications book series (NOIA, volume 56)
When a blind man hits a wall, what would he do? A popular method is to find a way along the wall. In this chapter, we use this idea to study linearly constrained optimization problems.
KeywordsTangent Plane Constrain Optimization Problem Feasible Point Active Constraint Gradient Projection
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
Unable to display preview. Download preview PDF.
© Springer Science+Business Media Dordrecht 2001