On the Minimizing Trajectory of Convex Functions with Unbounded Level Sets

Computational Optimization and Applications

Volumn 27, Issue 1, 2004, Pages 37-52

  Obuchowska, W T ^a  

^a Chowan University   (United States)

Author keywords

Cone of recession; Convex function; Unattained infimum; Unbounded level set

Indexed keywords

ALGORITHMS; ASYMPTOTIC STABILITY; FUNCTIONS; OPTIMIZATION; PROBLEM SOLVING; VECTORS;

CONE OF RECESSION; CONVEX FUNCTIONS; UNATTAINED INFIMUM; UNBOUNDED LEVEL SET;

SET THEORY;

EID: 0942277401     PISSN: 09266003     EISSN: None     Source Type: Journal    
DOI: 10.1023/B:COAP.0000004979.76493.d4     Document Type: Article

References (22)

1. A. Auslender, "How to deal with unbounded in optimization: Theory and algorithms," Mathematical Programming, vol. 79, pp. 3-18, 1997.
2. A. Auslender, "Existence of optimal solutions and duality results under weak conditions," Mathematical Programming, vol. 88, pp. 45-59, 2000.
3. A. Auslender, R. Cominetti, and J.-P. Crouzeix, "Convex functions with unbounded level sets and applications to duality theory," SIAM J. Optimization, vol. 3, pp. 669-687, 1993.
4. M. Avriel, Nonlinear Programming: Analysis and Methods, Prentice Hall Inc., Englewood Cliffs: NJ, 1976.
5. C. Baiocchi, G. Buttazzo, F. Gastaldi, and F. Tomarelli, "General existence theorems for unilateral problems in continuum mechanics," Archiv Rational - Mach. Anal., vol. 100, pp. 149-189, 1988.
6. R.J. Caron and W.T. Obuchowska, "An algorithm to determine boundedness of quadratically constrained convex quadratic programmes," European Journal of Operational Research, vol. 80, pp. 431-438, 1995.
7. R.J. Caron and W.T. Obuchowska, "Unboundedness of a convex quadratic function subject to concave and convex quadratic constraints," European Journal of Operational Research, vol. 63, pp. 114-123, 1992.
8. Y. Censor and A. Lent, "Optimization of log(x) entropy over linear equality constraints," SIAM Journal on Control and Optimization, vol. 25, pp. 921-933, 1987.
9. A.V. Fiacco and G.P. McCormick, Nonlinear Programming: Sequential Unconstrained Minimization Techniques, John Wiley and Sons: New York, 1968.
10. A.A. Goldstein, Constructive Real Analysis, Harper & Row, Publishers, 1968.
11. R.C. Gunning and H. Rossi, Analytic Functions of Several Complex Variables, Prentice Hall, 1965.
12. O. Guler, "On the convergence of the proximal point algorithm for convex minimization," SIAM Journal on Control and Optimization, vol. 29, pp. 403-419, 1991.
13. S.P. Han and G. Lou, "A parallel algorithm for a class of convex programs," SIAM Journal on Control and Optimization, vol. 26, pp. 345-355, 1988.
14. J.-B. Hiriart-Urutty and C. Lemarechal, Convex Analysis and Minimization Algorithms 1, Springer Verlag, 1993.
15. M. Lamoureux and H. Wolkowicz, "Numerical decomposition of a convex function," Journal of Optimization Theory and Applications, vol. 47, pp. 51-64, 1985.
16. W.T. Obuchowska, "Characterization of the cone of recession of convex function," manuscript, 2001.
17. W.T. Obuchowska and K.G. Murty, "Cone of recession and unboundedness of convex functions," European Journal of Operational Research, vol. 133/2, pp. 409-415, 2001.
18. W.T. Obuchowska, "Convex constrained programmes with unattained infima," Journal of Mathematical Analysis and Applications, vol. 234, pp. 675-694, 1999.
19. R.T. Rockafellar, "Augmented lagrangians and application of the proximal point algorithm in convex programming," Mathematics of Operations Research, vol. 1, pp. 97-116, 1976.
20. R.T. Rockafellar, Convex Analysis, Princeton University Press: Princeton, NJ, 1979.
21. W. Rudin, Principles of Mathematical Analysis, McGraw-Hill, 1976.
22. M.J. Todd, "On convergence properties of algorithms for unconstrained minimization," IMA Journal of Numerical Analysis, vol. 9, pp. 435-441, 1989.