Results 221 to 230 of about 2,661 (250)

Combined phase I—phase II methods of feasible directions

Mathematical Programming, 1979
This 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, Russell E. Trahan, David Q. Mayne   +2 more
openaire   +2 more sources

An optimization algorithm based on the method of feasible directions

Structural Optimization, 1995
The 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

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

Parallel Line Search in Method of Feasible Directions

Optimization and Engineering, 2004
In this paper the line search procedure within the method of feasible directions is parallelized and used in the solution of constrained structural optimization problems. As the objective function is linear in the variables, the step size problem reduces to a zero finding problem. That is, the step size is the distance along the direction vector to the
Ashok D. Belegundu, Amol Damle, Subramaniam D. Rajan, Bhagavatula Dattaguru, James St. Ville   +4 more
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 Sequential Quadratically Constrained Quadratic Programming Method of Feasible Directions

Applied Mathematics and Optimization, 2007
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Jian, Jin-bao, Hu, Qing-jie, Tang, Chun-ming, Zheng, Hai-yan   +3 more
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