Results 131 to 140 of about 101,882 (158)

On a Method of Feasible Directions for Solving Variational Inequalities

Optimization, 1985
An algorithm of the method of feasible directions is described solving effectively extremal problems which arise by the discretization of variational inequalities. Using the maximum principle the convergence of the algorithm is shown and some numerical examples are given.
H. Kirsten, R. Tichatschke
openaire   +1 more source

The method of feasible directions for minimax problems

Optimization, 1992
A general concept of converging algorithms of feasible direction type is introduced using upper approximation functions of the objective. By this means the zigzagging effect can be avoided and convergence to inf-stationary points of the objective is proved.
openaire   +1 more source

On the Convergence to Stationary Points of Deterministic and Randomized Feasible Descent Directions Methods

SIAM Journal on Optimization, 2020
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Amir Beck, Nadav Hallak
openaire   +1 more source

Feasible direction method for bilevel programming problem

Optimization, 2012
In this article, we investigate the application of feasible direction method for an optimistic non-linear bilevel programming problem. The convex lower level problem of an optimistic non-linear bilevel programming problem is replaced by relaxed KKT conditions. The feasible direction method developed by Topkis and Veinott [D.M.
Ayalew Getachew Mersha, Stephan Dempe
openaire   +1 more source

Constrained Variable Metric Method With Feasible Directions

16th Design Automation Conference: Volume 2 — Optimal Design and Mechanical Systems Analysis, 1990
Abstract This paper proposes a new feasible direction algorithm based on the constrained variable metric method of Powell in order to handle the design optimization problmes which demand that all iterative points are feasible. The algorithm retains many advantages of the constrained variable metric method, makes use of the properties of ...
Wang Jianhua, Zhou Ji, Yu Jun
openaire   +1 more source

A stochastic approximation counterpart of the feasible direction method

Statistics & Probability Letters, 1987
A stochastic approximation counterpart of the feasible direction method of Topkis and Veinott is considered. No convexity condition on a function to be minimized is imposed and a procedure for one-dimensional minimization along each feasible direction chosen is included.
openaire   +1 more source

A feasible-direction method for nonlinear constrained optimization

ANNALI DELL UNIVERSITA DI FERRARA, 2002
The author considers a feasible-direction interior-point technique for the solution of nonlinear differentiable constrained optimization problems which was originally introduced by Herskovits. In the paper several updating rules for the parameters used in the algorithm are introduced and corresponding convergence properties are shown.
openaire   +2 more sources

A new feasible directions method in nonlinear optimization

1992
In each of the mechanical and discrete numerical models presented in the preceding chapters, the solution of a large nonlinear constrained optimization problem is required in order to evaluaute the actual residual stresses in body.
J. Orkisz, M. Pazdanowski
openaire   +1 more source

Convergence of methods of feasible directions in extremal problems

USSR Computational Mathematics and Mathematical Physics, 1971
Abstract GENERAL theorems on the convergence conditions of one-step iteration methods for minimization problems with constraints are presented. These theorems are applied for the uniform derivation of both previously known and also new results on the convergence of specific methods. The problem of the minimization of the functional f(x) on the set Q
openaire   +1 more source

Generalized reduced gradient method as an extension of feasible direction methods

Journal of Optimization Theory and Applications, 1977
The paper presents modifications of the generalized reduced gradient method which allows for a convergence proof. For that, a special construction of the basis is introduced, and some tools of the theory of feasible direction are used to modify the common choice of the direction at every step.
openaire   +2 more sources