Fampa, Marcia; Maculan, Nelson A new relaxation in conic form for the Euclidean Steiner problem in \(\mathbb R^n\). (English) Zbl 1020.90042 RAIRO, Oper. Res. 35, No. 4, 383-394 (2001). MSC: 90C27 90C51 90C57 90C35 PDFBibTeX XMLCite \textit{M. Fampa} and \textit{N. Maculan}, RAIRO, Oper. Res. 35, No. 4, 383--394 (2001; Zbl 1020.90042) Full Text: DOI Numdam EuDML
Anderson, Edward J.; Goberna, Miguel A.; López, Marco A. Simplex-like trajectories on quasi-polyhedral sets. (English) Zbl 1073.90527 Math. Oper. Res. 26, No. 1, 147-162 (2001). MSC: 90C05 90C51 PDFBibTeX XMLCite \textit{E. J. Anderson} et al., Math. Oper. Res. 26, No. 1, 147--162 (2001; Zbl 1073.90527) Full Text: DOI
Marazzi, Marcelo; Nocedal, Jorge Feasibility control in nonlinear optimization. (English) Zbl 0978.65050 DeVore, Ronald A. (ed.) et al., Foundations of computational mathematics. Conference, Oxford, GB, July 18-28, 1999. Cambridge: Cambridge University Press. Lond. Math. Soc. Lect. Note Ser. 284, 125-154 (2001). MSC: 65K05 90C30 90C51 90C53 PDFBibTeX XMLCite \textit{M. Marazzi} and \textit{J. Nocedal}, Lond. Math. Soc. Lect. Note Ser. 284, 125--154 (2001; Zbl 0978.65050)
Faybusovich, L.; Arana, R. A long-step primal–dual algorithm for the symmetric programming problem. (English) Zbl 0970.90117 Syst. Control Lett. 43, No. 1, 3-7 (2001). MSC: 90C51 90C60 17C99 PDFBibTeX XMLCite \textit{L. Faybusovich} and \textit{R. Arana}, Syst. Control Lett. 43, No. 1, 3--7 (2001; Zbl 0970.90117) Full Text: DOI
Dussault, Jean-Pierre; Elafia, Abdellatif On the superlinear convergence order of the logarithmic barrier algorithm. (English) Zbl 0992.90066 Comput. Optim. Appl. 19, No. 1, 31-53 (2001). MSC: 90C30 90C51 65K05 49M30 PDFBibTeX XMLCite \textit{J.-P. Dussault} and \textit{A. Elafia}, Comput. Optim. Appl. 19, No. 1, 31--53 (2001; Zbl 0992.90066) Full Text: DOI
Sun, J. Solving the discrete \(l_p\)-approximation problem by a method of centers. (English) Zbl 0983.65072 J. Comput. Appl. Math. 129, No. 1-2, 63-76 (2001). MSC: 65K05 65D15 90C25 90C51 PDFBibTeX XMLCite \textit{J. Sun}, J. Comput. Appl. Math. 129, No. 1--2, 63--76 (2001; Zbl 0983.65072) Full Text: DOI
Todd, Michael J.; Tunçel, Levent; Ye, Yinyu Characterizations, bounds, and probabilistic analysis of two complexity measures for linear programming problems. (English) Zbl 0978.90069 Math. Program. 90, No. 1 (A), 59-69 (2001). MSC: 90C05 90C51 68Q25 PDFBibTeX XMLCite \textit{M. J. Todd} et al., Math. Program. 90, No. 1 (A), 59--69 (2001; Zbl 0978.90069) Full Text: DOI
Chen, Scott Shaobing; Donoho, David L.; Saunders, Michael A. Atomic decomposition by basis pursuit. (English) Zbl 0979.94010 SIAM Rev. 43, No. 1, 129-159 (2001). MSC: 94A12 65K05 65D15 41A45 PDFBibTeX XMLCite \textit{S. S. Chen} et al., SIAM Rev. 43, No. 1, 129--159 (2001; Zbl 0979.94010) Full Text: DOI
de Klerk, E.; Peng, J.; Roos, C.; Terlaky, T. A scaled Gauss–Newton primal-dual search direction for semidefinite optimization. (English) Zbl 1001.65060 SIAM J. Optim. 11, No. 4, 870-888 (2001). Reviewer: N.Djuranović-Miličić (Beograd) MSC: 65K05 90C22 PDFBibTeX XMLCite \textit{E. de Klerk} et al., SIAM J. Optim. 11, No. 4, 870--888 (2001; Zbl 1001.65060) Full Text: DOI
Arbel, Ami; Korhonen, Pekka Using objective values to start multiple objective linear programming algorithms. (English) Zbl 0996.90064 Eur. J. Oper. Res. 128, No. 3, 587-596 (2001). MSC: 90C29 90C51 90C08 PDFBibTeX XMLCite \textit{A. Arbel} and \textit{P. Korhonen}, Eur. J. Oper. Res. 128, No. 3, 587--596 (2001; Zbl 0996.90064) Full Text: DOI