Vector duality for convex vector optimization problems with respect to quasi-minimality

اسناد مشابه

• Duality for multiobjective optimization problems with convex objective functions and D.C. constraints

  سند علمی۲۰۰۵Radu Ioan Boţ, Gert Wanka

  In this paper we provide a duality theory for multiobjective optimization problems with convex objective functions and finitely many D.C. constraints. In order to do this, we study first the duality for a scalar convex optimization problem with inequality constraints defined by e

• Stable and Total Fenchel Duality for DC Optimization Problems in Locally Convex Spaces

  سند علمی۲۰۱۱SIAM Journal on OptimizationD. H. Fang, C. Li, X. Q. Yang

  We consider the DC (difference of two convex functions) optimization problem ðPÞ inf x∈Xfðf 1ðxÞ− f 2ðxÞÞ þ ðg1ðAxÞ− g2ðAxÞÞg, where f 1, f 2, g1, and g2 are proper convex functions defined on locally convex Hausdorff topological vector spaces X and Y , and A is a linear continuo

• Asymptotic closure condition and Fenchel duality for DC optimization problems in locally convex spaces

  سند علمی۲۰۱۲D. H. Fang, C. Li, X. Q. Yang

  We consider the DC optimization problem (P) inf x∈X {(f1(x) − f2(x)) + (g1(Ax) − g2(Ax))}, where f1, f2, g1 and g2 are proper convex functions defined on locally convex Hausdorff topological vector spaces X and Y respectively, and A is a linear continuous operator from X to Y . A

• Duality for composite optimization problem within the framework of abstract convexity

  مقاله‌ی دسترسی آزاد۲۰۲۲Optimization['Ewa Bednarczuk', 'The Hung Tran', '']

  We study conjugate and Lagrange dualities for composite optimization problems within the framework of abstract convexity. provide conditions zero duality gap in duality. For duality, intersection property is applied to obtain gap. Connection between dual also established. Example

• Stable Strong and Total Parametrized Dualities for Dc Optimization Problems in Locally Convex Spaces

  سند علمی۲۰۱۳Gang Li, Xiaoqi Yang, Yuying Zhou, Adil Bagirov

  By using properties of dualizing parametrization functions, Lagrangian functions and the epigraph technique, some sufficient and necessary conditions of the stable strong duality and strong total duality for a class of DC optimization problems are established.

• The max-length-vector line of best fit to a set of vector subspaces and an optimization problem over a set of hyperellipsoids

  سند علمی۲۰۱۵Numerical Lin. Alg. with Applic.Daniel J. Bates, Brent R. Davis, Michael Kirby, Justin Marks

  Let C = {V1, . . . , Vk} be a collection of subspaces of a finite-dimensional real vector space V . Let L denote a one-dimensional subspace of V and let θ(L, Vi) denote the principal angle between L and Vi. Motivated by a problem in data analysis, we seek an L that maximizes the