Back to results

Virginia Polytechnic Institute and State University

An active-constraint logic for nonlinear programming

Abstract

dc:description.abstract

The choice of active-constraint logic for screening inequalities has a major impact on the performance of gradient-projection method. It has been found that least-constrained strategies, which keep the number of constraints in the active set as small as possible, are computationally most efficient. However, these strategies are often prone to cycling of constraints between active and inactive status. This occurs mainly due to the violation of some of the constraints, taken as inactive, by the resulting step. This research develops methods for choosing an active set such that constraints in the active set satisfy the Kuhn-Tucker conditions and the resulting step does not violate the linear approximations to any of the constraints satisfied as equalities but considered inactive. Some of the existing active-constraint logics, specifically the dual-violator rule, yield the desired active set when two constraints are satisfied as equalities. However, when three or more constraints are satisfied as equalities, none of the existing logics give the desired active set. A number of general results, which help in the selection of the active set, have been developed in this research. An active-constraint logic has been developed for the case of three constraints. This logic gives the desired active-set. For the general case, when more than three constraints are satisfied as equalities, a separate active-set logic is suggested. This guarantees the nonviolation of the linear approximations to any of the constraints, taken as inactive, by the resulting step. The resulting active-set may not, however, satisfy the Kuhn-Tucker conditions. The efficiency of the proposed logic was tested computationally using quadratic programming problems. Three existing active-set strategies were used for comparision. The proposed logic almost always performed as well or better than the best among the three existing active-set strategies.

Degree

thesis:*
Name thesis:degree_name
Ph. D.
Level thesis:degree_level
doctoral
Discipline thesis:degree_discipline
Aerospace and Ocean Engineering
Department dc:contributor.department
Aerospace and Ocean Engineering
Grantor dc:publisher
Virginia Polytechnic Institute and State University
Year dc:date.issued
1982

Author and committee

dc:creator, dc:contributor.*
Author dc:creator
  • Das, Alok
Chair dc:contributor.committeechair
  • Kelley, H.J.
Committee members dc:contributor.committeemember
  • Haftka, Raphael T.
  • Cliff, Eugene M.
  • Lutze, Frederick H.
  • Burns, John A.

Rights

dc:rights
Statement dc:rights
  • In Copyright
Language dc:language.iso
en_US

Identifiers

dc:identifier.*
Handle dc:identifier.uri
http://hdl.handle.net/10919/80245
OAI identifier oai:identifier
oai:vtechworks.lib.vt.edu:10919/80245

Chain of custody

source
Harvested from
Virginia Tech
Base URL
vtechworks.lib.vt.edu/oai/request
Last updated
2026-07-22
Source record
OAI-PMH GetRecord
related terms
citation

Das, Alok. An active-constraint logic for nonlinear programming. doctoral thesis, Virginia Polytechnic Institute and State University, 1982. http://hdl.handle.net/10919/80245