CONOPT – a large scale GRG code

CONOPT – a large scale GRG code

0.00 Avg rating0 Votes
Article ID: iaor19982455
Country: United States
Volume: 6
Issue: 2
Start Page Number: 207
End Page Number: 216
Publication Date: Mar 1994
Journal: ORSA Journal On Computing
Authors:
Abstract:

CONOPT is a generalized reduced-gradient (GRG) algorithm for solving large-scale nonlinear programs involving sparse nonlinear constraints. The paper will discuss strategic and tactical decisions in the development, upgrade, and maintenance of CONOPT over the last 8 years. A verbal and intuitive comparison of the GRG algorithm with the popular methods based on sequential linearized subproblems forms the basis for discussions of the implementation of critical components in a GRG code: basis factorizations, search directions, line-searches, and Newton iterations. The paper contains performance statistics for a range of models from different branches of engineering and economics of up to 4000 equations with comparative figures of MINOS version 5.3. Based on these statistics the paper concludes that GRG codes can be very competitive with other codes for large-scale nonlinear programming from both an efficiency and a reliability point of view. This is especially true for models with fairly nonlinear constraints, particularly when it is difficult to attain feasibility.

Reviews

Required fields are marked *. Your email address will not be published.