Hostname: page-component-cb9f654ff-w5vf4 Total loading time: 0 Render date: 2025-08-23T01:20:18.922Z Has data issue: false hasContentIssue false
  • English
  • Français

Strict lower subdifferentiability and applications

Published online by Cambridge University Press:  17 February 2009

H. Xu ,
A. M. Rubinov  and
B. M. Glover
H. Xu
Affiliation:
School of Information Technology and Mathematical Sciences, University of Ballarat, Victoria, Australia.
A. M. Rubinov
Affiliation:
School of Information Technology and Mathematical Sciences, University of Ballarat, Victoria, Australia.
B. M. Glover
Affiliation:
School of Information Technology and Mathematical Sciences, University of Ballarat, Victoria, Australia.
Rights & Permissions [Opens in a new window]

Abstract

Core share and HTML view are not available for this content. However, as you have access to this content, a full PDF is available via the ‘Save PDF’ action button.

We investigate the strict lower subdifferentiability of a real-valued function on a closed convex subset of Rn. Relations between the strict lower subdifferential, lower subdifferential, and the usual convex subdifferential are established. Furthermore, we present necessary and sufficient optimality conditions for a class of quasiconvex minimization problems in terms of lower and strict lower subdifferentials. Finally, a descent direction method is proposed and global convergence results of the consequent algorithm are obtained.

Information

Type
Research Article
Information
The ANZIAM Journal , Volume 40 , Issue 3 , January 1999 , pp. 379 - 391
Copyright
Copyright © Australian Mathematical Society 1999

References

[1]Crouzeix, J. P., “Contributions a l'etude des fonctions quasiconvexes”, Ph. D. Thesis, Universite de Clermont-Ferrand II, Clermont-Ferrand, 1977.Google Scholar
[2]Demyanov, V. F. and Malozemov, V., Introduction to Minimax (John Wiley and Sons, New York, 1974).Google Scholar
[3]Greenberg, H. P. and Pierskalla, W. P., “Quasiconjugate function and surrogate duality”, Cahiers du Centre d'etudes de Recherche Operationnelle 15 (1973) 437–448.Google Scholar
[4]Hiriart-Urruty, J.-B. and Lemarechal, C., Convex Analysis and Minimization Algorithms II, Fundamentals (Springer, Berlin, 1993).CrossRefGoogle Scholar
[5]Martinez-Legaz, J. E., “On lower subdifferentiable functions.trends in mathematical optimization”, in Proceedings, International Conference of lrsee, (Birkhauser, Boston, MA, 1986), 197–232.Google Scholar
[6]Nikaido, H., Convex Structures and Economic Theory (Academic Press, New-York, 1969).Google Scholar
[7]Pallaschke, D. and Rolewicz, S., Foundations of Mathematical Optimization (Kluwer Academic Publishers, Dordrecht, 1997).Google Scholar
[8]Penot, J.-P. and Volle, M., “On quasiconvex duality”, Mathematics of Operations Research 15 (1990) 579–625.Google Scholar
[9]Plastria, F., “Lower subdifferentiable functions and their minimization by cuttung planes”, J. Optim. Theory Appl. 46 (1985) 37–53.CrossRefGoogle Scholar
[10]Polak, E., Mayne, D. Q. and Wardi, Y., “On the extension of constrained optimization algorithms from differentiable to nondifferentiable problems”, SIAM J. of Control and Optimization 21 (1983) 179–203.Google Scholar
[11]Rockafellar, R. T., Convex Analysis (Princeton University Press, Princeton, 1972).Google Scholar
[12]Thach, P. T. and Kojima, M. A., “A generalized convexity and variational inequality for quasi-convex minimization”, SIAM J. of Optimization 6 (1996) 212–226.Google Scholar