AbstractA functional f defined on a closed convex subset C of a normed space is to be minimized. It is known that if f is strictly convex and C is compact, then any minimizing sequence converges in norm to a unique minimum. A characterization is given herein for the norm convergence of any minimizing sequence when C is weakly compact and f is strictly quasi-convex, a more general result than those which are already known
We study the minimization problem f (x)→min, x ∈ C, where f belongs to a complete metric space of c...
A class of minimax problems is considered. We approach it with the techniques of quasiconvex optimiz...
AbstractA convex programming problem for a functional defined on a Banach space issolved, and necess...
AbstractA functional f defined on a closed convex subset C of a normed space is to be minimized. It ...
We give a short proof that in a convex minimax optimization problem in k dimensions there exist a su...
AbstractWe establish necessary and sufficient optimality conditions for quasi-convex programming. Fi...
For a class of discrete quasi convex functions called semi-strictly quasi M$^\natural$-convex functi...
We study the behavior of the minimal sets of a sequence of convex sets {An} converging to a given se...
We investigate the minima of functionals of the form ¿gWƒ(u), where O 2 is a bounded domain and ƒ a ...
Kiwiel and Murty (1996) discuss the convergence properties of a class of steepest descent algorithm ...
AbstractLet G be a nonempty closed (resp. bounded closed) subset in a reflexive strictly convex Kade...
We develop a unified framework for convergence analysis of subgradient and subgradient projection me...
by Chan Chiu Fat.Thesis (M.Phil.)--Chinese University of Hong Kong, 1997.Includes bibliographical re...
Under a suitable assumption necessary optimality conditions are derived for nonsmooth minimax proble...
AbstractLet C be a closed bounded convex subset of X with 0 being an interior point of C and pC be t...
We study the minimization problem f (x)→min, x ∈ C, where f belongs to a complete metric space of c...
A class of minimax problems is considered. We approach it with the techniques of quasiconvex optimiz...
AbstractA convex programming problem for a functional defined on a Banach space issolved, and necess...
AbstractA functional f defined on a closed convex subset C of a normed space is to be minimized. It ...
We give a short proof that in a convex minimax optimization problem in k dimensions there exist a su...
AbstractWe establish necessary and sufficient optimality conditions for quasi-convex programming. Fi...
For a class of discrete quasi convex functions called semi-strictly quasi M$^\natural$-convex functi...
We study the behavior of the minimal sets of a sequence of convex sets {An} converging to a given se...
We investigate the minima of functionals of the form ¿gWƒ(u), where O 2 is a bounded domain and ƒ a ...
Kiwiel and Murty (1996) discuss the convergence properties of a class of steepest descent algorithm ...
AbstractLet G be a nonempty closed (resp. bounded closed) subset in a reflexive strictly convex Kade...
We develop a unified framework for convergence analysis of subgradient and subgradient projection me...
by Chan Chiu Fat.Thesis (M.Phil.)--Chinese University of Hong Kong, 1997.Includes bibliographical re...
Under a suitable assumption necessary optimality conditions are derived for nonsmooth minimax proble...
AbstractLet C be a closed bounded convex subset of X with 0 being an interior point of C and pC be t...
We study the minimization problem f (x)→min, x ∈ C, where f belongs to a complete metric space of c...
A class of minimax problems is considered. We approach it with the techniques of quasiconvex optimiz...
AbstractA convex programming problem for a functional defined on a Banach space issolved, and necess...