排序方式: 共有17条查询结果,搜索用时 11 毫秒
1.
César Gutiérrez Bienvenido Jiménez Vicente Novo 《Computational Optimization and Applications》2006,35(3):305-324
This work deals with approximate solutions in vector optimization problems. These solutions frequently appear when an iterative
algorithm is used to solve a vector optimization problem. We consider a concept of approximate efficiency introduced by Kutateladze
and widely used in the literature to study this kind of solutions. Necessary and sufficient conditions for Kutateladze’s approximate
solutions are given through scalarization, in such a way that these points are approximate solutions for a scalar optimization
problem. Necessary conditions are obtained by using gauge functionals while monotone functionals are considered to attain
sufficient conditions. Two properties are then introduced to describe the idea of parametric representation of the approximate
efficient set. Finally, through scalarization, characterizations and parametric representations for the set of approximate
solutions in convex and nonconvex vector optimization problems are proved and the obtained results are applied to Pareto problems.
AMS Classification:90C29, 49M37
This research was partially supported by Ministerio de Ciencia y Tecnología (Spain), project BFM2003-02194. 相似文献
2.
Giorgio Giorgi Bienvenido Jiménez 《Numerical Functional Analysis & Optimization》2013,34(9-10):1108-1113
We take into consideration the first-order sufficient conditions, established by Jiménez and Novo (Numer. Funct. Anal. Optim. 2002; 23:303–322) for strict local Pareto minima. We give here a more operative condition for a strict local Pareto minimum of order 1. 相似文献
3.
We consider a nondifferentiable convex multiobjective optimization problem whose feasible set is defined by affine equality constraints, convex inequality constraints, and an abstract convex set constraint. We obtain Fritz John and Kuhn–Tucker necessary and sufficient conditions for ε-Pareto optimality via a max function. We also provide some relations among ε-Pareto solutions for such a problem and approximate solutions for several associated scalar problems. 相似文献
4.
César?GutiérrezEmail author Bienvenido?Jiménez Vicente?Novo 《Journal of Global Optimization》2005,32(3):367-383
This paper deals with approximate Pareto solutions in convex multiobjective optimization problems. We relate two approximate
Pareto efficiency concepts: one is already classic and the other is due to Helbig. We obtain Fritz John and Kuhn–Tucker type
necessary and sufficient conditions for Helbig’s approximate solutions. An application we deduce saddle-point theorems corresponding
to these solutions for two vector-valued Lagrangian functions. 相似文献
5.
6.
Bienvenido Jimnez Vicente Novo 《Journal of Mathematical Analysis and Applications》2002,270(2):449-356
We consider a multiobjective program with inequality and equality constraints and a set constraint. The equality constraints are Fréchet differentiable and the objective function and the inequality constraints are locally Lipschitz. Within this context, a Lyusternik type theorem is extended, establishing afterwards both Fritz–John and Kuhn–Tucker necessary conditions for Pareto optimality. 相似文献
7.
Bienvenido Jiménez 《Journal of Mathematical Analysis and Applications》2003,284(2):496-510
In this paper we present first and second order sufficient conditions for strict local minima of orders 1 and 2 to vector optimization problems with an arbitrary feasible set and a twice directionally differentiable objective function. With this aim, the notion of support function to a vector problem is introduced, in such a way that the scalar case and the multiobjective case, in particular, are contained. The obtained results extend the multiobjective ones to this case. Moreover, specializing to a feasible set defined by equality, inequality, and set constraints, first and second order sufficient conditions by means of Lagrange multiplier rules are established. 相似文献
8.
Bienvenido Cuartero José E. Galé Arkadii M. Slinko 《Proceedings of the American Mathematical Society》1997,125(7):1945-1952
It is proved that if the dual Lie algebra of a Lie coalgebra is algebraic, then it is algebraic of bounded degree. This result is an analog of the D.Radford's result for associative coalgebras.
9.
In this paper a Basic Constraint Qualification is introduced for a nonconvex infinite-dimensional vector optimization problem extending the usual one from convex programming assuming the Hadamard differentiability of the maps. Corresponding KKT conditions are established by considering a decoupling of the constraint cone into half-spaces. This extension leads to generalized KKT conditions which are finer than the usual abstract multiplier rule. A second constraint qualification expressed directly in terms of the data is also introduced, which allows us to compute the contingent cone to the feasible set and, as a consequence, it is proven that this condition is a particular case of the first one. Relationship with other constraint qualifications in infinite-dimensional vector optimization, specially with the Kurcyuscz-Robinson-Zowe constraint qualification, are also given. 相似文献
10.
Bienvenido Barraza Martínez Robert Denk Jairo Hernández Monzón 《manuscripta mathematica》2014,144(3-4):349-372
In this paper, we consider pseudodifferential operators with operator-valued symbols and their mapping properties, without assumptions on the underlying Banach space E. We show that, under suitable parabolicity assumptions, the \({W_p^k(\mathbb{R}^n, E)}\) -realization of the operator generates an analytic semigroup. Our approach is based on oscillatory integrals and kernel estimates for them. An application to non-autonomous pseudodifferential Cauchy problems gives the existence and uniqueness of a classical solution. As an example, we include a discussion of coagulation–fragmentation processes. 相似文献