RESEARCH PAPERS: Design Automation Papers

Resolving Degeneracy in the Generalized Reduced Gradient Method

[+] Author and Article Information
G. A. Gabriele, T. J. Beltracchi

Department of Mechanical Engineering, Aeronautical Engineering and Mechanics, Rensselaer Polytechnic Institute, Troy, NY 12180

J. Mech., Trans., and Automation 109(2), 263-267 (Jun 01, 1987) (5 pages) doi:10.1115/1.3267449 History: Received July 09, 1986; Online November 19, 2009


The Generalized Reduced Gradient (GRG) method has proven to be one of the more robust and efficient algorithms currently available for solving nonlinear programming problems. The method divides the vector of design variables into two classes, nonbasic and basic variables, and employs the implicit function theorem to formulate a reduced, unconstrained problem in the nonbasic variables. In order to employ the implicit function theorem two assumptions are made: (1) The Jacobian matrix of the active constraints with respect to the basic variables is nonsingular; and (2) All basic variables are within their respective bounds. When the second condition is not satisfied then the current point is degenerate and further progress is not assured. Methods based on performing basis changes exist for resolving degeneracy. In this paper, we will describe a technique based on the method of feasible directions which has the advantage of requiring no basis changes to generate a new direction.

Copyright © 1987 by ASME
Your Session has timed out. Please sign back in to continue.






Some tools below are only available to our subscribers or users with an online account.

Related Content

Customize your page view by dragging and repositioning the boxes below.

Related Journal Articles
Related eBook Content
Topic Collections

Sorry! You do not have access to this content. For assistance or to subscribe, please contact us:

  • TELEPHONE: 1-800-843-2763 (Toll-free in the USA)
  • EMAIL: asmedigitalcollection@asme.org
Sign In