Results 241 to 250 of about 1,660,759 (289)
Some of the next articles are maybe not open access.
A feasible direction method for image restoration
Optimization Letters, 2011zbMATH Open Web Interface contents unavailable due to conflicting licenses.
LANDI, GERMANA, LOLI PICCOLOMINI, ELENA
openaire +3 more sources
Optimal Error Correction and Methods of Feasible Directions
Journal of Optimization Theory and Applications, 2012zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Saeed Ketabchi, Hossein Moosaei
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
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
Methods of Feasible Directions: A Review
Applied Optimization, 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
exaly +2 more sources
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
Feasibility of direct-biogas SOFC
International Journal of Hydrogen Energy, 2008Abstract Direct feeding of real biogas generated in a methane fermentation reactor to SOFC was tested by using Ni–ScSZ cermet as an anode material. At the operating temperature of 1000 °C, cell voltage above 0.9 V (at 200 mA cm −2 ) was stably obtained over 50 h without carbon deposition showing direct-biogas SOFC is feasible.
Y. Shiratori, T. Oshima, K. Sasaki
openaire +1 more source
The Auxiliary Problem for Feasible Directions
AIAA Journal, 1975The present work compares the computational efficiency of two means of determining a direction vector S at constraint boundaries and demonstrates the advantages of using the alternative that formulates the S-determination subproblem with a single quadratic constraint, which in turn can be cast as a special linear problem and solved directly.
L. B. GWIN, G. N. VANDERPLAATS
openaire +1 more source
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
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