This paper introduces a new approach to sequential quadratic programming. Upon application of the orthogonal-decomposition algorithm and the Gerschgorin Theorem for the stabilization of the Hessian matrix in the quadratic-programming solution, this novel approach offers an alternative to existing methods that, additionally, dispenses with a feasible initial guess.
A Sequential-Quadratic-Programming Algorithm Using Orthogonal Decomposition With Gerschgorin Stabilization
Contributed by the Mechanisms Committee for publication in the JOURNAL OF MECHANICAL DESIGN. Manuscript received Jun. 1999. Associate Editor: G. S. Chirikjian.
- Views Icon Views
- Share Icon Share
- Cite Icon Cite
- Search Site
Teng, C., and Angeles, J. (June 1, 1999). "A Sequential-Quadratic-Programming Algorithm Using Orthogonal Decomposition With Gerschgorin Stabilization ." ASME. J. Mech. Des. December 2001; 123(4): 501–509. https://doi.org/10.1115/1.1416693
Download citation file:
- Ris (Zotero)
- Reference Manager