Results 231 to 240 of about 694,961 (287)

A new SQP method of feasible directions for nonlinear programming

Applied Mathematics and Computation, 2004
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Zhu, Zhibin, Zhang, Kecun
openaire   +3 more sources

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   +4 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.
Chen, X. B., Kostreva, M. M.
openaire   +3 more sources

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   +4 more sources

Norm-relaxed method of feasible directions for solving nonlinear programming problems

Journal of Optimization Theory and Applications, 1994
The paper describes a variation of a feasible direction method for solving nonlinear programming problems. The authors show that the method converges to a Fritz John point. The algorithm is a feasible direction method where the optimality of the solutions is determined according to a constrained quadratic program.
Cawood, M. E., Kostreva, M. M.
openaire   +4 more sources

Probabilistic version of the method of feasible directions

Applied Mathematics and Computation, 2002
This paper is a sequel of the results obtained by one of the authors [see \textit{J. Korychki} and \textit{M. Kostreva}, J. Optimization Theory 92, 311--330 (1994; Zbl 0886.90128) and 91, 389--418 (1996; Zbl 0883.90101)]. It is devoted to the discussion of random procedure that implements the solution of the non linear programming inequality ...
Gorka, A., Kostreva, M.
openaire   +1 more source

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.
Ketabchi, Saeed, Moosaei, Hossein
openaire   +1 more source

Self-Tuning Norm-Relaxed Method of Feasible Directions

Journal of Optimization Theory and Applications, 1997
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Korycki, J., Kostreva, M.
openaire   +2 more sources

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.
Polak, E., Trahan, R., Mayne, D. Q.
openaire   +2 more sources

Enhanced methods of feasible directions for engineering design problems

Journal of Optimization Theory and Applications, 1986
After the advantages of methods of feasible directions in an engineering design environment are pointed out, several modifications to the classical scheme are proposed, aimed at improving computational efficiency while preserving convergence properties.
Tits, A. L., Nye, W. T., Sangiovanni-Vincentelli, A. L.   +2 more
openaire   +1 more source