Results 211 to 220 of about 159,781 (259)

Optimal Error Correction and Methods of Feasible Directions

Journal of Optimization Theory and Applications, 2012
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Saeed Ketabchi, Hossein Moosaei
openaire   +1 more source

Rate of Convergence of a Class of Methods of Feasible Directions

SIAM Journal on Numerical Analysis, 1973
This 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

A Drivable Method of Feasible Directions

SIAM Journal on Control, 1973
This 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, 1999
The 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, 1983
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.
openaire   +2 more sources

A Steepest Feasible Direction Extension of the Simplex Method

2020
We 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, 2008
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Maria Daneva, Torbjörn Larsson, Michael Patriksson, Clas Rydergren   +3 more
openaire   +2 more sources

Structural optimization by methods of feasible directions

Computers & Structures, 1973
A 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, 1974
The 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, 1989
See the review in Zbl 0575.65062.
openaire   +2 more sources