Results 121 to 130 of about 139,187 (158)
Some of the next articles are maybe not open access.
Rate of Convergence of a Class of Methods of Feasible Directions
SIAM Journal on Numerical Analysis, 1973This paper deals with the rate of convergence of four methods of feasible directions the Zoutendijk procedures 1 and 2 and two modifications of these procedures due to the authors. It is shown that of these methods, the two due to the authors converge linearly under convexity assumptions, that the Zoutendijk procedure 2 converges sublinearly under ...
Pironneau, O., Polak, E.
openaire +1 more source
Feasibility of Motion Planning on Directed Graphs
2009Because of irreversibility of movements, motion planning on directed graphs is much more intricate than that on graphs. Recently we showed that the feasibility of motion planning on acyclic and strongly connected directed graphs can be decided in time O (nm ) (n ,m are respectively the number of vertices and arcs of the directed graph), but left the ...
Zhilin Wu, Stéphane Grumbach
openaire +1 more source
Feasible directions linear programming by neural networks
1990 IJCNN International Joint Conference on Neural Networks, 1990The authors describe how a neural network can be built for the exact solution of linear programming problems by a feasible directions approach. The proposed network, when started at any interior point, continuously tracks a path of equally interior points converging to an optimal solution.
Valmir C. Barbosa, L. A. V. de Carvalho
openaire +1 more source
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
One nonrelaxation process in feasible direction methods
Journal of Soviet Mathematics, 1989See the review in Zbl 0575.65062.
openaire +2 more sources
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
Feasible directions in economic policy
Journal of Optimization Theory and Applications, 1978Zoutendijk's method of feasible directions is used in this paper to derive numerical control strategies for the United Kingdom economy. The way in which the algorithm permits an examination of the sensitivity of the optimum short-term economic policy to changes in various assumptions demonstrates the versatility of the algorithm.
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
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