Results 121 to 130 of about 101,882 (158)
Some of the next articles are maybe not open access.
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
A comparison of feasible direction methods for the stochastic transportation problem
Computational Optimization and Applications, 2008zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Maria Daneva +3 more
openaire +2 more sources
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
One nonrelaxation process in feasible direction methods
Journal of Soviet Mathematics, 1989See the review in Zbl 0575.65062.
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
Feasible direction methods in the absence of slater's condition
Mathematische Operationsforschung und Statistik. Series Optimization, 1978Three popular feasible direction methods for solving convex programming problems are reformulated so that they now work in the absence of Slater’s condition or any other constraint qualification.
openaire +2 more sources
Combined phase I—phase II methods of feasible directions
Mathematical Programming, 1979This paper presents several new algorithms, generalizing feasible directions algorithms, for the nonlinear programming problem, min{f 0 (z) ∣f j (z) ≤ 0,j = 1, 2, ⋯ ,m}. These new algorithms do not require an initial feasible point.
Elijah Polak +2 more
openaire +2 more sources
Feasible direction methods for stochastic programming problems
Mathematical Programming, 1980A unified approach to stochastic feasible direction methods is developed. An abstract point-to-set map description of the algorithm is used and a general convergence theorem is proved. The theory is used to develop stochastic analogs of classical feasible direction algorithms.
openaire +2 more sources
An optimization algorithm based on the method of feasible directions
Structural Optimization, 1995The theory and implementation of an optimization algorithm code based on the method of feasible directions are presented. Although the method of feasible directions was developed during the 1960's, the present implementation of the algorithm includes several modifications to improve its robustness.
A. D. Belegundu, L. Berke, S. N. Patnaik
openaire +1 more source