共查询到20条相似文献,搜索用时 62 毫秒
1.
In this paper, we consider a convex vector optimization problem of finding weak Pareto optimal solutions from a uniformly convex and uniformly smooth Banach space to a real Banach space, with respect to the partial order induced by a closed, convex, and pointed cone with a nonempty interior. We introduce a vector-valued proximal-type method based on the Lyapunov functional, carry out convergent analysis on this method, and prove that any sequence generated by the method weakly converges to a weak Pareto optimal solution of the vector optimization problem under some mild conditions. Our results improve and generalize some known results. 相似文献
2.
In general normed spaces,we consider a multiobjective piecewise linear optimization problem with the ordering cone being convex and having a nonempty interior.We establish that the weak Pareto optimal solution set of such a problem is the union of finitely many polyhedra and that this set is also arcwise connected under the cone convexity assumption of the objective function.Moreover,we provide necessary and suffcient conditions about the existence of weak(sharp) Pareto solutions. 相似文献
3.
We propose a path following method to find the Pareto optimal solutions of a box-constrained multiobjective optimization problem. Under the assumption that the objective functions are Lipschitz continuously differentiable we prove some necessary conditions for Pareto optimal points and we give a necessary condition for the existence of a feasible point that minimizes all given objective functions at once. We develop a method that looks for the Pareto optimal points as limit points of the trajectories solutions of suitable initial value problems for a system of ordinary differential equations. These trajectories belong to the feasible region and their computation is well suited for a parallel implementation. Moreover the method does not use any scalarization of the multiobjective optimization problem and does not require any ordering information for the components of the vector objective function. We show a numerical experience on some test problems and we apply the method to solve a goal programming problem. 相似文献
4.
Zhe Chen 《Computational Optimization and Applications》2011,49(1):179-192
In this paper, we consider an extend-valued nonsmooth multiobjective optimization problem of finding weak Pareto optimal solutions.
We propose a class of vector-valued generalized viscosity approximation method for solving the problem. Under some conditions,
we prove that any sequence generated by this method converges to a weak Pareto optimal solution of the multiobjective optimization
problem. 相似文献
5.
In this paper, we present a proximal point algorithm for multicriteria optimization, by assuming an iterative process which uses a variable scalarization function. With respect to the convergence analysis, firstly we show that, for any sequence generated from our algorithm, each accumulation point is a Pareto critical point for the multiobjective function. A more significant novelty here is that our paper gets full convergence for quasi-convex functions. In the convex or pseudo-convex cases, we prove convergence to a weak Pareto optimal point. Another contribution is to consider a variant of our algorithm, obtaining the iterative step through an unconstrained subproblem. Then, we show that any sequence generated by this new algorithm attains a Pareto optimal point after a finite number of iterations under the assumption that the weak Pareto optimal set is weak sharp for the multiobjective problem. 相似文献
6.
The aim of this paper is to propose a new multiple subgradient descent bundle method for solving unconstrained convex nonsmooth multiobjective optimization problems. Contrary to many existing multiobjective optimization methods, our method treats the objective functions as they are without employing a scalarization in a classical sense. The main idea of this method is to find descent directions for every objective function separately by utilizing the proximal bundle approach, and then trying to form a common descent direction for every objective function. In addition, we prove that the method is convergent and it finds weakly Pareto optimal solutions. Finally, some numerical experiments are considered. 相似文献
7.
Zhe Chen 《Journal of Global Optimization》2013,55(3):507-520
In this paper, we present a unified approach for studying convex composite multiobjective optimization problems via asymptotic analysis. We characterize the nonemptiness and compactness of the weak Pareto optimal solution sets for a convex composite multiobjective optimization problem. Then, we employ the obtained results to propose a class of proximal-type methods for solving the convex composite multiobjective optimization problem, and carry out their convergence analysis under some mild conditions. 相似文献
8.
S. Deng 《Journal of Optimization Theory and Applications》2010,144(1):29-42
For a given multiobjective optimization problem, we study recession properties of the sets of efficient solutions and properly
efficient solutions. We work out various consequences based on the obtained recession properties, including a characterization
for the boundedness and nonemptiness of the set of (properly) efficient solutions when the problem is a convex problem. We
also show that the boundedness and nonemptiness of the set of efficient solutions is equivalent to that of the set of properly
efficient solutions under an additional mild condition. Finally, we provide some new verifiable necessary conditions for the
nonemptiness of the set of efficient solutions in terms of the associated recession functions and recession cones. 相似文献
9.
Motivated by Markowitz portfolio optimization problems under uncertainty in the problem data, we consider general convex parametric multiobjective optimization problems under data uncertainty. For the first time, this uncertainty is treated by a robust multiobjective formulation in the gist of Ben-Tal and Nemirovski. For this novel formulation, we investigate its relationship to the original multiobjective formulation as well as to its scalarizations. Further, we provide a characterization of the location of the robust Pareto frontier with respect to the corresponding original Pareto frontier and show that standard techniques from multiobjective optimization can be employed to characterize this robust efficient frontier. We illustrate our results based on a standard mean–variance problem. 相似文献
10.
Mounir El Maghri Youssef Elboulqe 《Journal of Optimization Theory and Applications》2018,179(3):917-943
In this paper, we present the Wolfe’s reduced gradient method for multiobjective (multicriteria) optimization. We precisely deal with the problem of minimizing nonlinear objectives under linear constraints and propose a reduced Jacobian method, namely a reduced gradient-like method that does not scalarize those programs. As long as there are nondominated solutions, the principle is to determine a direction that decreases all goals at the same time to achieve one of them. Following the reduction strategy, only a reduced search direction is to be found. We show that this latter can be obtained by solving a simple differentiable and convex program at each iteration. Moreover, this method is conceived to recover both the discontinuous and continuous schemes of Wolfe for the single-objective programs. The resulting algorithm is proved to be (globally) convergent to a Pareto KKT-stationary (Pareto critical) point under classical hypotheses and a multiobjective Armijo line search condition. Finally, experiment results over test problems show a net performance of the proposed algorithm and its superiority against a classical scalarization approach, both in the quality of the approximated Pareto front and in the computational effort. 相似文献
11.
Bundle-based descent method for nonsmooth multiobjective DC optimization with inequality constraints
Multiobjective DC optimization problems arise naturally, for example, in data classification and cluster analysis playing a crucial role in data mining. In this paper, we propose a new multiobjective double bundle method designed for nonsmooth multiobjective optimization problems having objective and constraint functions which can be presented as a difference of two convex (DC) functions. The method is of the descent type and it generalizes the ideas of the double bundle method for multiobjective and constrained problems. We utilize the special cutting plane model angled for the DC improvement function such that the convex and the concave behaviour of the function is captured. The method is proved to be finitely convergent to a weakly Pareto stationary point under mild assumptions. Finally, we consider some numerical experiments and compare the solutions produced by our method with the method designed for general nonconvex multiobjective problems. This is done in order to validate the usage of the method aimed specially for DC objectives instead of a general nonconvex method. 相似文献
12.
Radu Ioan Boţ Ioan Bogdan Hodrea Gert Wanka 《Central European Journal of Mathematics》2008,6(3):453-468
We consider a convex optimization problem with a vector valued function as objective function and convex cone inequality constraints.
We suppose that each entry of the objective function is the composition of some convex functions. Our aim is to provide necessary
and sufficient conditions for the weakly efficient solutions of this vector problem. Moreover, a multiobjective dual treatment
is given and weak and strong duality assertions are proved.
相似文献
13.
MAJOR-EFFICIENT SOLUTIONS AND WEAKLY MAJOR-EFFICIENT SOLUTIONS OF MULTIOBJECTIVE PROGRAMMING 总被引:10,自引:0,他引:10
HU YUDA 《高校应用数学学报(英文版)》1994,9(1):85-94
MAJOR-EFFICIENTSOLUTIONSANDWEAKLYMAJOR-EFFICIENTSOLUTIONSOFMULTIOBJECTIVEPROGRAMMING¥HUYUDA(Dept.ofAppl.Math.,ShanghaiJiaoTon... 相似文献
14.
In this paper, we introduce a sequential approximate strong Karush–Kuhn–Tucker (ASKKT) condition for a multiobjective optimization problem with inequality constraints. We show that each local efficient solution satisfies the ASKKT condition, but weakly efficient solutions may not satisfy it. Subsequently, we use a so-called cone-continuity regularity (CCR) condition to guarantee that the limit of an ASKKT sequence converges to an SKKT point. Finally, under the appropriate assumptions, we show that the ASKKT condition is also a sufficient condition of properly efficient points for convex multiobjective optimization problems. 相似文献
15.
In this paper, a graphical characterization, in the decision space, of the properly efficient solutions of a convex multiobjective
problem is derived. This characterization takes into account the relative position of the gradients of the objective functions
and the active constraints at the given feasible solution. The unconstrained case with two objective functions and with any
number of functions and the general constrained case are studied separately. In some cases, these results can provide a visualization
of the efficient set, for problems with two or three variables. Besides, a proper efficiency test for general convex multiobjective
problems is derived, which consists of solving a single linear optimization problem. 相似文献
16.
17.
We use asymptotic analysis to develop finer estimates for the efficient, weak efficient and proper efficient solution sets (and for their asymptotic cones) to convex/quasiconvex vector optimization problems. We also provide a new representation for the efficient solution set without any convexity assumption, and the estimates involve the minima of the linear scalarization of the original vector problem. Some new necessary conditions for a point to be efficient or weak efficient solution for general convex vector optimization problems, as well as for the nonconvex quadratic multiobjective optimization problem, are established. 相似文献
18.
T. D. Chuong 《Numerical Functional Analysis & Optimization》2013,34(8):843-857
This article is devoted to developing the generalized proximal algorithm of finding efficient solutions to the vector optimization problem for a mapping from a uniformly convex and uniformly smooth Banach space to a real Banach space with respect to the partial order induced by a pointed closed convex cone. In contrast to most published literature on this subject, our algorithm does not depend on the nonemptiness of ordering cone of the space under consideration and deals with finding efficient solutions of the vector optimization problem in question. We prove that under some suitable conditions the sequence generated by our method weakly converges to an efficient solution of this problem. 相似文献
19.
In this work, a differentiable multiobjective optimization problem with generalized cone constraints is considered, and the equivalence of weak Pareto solutions for the problem and for its η-approximated problem is established under suitable conditions. Two existence theorems for weak Pareto solutions for this kind of multiobjective optimization problem are proved by using a Karush–Kuhn–Tucker type optimality condition and the F-KKM theorem. 相似文献
20.
This paper provides some new results on approximate Pareto solutions of a multiobjective optimization problem involving nonsmooth functions. We establish Fritz-John type necessary conditions and sufficient conditions for approximate Pareto solutions of such a problem. As a consequence, we obtain Fritz-John type necessary conditions for (weakly) Pareto solutions of the considered problem by exploiting the corresponding results of the approximate Pareto solutions. In addition, we state a dual problem formulated in an approximate form to the reference problem and explore duality relations between them. 相似文献