Suriyanarayana, Varun; Tavaslıoğlu, Onur; Patel, Ankit B.; Schaefer, Andrew J. Reinforcement learning of simplex pivot rules: a proof of concept. (English) Zbl 1503.90069 Optim. Lett. 16, No. 8, 2513-2525 (2022). MSC: 90C05 90C49 PDFBibTeX XMLCite \textit{V. Suriyanarayana} et al., Optim. Lett. 16, No. 8, 2513--2525 (2022; Zbl 1503.90069) Full Text: DOI
Jarry-Bolduc, Gabriel; Nadeau, Patrick; Singh, Shambhavi Uniform simplex of an arbitrary orientation. (English) Zbl 1448.90102 Optim. Lett. 14, No. 6, 1407-1417 (2020). MSC: 90C56 PDFBibTeX XMLCite \textit{G. Jarry-Bolduc} et al., Optim. Lett. 14, No. 6, 1407--1417 (2020; Zbl 1448.90102) Full Text: DOI
Zhadan, Vitaly Two-phase simplex method for linear semidefinite optimization. (English) Zbl 1433.90109 Optim. Lett. 13, No. 8, 1969-1984 (2019). MSC: 90C22 90C05 90C49 PDFBibTeX XMLCite \textit{V. Zhadan}, Optim. Lett. 13, No. 8, 1969--1984 (2019; Zbl 1433.90109) Full Text: DOI
Fajfar, Iztok; Bűrmen, Árpád; Puhan, Janez The Nelder-Mead simplex algorithm with perturbed centroid for high-dimensional function optimization. (English) Zbl 1426.90251 Optim. Lett. 13, No. 5, 1011-1025 (2019). MSC: 90C49 PDFBibTeX XMLCite \textit{I. Fajfar} et al., Optim. Lett. 13, No. 5, 1011--1025 (2019; Zbl 1426.90251) Full Text: DOI
Wessing, Simon Proper initialization is crucial for the Nelder-Mead simplex search. (English) Zbl 1429.90078 Optim. Lett. 13, No. 4, 847-856 (2019). MSC: 90C30 PDFBibTeX XMLCite \textit{S. Wessing}, Optim. Lett. 13, No. 4, 847--856 (2019; Zbl 1429.90078) Full Text: DOI
Kuno, Takahito; Sano, Yoshio; Tsuruda, Takahiro Computing Kitahara-Mizuno’s bound on the number of basic feasible solutions generated with the simplex algorithm. (English) Zbl 1402.90085 Optim. Lett. 12, No. 5, 933-943 (2018). MSC: 90C05 90C49 PDFBibTeX XMLCite \textit{T. Kuno} et al., Optim. Lett. 12, No. 5, 933--943 (2018; Zbl 1402.90085) Full Text: DOI
Hashemi, Vahid Reformulation of the linear program for completely ergodic MDPs with average cost criteria. (English) Zbl 1382.90114 Optim. Lett. 11, No. 7, 1477-1487 (2017). MSC: 90C40 90C05 PDFBibTeX XMLCite \textit{V. Hashemi}, Optim. Lett. 11, No. 7, 1477--1487 (2017; Zbl 1382.90114) Full Text: DOI
Gribanov, D. V.; Veselov, S. I. On integer programming with bounded determinants. (English) Zbl 1377.90060 Optim. Lett. 10, No. 6, 1169-1177 (2016). MSC: 90C10 PDFBibTeX XMLCite \textit{D. V. Gribanov} and \textit{S. I. Veselov}, Optim. Lett. 10, No. 6, 1169--1177 (2016; Zbl 1377.90060) Full Text: DOI arXiv
Lasserre, Jean B. Volume of slices and sections of the simplex in closed form. (English) Zbl 1400.52006 Optim. Lett. 9, No. 7, 1263-1269 (2015). MSC: 52A38 52B12 PDFBibTeX XMLCite \textit{J. B. Lasserre}, Optim. Lett. 9, No. 7, 1263--1269 (2015; Zbl 1400.52006) Full Text: DOI arXiv
Regis, Rommel G. The calculus of simplex gradients. (English) Zbl 1351.90168 Optim. Lett. 9, No. 5, 845-865 (2015). MSC: 90C56 PDFBibTeX XMLCite \textit{R. G. Regis}, Optim. Lett. 9, No. 5, 845--865 (2015; Zbl 1351.90168) Full Text: DOI
Bahçeci, Ufuk; Feyzioğlu, Orhan A network simplex based algorithm for the minimum cost proportional flow problem with disconnected subnetworks. (English) Zbl 1254.90269 Optim. Lett. 6, No. 6, 1173-1184 (2012). MSC: 90C35 PDFBibTeX XMLCite \textit{U. Bahçeci} and \textit{O. Feyzioğlu}, Optim. Lett. 6, No. 6, 1173--1184 (2012; Zbl 1254.90269) Full Text: DOI
Sharkey, Thomas C.; Romeijn, H. Edwin Simplex-inspired algorithms for solving a class of convex programming problems. (English) Zbl 1152.90563 Optim. Lett. 2, No. 4, 455-481 (2008). MSC: 90C25 90C49 PDFBibTeX XMLCite \textit{T. C. Sharkey} and \textit{H. E. Romeijn}, Optim. Lett. 2, No. 4, 455--481 (2008; Zbl 1152.90563) Full Text: DOI