AbstractIn this paper an infinite dimensional generalized Lagrange multipliers rule for convex optimization problems is presented and necessary and sufficient optimality conditions are given in order to guarantee the strong duality. Furthermore, an application is presented, in particular the existence of Lagrange multipliers associated to the bi-obstacle problem is obtained
Given a primal-dual pair of linear programs, it is known that if their optimal values are viewed as ...
AbstractIn this paper we provide a duality theory for multiobjective optimization problems with conv...
AbstractBifunctional Duality, Lagrange Duality, and Fenchel Duality in convex programming are presen...
AbstractIn this paper an infinite dimensional generalized Lagrange multipliers rule for convex optim...
This note establishes a limiting formula for the conic Lagrangian dual of a convex infinite optimiza...
Given a convex optimization problem (P) in a locally convex topological vector space X with an arbit...
An evenly convex function on a locally convex space is an extended real-valued function, whose epigr...
The fundamental necessary optimality criterion of nonlinear mathematical programming is the Kuhn-Tuc...
AbstractIn this article we provide weak sufficient strong duality conditions for a convex optimizati...
We consider the following optimization problem: in an abstract set X, find and element x that minimi...
Li, Xing.Thesis (M.Phil.)--Chinese University of Hong Kong, 2009.Includes bibliographical references...
AbstractThe aim of this paper is to point out some sufficient constraint qualification conditions en...
We associate with each convex optimization problem, posed on some locally convex space, with infinit...
In this paper, we realize a study of various constraint qualification conditions for the existence o...
This article provides results guarateeing that the optimal value of a given convex infinite optimiza...
Given a primal-dual pair of linear programs, it is known that if their optimal values are viewed as ...
AbstractIn this paper we provide a duality theory for multiobjective optimization problems with conv...
AbstractBifunctional Duality, Lagrange Duality, and Fenchel Duality in convex programming are presen...
AbstractIn this paper an infinite dimensional generalized Lagrange multipliers rule for convex optim...
This note establishes a limiting formula for the conic Lagrangian dual of a convex infinite optimiza...
Given a convex optimization problem (P) in a locally convex topological vector space X with an arbit...
An evenly convex function on a locally convex space is an extended real-valued function, whose epigr...
The fundamental necessary optimality criterion of nonlinear mathematical programming is the Kuhn-Tuc...
AbstractIn this article we provide weak sufficient strong duality conditions for a convex optimizati...
We consider the following optimization problem: in an abstract set X, find and element x that minimi...
Li, Xing.Thesis (M.Phil.)--Chinese University of Hong Kong, 2009.Includes bibliographical references...
AbstractThe aim of this paper is to point out some sufficient constraint qualification conditions en...
We associate with each convex optimization problem, posed on some locally convex space, with infinit...
In this paper, we realize a study of various constraint qualification conditions for the existence o...
This article provides results guarateeing that the optimal value of a given convex infinite optimiza...
Given a primal-dual pair of linear programs, it is known that if their optimal values are viewed as ...
AbstractIn this paper we provide a duality theory for multiobjective optimization problems with conv...
AbstractBifunctional Duality, Lagrange Duality, and Fenchel Duality in convex programming are presen...