An Efficient Method of Feasible Directions
Author:
- Gerard G. L. MeyerGMGerard G. L. Meyer
- 1 January 1983
- journal article
- Published by Society for Industrial & Applied Mathematics (SIAM) in SIAM Journal on Control and Optimization
- Vol. 21 (1) , 153-162
Abstract
This paper presents a new method of feasible directions which uses an efficient antizig-zagging scheme. At every iteration, the gradient of the cost function and the gradients of the active constraints (usually one) are computed, and the previously computed gradients of the almost active constraints are used to prevent zig-zagging.Keywords
This publication has 20 references indexed in Scilit:
- Dual Variable Metric Algorithms for Constrained OptimizationSIAM Journal on Control and Optimization, 1977
- Quasi-Newton Methods, Motivation and TheorySIAM Review, 1977
- Superlinearly convergent variable metric algorithms for general nonlinear programming problemsMathematical Programming, 1976
- Superlinearly convergent quasi-newton algorithms for nonlinearly constrained optimization problemsMathematical Programming, 1976
- Multiplier methods: A surveyAutomatica, 1976
- On Penalty and Multiplier Methods for Constrained MinimizationSIAM Journal on Control and Optimization, 1976
- Combined Primal-Dual and Penalty Methods for Constrained MinimizationSIAM Journal on Control, 1975
- A characterization of superlinear convergence and its application to quasi-Newton methodsMathematics of Computation, 1974
- The Minimization of a Smooth Convex Functional on a Convex SetSIAM Journal on Control, 1967
- La mèthode des centres dans un espace topologiqueNumerische Mathematik, 1966