A global method for some class of optimization and control problems.
Enkhbat, R. (2000)
International Journal of Mathematics and Mathematical Sciences
Similarity:
Enkhbat, R. (2000)
International Journal of Mathematics and Mathematical Sciences
Similarity:
Tadeusz Antczak (2009)
Applications of Mathematics
Similarity:
A new approach for obtaining the second order sufficient conditions for nonlinear mathematical programming problems which makes use of second order derivative is presented. In the so-called second order -approximation method, an optimization problem associated with the original nonlinear programming problem is constructed that involves a second order -approximation of both the objective function and the constraint function constituting the original problem. The equivalence between...
Jimbo, Shuichi, Zhai, Jian (2000)
Abstract and Applied Analysis
Similarity:
Razani, Abdolrahman (2007)
Surveys in Mathematics and its Applications
Similarity:
Tadeusz Antczak (2011)
Kybernetika
Similarity:
In this paper, by using the second order -approximation method introduced by Antczak [3], new saddle point results are obtained for a nonlinear mathematical programming problem involving second order invex functions with respect to the same function . Moreover, a second order -saddle point and a second order -Lagrange function are defined for the so-called second order -approximated optimization problem constructed in this method. Then, the equivalence between an optimal solution...
Liping Liu, Pekka Neittaanmäki, Michal Křížek (2000)
Applications of Mathematics
Similarity:
We examine new second-order necessary conditions and sufficient conditions which characterize nondominated solutions of a generalized constrained multiobjective programming problem. The vector-valued criterion function as well as constraint functions are supposed to be from the class . Second-order optimality conditions for local Pareto solutions are derived as a special case.