Mathematical Programming

, Volume 11, Issue 1, pp 67–80

Feasible directions algorithms for optimization problems with equality and inequality constraints

  • D. Q. Mayne
  • E. Polak
Article

DOI: 10.1007/BF01580371

Cite this article as:
Mayne, D.Q. & Polak, E. Mathematical Programming (1976) 11: 67. doi:10.1007/BF01580371

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.

Copyright information

© The Mathematical Programming Society 1976

Authors and Affiliations

  • D. Q. Mayne
    • 1
  • E. Polak
    • 2
  1. 1.Imperial College of Science and TechnologyLondonUK
  2. 2.University of CaliforniaBerkeleyUSA