Results 211 to 220 of about 2,661 (250)
Some of the next articles are maybe not open access.
A Drivable Method of Feasible Directions
SIAM Journal on Control, 1973This paper presents a feasible directions algorithm for solving a general nonlinear programming problem. The algorithm is characterized by the fact that it is parametrized by functions. One may, through proper choice of the parametrizing maps, model the algorithm to optimize its behavior with respect to classes of problems.
openaire +2 more sources
A generalization of the norm-relaxed method of feasible directions
Applied Mathematics and Computation, 1999The paper deals with the method of feasible directions where an ellipsoidal norm term is added in the objective function of the feasible direction search program.
X. B. Chen, Michael M. Kostreva
openaire +1 more source
An Efficient Method of Feasible Directions
SIAM Journal on Control and Optimization, 1983This 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.
openaire +2 more sources
A Steepest Feasible Direction Extension of the Simplex Method
2020We present a feasible direction approach to general linear programming, which can be embedded in the simplex method although it works with non-edge feasible directions. The feasible direction used is the steepest in the space of all variables, or an approximation thereof.
Biressaw C. Wolde, Torbjörn Larsson
openaire +1 more source
Structural optimization by methods of feasible directions
Computers & Structures, 1973A general design algorithm based on methods of feasible directions is presented. Zoutendijk's method of feasible directions is first presented as applied to structural design. This method is modified to improve numerical stability of the design process and is then further modified to deal efficiently with infeasible designs.
Garret N. Vanderplaats, Fred Moses
openaire +1 more source
An extension of the frank and Wolfe method of feasible directions
Mathematical Programming, 1974The Frank and Wolfe method of feasible directions is shown to be a case of the more general computational approach of inner linearization followed by restriction. An extension is proposed based on this observation. The extended procedure converges, and under certain conditions the asymptotic convergence rate is geometric.
openaire +2 more sources
Methods of Feasible Directions: A Review
2000Since the theoretical basis for the method of feasible directions (MFD) was originally developed by Zoutendijk in 1960’s, several basic variations and modifications of MFD were proposed and investigated. Even though faster algorithms for solving nonlinear programming problems exist, MFD has never been abandoned because of several important advantages ...
Xibin Chen, Michael M. Kostreva
openaire +1 more source
A new SQP method of feasible directions for nonlinear programming
Applied Mathematics and Computation, 2004zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Zhibin Zhu, Kecun Zhang
openaire +1 more source
Self-Tuning Norm-Relaxed Method of Feasible Directions
Journal of Optimization Theory and Applications, 1997zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Korycki, J., Kostreva, M.
openaire +2 more sources
Enhanced methods of feasible directions for engineering design problems
Journal of Optimization Theory and Applications, 1986After the advantages of methods of feasible directions in an engineering design environment are pointed out, several modifications to the classical scheme are proposed, aimed at improving computational efficiency while preserving convergence properties.
Tits, A. L. +2 more
openaire +1 more source