Feasible directions algorithms for optimization problems with equality and inequality constraints |
| |
Authors: | D Q Mayne E Polak |
| |
Institution: | (1) Imperial College of Science and Technology, London, UK;(2) University of California, Berkeley, Cal., USA |
| |
Abstract: | In this paper two algorithms, of the feasible-directions and dual feasible-directions type, are presented for optimization problems with equality and inequality constraints. An associated problem, having only inequality constraints, is defined, and shown to be equivalent to the original problem if a certain parameter is sufficiently large. The algorithms solve the associated problem, but incorporate a method for automatically increasing this parameter in order to ensure global convergence to a solution to the original problem. Any feasible directions algorithm can be similarly modified to enable it to handle equality constraints.Research sponsored by the US Army Research Office — Durham, Contract DAHCO4-73-C-0025 and the National Science Foundation Grant GK-37572. |
| |
Keywords: | |
本文献已被 SpringerLink 等数据库收录! |
|