In this paper, we review two kinds of sequential optimality theorems for a convex optimization problem [11]. The involved functions of the problem are proper, lower semicontinuous and convex. Moreover, we give sufficient conditions for the closedness of characterization cones for the problem
Given two convex lower semicontinuous extended real valued functions F and h defined on locally conv...
In this paper, we study convex analysis and its theoretical applications. We apply important tools o...
In this paper, the classical KKT, complementarity and Lagrangian saddle-point conditions are general...
In this brief note, we review sequential optimality theorems in [5]. We give two kinds of sequential...
AbstractUsing a general approach which provides sequential optimality conditions for a general conve...
Many authors [1-7] have studied semidefinite scalar optimization problems since the probelems have m...
by Chan Chiu Fat.Thesis (M.Phil.)--Chinese University of Hong Kong, 1997.Includes bibliographical re...
In this paper, we establish optimality conditions (both necessary and sufficient) for a nonsmooth se...
AbstractIn this study we present an important theorem of the alternative involving convex functions ...
AbstractWe provide a sufficient condition which guarantees the lower-semicontinuity of the optimal s...
The aim of this work is to present several new results concerning duality in scalar convex optimizat...
AbstractWe apply a recent characterization of optimality for the abstract convex program with a cone...
AbstractWe establish a sequential version of the Maximum Theorem which is suitable for solving gener...
2000 Mathematics Subject Classification: Primary 90C29; Secondary 49K30.In this paper, we establish ...
xiii, 166 leaves ; 30 cm.PolyU Library Call No.: [THS] LG51 .H577P AMA 2002 YangIn this thesis, some...
Given two convex lower semicontinuous extended real valued functions F and h defined on locally conv...
In this paper, we study convex analysis and its theoretical applications. We apply important tools o...
In this paper, the classical KKT, complementarity and Lagrangian saddle-point conditions are general...
In this brief note, we review sequential optimality theorems in [5]. We give two kinds of sequential...
AbstractUsing a general approach which provides sequential optimality conditions for a general conve...
Many authors [1-7] have studied semidefinite scalar optimization problems since the probelems have m...
by Chan Chiu Fat.Thesis (M.Phil.)--Chinese University of Hong Kong, 1997.Includes bibliographical re...
In this paper, we establish optimality conditions (both necessary and sufficient) for a nonsmooth se...
AbstractIn this study we present an important theorem of the alternative involving convex functions ...
AbstractWe provide a sufficient condition which guarantees the lower-semicontinuity of the optimal s...
The aim of this work is to present several new results concerning duality in scalar convex optimizat...
AbstractWe apply a recent characterization of optimality for the abstract convex program with a cone...
AbstractWe establish a sequential version of the Maximum Theorem which is suitable for solving gener...
2000 Mathematics Subject Classification: Primary 90C29; Secondary 49K30.In this paper, we establish ...
xiii, 166 leaves ; 30 cm.PolyU Library Call No.: [THS] LG51 .H577P AMA 2002 YangIn this thesis, some...
Given two convex lower semicontinuous extended real valued functions F and h defined on locally conv...
In this paper, we study convex analysis and its theoretical applications. We apply important tools o...
In this paper, the classical KKT, complementarity and Lagrangian saddle-point conditions are general...