Soriano, J. M. Global minimum point of a convex function. (English) Zbl 0778.65046 Appl. Math. Comput. 55, No. 2-3, 213-218 (1993). The existence of a unique global minimizer of a strictly convex function is proved under some smoothness conditions. Reviewer: J.Guddat (Berlin) Cited in 19 Documents MSC: 65K05 Numerical mathematical programming methods 90C25 Convex programming Keywords:convex optimization; constructive homotopy method; large-scale problems; global minimizer; strictly convex function PDFBibTeX XMLCite \textit{J. M. Soriano}, Appl. Math. Comput. 55, No. 2--3, 213--218 (1993; Zbl 0778.65046) Full Text: DOI EuDML References: [1] Garcia, C. B.; Zangwill, W. I., Pathways to Solution, Fixed Points and Equilibria, Prentice-Hall Series in Computational Mathematics (1981), Prentice-Hall: Prentice-Hall London · Zbl 0512.90070 [2] Roberts, A. W.; Varberg, D. E., Convex functions, Pure Appl. Math., 57 (1973) · Zbl 0289.26012 [3] Rockafellar, R. T., Convex Analysis, Princeton Mathematical Series, 28 (1970), Princeton University Press: Princeton University Press Princeton, New Jersey · Zbl 0229.90020 [4] Petrovski, I. G., Ordinary Differential Equations (1966), Dover Publications: Dover Publications New York [5] Soriano, J. M., Sobre las existencia y el cálculo de ceros de funciones regulares, Rev. Real Acad. Cienc. Exact. Fis. Natur. Madrid, LXXXII, 3-4, 523-531 (1988) [6] Soriano, J. M., A special type of triangulation in numerical nonlinear analysis, Collect. Math., 41, 1, 45-58 (1990) · Zbl 0743.65050 [7] Zeidler, E., Nonlinear Functional Analysis and its Applications (1985), Springer-Verlag: Springer-Verlag New York This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. In some cases that data have been complemented/enhanced by data from zbMATH Open. This attempts to reflect the references listed in the original paper as accurately as possible without claiming completeness or a perfect matching.