Author name used in this publication: X. Q. Yang.2011-2012 > Academic research: refereed > Publication in refereed journalVersion of RecordPublishe
With this thesis we bring some new results and improve some existing ones in conjugate duality and s...
Via perturbational approach, we give an alternative dual problem for a general infinite dimensional ...
AbstractA Fenchel-Rockafellar type duality theorem is obtained for a non-convex and non-differentiab...
We consider the optimization problem (PA) infx∈X{f(x) + g(Ax)} where f and g are proper convex funct...
We consider the optimization problem (PA) infx∈X{f(x) + g(Ax)} where f and g are proper convex funct...
Abstract. We consider the optimization problem (PA) inf x∈X {f(x) + g(Ax)} where f and g are proper ...
We consider the DC optimization problem (P)infx∈X( f1(x)- f2(x))+( g1(Ax)- g2(Ax)), where f1, f2, g1...
By means of a conjugation scheme based on generalized convex conjugation theory instead of Fenchel c...
Consider the DC programming problem where and are proper convex functions defined on locally ...
AbstractBifunctional Duality, Lagrange Duality, and Fenchel Duality in convex programming are presen...
Strong duality for conic linear problems $(P)$ and $(D)$ generated by convex cones $S\subset X$, $T\...
The paper deals with optimization problems with uncertain constraints and linear perturbations of th...
2000 Mathematics Subject Classification: 90C48, 49N15, 90C25In this paper we reconsider a nonconvex ...
AbstractWe give some necessary and sufficient conditions which completely characterize the strong an...
In this work, we obtain a Fenchel–Lagrange dual problem for an infinite dimensional optimization pri...
With this thesis we bring some new results and improve some existing ones in conjugate duality and s...
Via perturbational approach, we give an alternative dual problem for a general infinite dimensional ...
AbstractA Fenchel-Rockafellar type duality theorem is obtained for a non-convex and non-differentiab...
We consider the optimization problem (PA) infx∈X{f(x) + g(Ax)} where f and g are proper convex funct...
We consider the optimization problem (PA) infx∈X{f(x) + g(Ax)} where f and g are proper convex funct...
Abstract. We consider the optimization problem (PA) inf x∈X {f(x) + g(Ax)} where f and g are proper ...
We consider the DC optimization problem (P)infx∈X( f1(x)- f2(x))+( g1(Ax)- g2(Ax)), where f1, f2, g1...
By means of a conjugation scheme based on generalized convex conjugation theory instead of Fenchel c...
Consider the DC programming problem where and are proper convex functions defined on locally ...
AbstractBifunctional Duality, Lagrange Duality, and Fenchel Duality in convex programming are presen...
Strong duality for conic linear problems $(P)$ and $(D)$ generated by convex cones $S\subset X$, $T\...
The paper deals with optimization problems with uncertain constraints and linear perturbations of th...
2000 Mathematics Subject Classification: 90C48, 49N15, 90C25In this paper we reconsider a nonconvex ...
AbstractWe give some necessary and sufficient conditions which completely characterize the strong an...
In this work, we obtain a Fenchel–Lagrange dual problem for an infinite dimensional optimization pri...
With this thesis we bring some new results and improve some existing ones in conjugate duality and s...
Via perturbational approach, we give an alternative dual problem for a general infinite dimensional ...
AbstractA Fenchel-Rockafellar type duality theorem is obtained for a non-convex and non-differentiab...
DOI
Add to ORKG