A Successive Quadratic Programming Based Feasible Directions Algorithm

  • J. N. Herskovits
  • L. A. V. Carvalho
Part of the Lecture Notes in Control and Information Sciences book series (LNCIS, volume 83)


The two-stage Feasible Directions Algorithm for Nonlinearly Constrained Optimization determines a search direction in two stages.First a descent direction is defined; by modifying it, a feasible descent direction is then obtained. We apply this idea in order to state a new feasible directions algorithm based on a well known method for Nonlinear Programming studied by WILSON, HAN and POWELL.

The Successive Quadratic Programming based Feasible Directions Algorithm defines first a descent direction solving a quadratic program ming problem. This direction may be unfeasible, depending on the curva-ture of the active constraints. In a second stage a feasible search direction is then obtained by solving a modified quadratic programming problem, when only equality constraints are considered. These equality constraints are the active constraints of the first stage problem which were perturbed in order to compensate the curvature of the constraints of the nonlinear problem. Finally it’s performed a line search proce-dure which looks for a decrease of the Lagrangian function without loosing the feasibility. The rate of convergence is superlinear and the procedure avoids Maratos effect. Some numerical tests are presented which were solved in a very efficient way.


Equality Constraint Search Direction Quadratic Programming Problem Descent Direction Active Constraint 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. [1]
    DEW, M.C. - “A Feasible Direction Method for Constrained Optimiza-tion based on the Variable Metric Principle”, The Hatfield Poly-technic Numerical Optimization Centre, Technical Report 155.Google Scholar
  2. [2]
    HAN, S.P.–“A Globally Convergent Method for Nonlinear Program-ming”, JOTA, vol. 22, 1977, pp. 297–309.CrossRefzbMATHGoogle Scholar
  3. [3]
    HERSKOVITS, J.N. - “A Two-Stage Feasible Directions Alforithm for Nonlinearly Constrained Optimization”, Rapp. de Rech., 103, INRIA, BP 105, 78153, Le Chesnay, France.Google Scholar
  4. [4]
    HERSKOVITS, J.N. - “A Two-Stage Feasible Directions Algorithm Including Variable Metric Techniques for Nonlinear Optimization”, Rapp. de Rech., 118, INRIA, ibid.Google Scholar
  5. [5]
    POWELL, M.J.D.–“The Convergence of Variable Metric Methods for Nonlinearly Constrained Optimization Calculations”, Nonlinear Programming 3, Academic Press, New York, 1978, pp. 25–63.Google Scholar
  6. [6]
    POWELL, M.J.D. - “Variable Metric Methods for Constrained Optimi-zation, in Mathematical Programming, The State of the Art; Bonn 1982, A.Bachen, M.Gr8tschel, B.Korte eds. ( Springer Verlag, Berlin Heidelberg, 1983 ).Google Scholar
  7. [7]
    SCHITTKOWSKI, K. and H. WILLI - “Test Examples for Nonlinear Pro-gramming Codes”, Springer-Verlag, 1980.Google Scholar

Copyright information

© Springer Science+Business Media Dordrecht 1986

Authors and Affiliations

  • J. N. Herskovits
    • 1
  • L. A. V. Carvalho
    • 1
  1. 1.Programa de Engenharia MecanicaCOPPE/UFRJRio de JaneiroBrasil

Personalised recommendations