Kabir, Muhammad Nomani A robust algorithm for solving nonlinear system of equations using trust-region and line-search techniques. (English) Zbl 1453.65108 Int. J. Comput. Sci. Math. 11, No. 2, 192-207 (2020). MSC: 65H10 65K05 PDF BibTeX XML Cite \textit{M. N. Kabir}, Int. J. Comput. Sci. Math. 11, No. 2, 192--207 (2020; Zbl 1453.65108) Full Text: DOI OpenURL
Mahasinghe, Anuradha Reformulating the harmonious colouring problem for quantum annealing. (English) Zbl 07491502 An. Univ. Spiru Haret, Ser. Mat.-Inform. 14, No. 1, 11-20 (2018). MSC: 60-08 90-08 PDF BibTeX XML Cite \textit{A. Mahasinghe}, An. Univ. Spiru Haret, Ser. Mat.-Inform. 14, No. 1, 11--20 (2018; Zbl 07491502) Full Text: Link OpenURL
Moghrabi, Issam A. R. Implicit extra-update multi-step quasi-Newton methods. (English) Zbl 1362.90358 Int. J. Oper. Res. 28, No. 2, 216-228 (2017). MSC: 90C53 PDF BibTeX XML Cite \textit{I. A. R. Moghrabi}, Int. J. Oper. Res. 28, No. 2, 216--228 (2017; Zbl 1362.90358) Full Text: DOI OpenURL
Mukherjee, Neetik A simulated annealing based study of the effect of Gaussian perturbation in quartic oscillator and quadratic double well potentials. (English) Zbl 1308.70039 J. Math. Chem. 53, No. 1, 137-150 (2015). MSC: 70K65 PDF BibTeX XML Cite \textit{N. Mukherjee}, J. Math. Chem. 53, No. 1, 137--150 (2015; Zbl 1308.70039) Full Text: DOI OpenURL
Liu, Jinkui; Du, Xianglin Global convergence of an efficient hybrid conjugate gradient method for unconstrained optimization. (English) Zbl 1273.65071 Bull. Korean Math. Soc. 50, No. 1, 73-81 (2013). Reviewer: Andrea Walther (Paderborn) MSC: 65K05 90C30 PDF BibTeX XML Cite \textit{J. Liu} and \textit{X. Du}, Bull. Korean Math. Soc. 50, No. 1, 73--81 (2013; Zbl 1273.65071) Full Text: DOI Link OpenURL
Rameshkumar, K.; Rajendran, Chandrasekharan; Mohanasundaram, K. M. A novel particle swarm optimisation algorithm for continuous function optimisation. (English) Zbl 1362.90372 Int. J. Oper. Res. 13, No. 1, 1-21 (2012). MSC: 90C59 PDF BibTeX XML Cite \textit{K. Rameshkumar} et al., Int. J. Oper. Res. 13, No. 1, 1--21 (2012; Zbl 1362.90372) Full Text: DOI OpenURL
Glover, Fred; Hao, Jin-Kao; Kochenberger, Gary Polynomial unconstrained binary optimisation – part 2. (English) Zbl 1306.90095 Int. J. Metaheuristics 1, No. 4, 317-354 (2011). MSC: 90C09 90C59 PDF BibTeX XML Cite \textit{F. Glover} et al., Int. J. Metaheuristics 1, No. 4, 317--354 (2011; Zbl 1306.90095) Full Text: DOI OpenURL
Glover, Fred; Hao, Jin-Kao; Kochenberger, Gary Polynomial unconstrained binary optimisation – part 1. (English) Zbl 1306.90094 Int. J. Metaheuristics 1, No. 3, 232-256 (2011). MSC: 90C09 90C59 PDF BibTeX XML Cite \textit{F. Glover} et al., Int. J. Metaheuristics 1, No. 3, 232--256 (2011; Zbl 1306.90094) Full Text: DOI OpenURL
Velásquez H., Juan David R-chaosoptimiser: an optimiser for unconstrained global nonlinear optimisation written in R language for statistical computing. (Spanish, English) Zbl 1279.65079 Ing. Investig. 31, No. 3, 50-55 (2011). MSC: 65K05 90C30 90C26 PDF BibTeX XML Cite \textit{J. D. Velásquez H.}, Ing. Investig. 31, No. 3, 50--55 (2011; Zbl 1279.65079) Full Text: Link OpenURL
de Carvalho, Miguel Confidence intervals for the minimum of a function using extreme value statistics. (English) Zbl 1220.65072 Int. J. Math. Model. Numer. Optim. 2, No. 3, 288-296 (2011). MSC: 65K05 90C15 65C60 62G32 62F25 PDF BibTeX XML Cite \textit{M. de Carvalho}, Int. J. Math. Model. Numer. Optim. 2, No. 3, 288--296 (2011; Zbl 1220.65072) Full Text: DOI OpenURL
Glover, Fred; Hao, Jin-Kao Fast two-flip move evaluations for binary unconstrained quadratic optimisation problems. (English) Zbl 1223.90036 Int. J. Metaheuristics 1, No. 2, 100-107 (2010). MSC: 90C20 90C09 90C59 PDF BibTeX XML Cite \textit{F. Glover} and \textit{J.-K. Hao}, Int. J. Metaheuristics 1, No. 2, 100--107 (2010; Zbl 1223.90036) Full Text: DOI OpenURL
Glover, Fred; Hao, Jin-Kao Efficient evaluations for solving large 0-1 unconstrained quadratic optimisation problems. (English) Zbl 1219.90104 Int. J. Metaheuristics 1, No. 1, 3-10 (2010). MSC: 90C09 90C20 90C59 PDF BibTeX XML Cite \textit{F. Glover} and \textit{J.-K. Hao}, Int. J. Metaheuristics 1, No. 1, 3--10 (2010; Zbl 1219.90104) Full Text: DOI OpenURL
Reed, M. B. L-Broyden methods: a generalization of the L-BFGS method to the limited-memory Broyden family. (English) Zbl 1165.65032 Int. J. Comput. Math. 86, No. 4, 606-615 (2009). MSC: 65K05 90C30 90C53 PDF BibTeX XML Cite \textit{M. B. Reed}, Int. J. Comput. Math. 86, No. 4, 606--615 (2009; Zbl 1165.65032) Full Text: DOI Link OpenURL
Frimannslund, Lennart; Steihaug, Trond A generating set search method using curvature information. (English) Zbl 1171.90552 Comput. Optim. Appl. 38, No. 1, 105-121 (2007). MSC: 90C56 65K05 PDF BibTeX XML Cite \textit{L. Frimannslund} and \textit{T. Steihaug}, Comput. Optim. Appl. 38, No. 1, 105--121 (2007; Zbl 1171.90552) Full Text: DOI OpenURL
Kochenberger, Gary; Glover, fred; Alidaee, Bahram; Lewis, Karen Using the unconstrained quadratic program to model and solve Max 2-SAT problems. (English) Zbl 1100.90059 Int. J. Oper. Res. 1, No. 1-2, 89-100 (2005). MSC: 90C59 68W40 PDF BibTeX XML Cite \textit{G. Kochenberger} et al., Int. J. Oper. Res. 1, No. 1--2, 89--100 (2005; Zbl 1100.90059) OpenURL
Ford, J. A.; Tharmlikit, S. Three-step fixed-point quasi-Newton methods for unconstrained optimisation. (English) Zbl 1086.65059 Comput. Math. Appl. 50, No. 7, 1051-1060 (2005). MSC: 65K05 90C30 90C53 PDF BibTeX XML Cite \textit{J. A. Ford} and \textit{S. Tharmlikit}, Comput. Math. Appl. 50, No. 7, 1051--1060 (2005; Zbl 1086.65059) Full Text: DOI OpenURL
Ford, J. A.; Moghrabi, I. A. The use of alternation and recurrences in two-step quasi-Newton methods. (English) Zbl 1086.65058 Comput. Math. Appl. 50, No. 7, 1041-1050 (2005). MSC: 65K05 90C30 90C53 PDF BibTeX XML Cite \textit{J. A. Ford} and \textit{I. A. Moghrabi}, Comput. Math. Appl. 50, No. 7, 1041--1050 (2005; Zbl 1086.65058) Full Text: DOI OpenURL
Moklyachuk, M. P. Fundamentals of convex analysis. (Osnovy opuklogo analizu.) (Ukrainian) Zbl 1104.49001 Kiev: TViMS (ISBN 966-95255-9-4). 240 p. (2004). Reviewer: Yu. V. Kozachenko (Kyïv) MSC: 49-01 90-01 49J52 90C25 PDF BibTeX XML Cite \textit{M. P. Moklyachuk}, Osnovy opuklogo analizu (Ukrainian). Kiev: TViMS (2004; Zbl 1104.49001) OpenURL
Byatt, D.; Coope, I. D.; Price, C. J. Conjugate grids for unconstrained optimisation. (English) Zbl 1062.90063 Comput. Optim. Appl. 29, No. 1, 49-68 (2004). MSC: 90C30 65K05 PDF BibTeX XML Cite \textit{D. Byatt} et al., Comput. Optim. Appl. 29, No. 1, 49--68 (2004; Zbl 1062.90063) Full Text: DOI OpenURL
Boyd, Stephen; Vandenberghe, Lieven Convex optimization. (English) Zbl 1058.90049 Cambridge University Press (ISBN 0-521-83378-7/hbk). xiii, 716 p. (2004). Reviewer: Carlos Narciso Bouza Herrera (Habana) MSC: 90C25 90-01 90-02 90C90 PDF BibTeX XML Cite \textit{S. Boyd} and \textit{L. Vandenberghe}, Convex optimization. Cambridge University Press (2004; Zbl 1058.90049) Full Text: Link OpenURL
Ford, J. A.; Tharmlikit, S. New implicit updates in multi-step quasi-Newton methods for unconstrained optimisation. (English) Zbl 1025.65035 J. Comput. Appl. Math. 152, No. 1-2, 133-146 (2003). MSC: 65K05 90C53 90C30 PDF BibTeX XML Cite \textit{J. A. Ford} and \textit{S. Tharmlikit}, J. Comput. Appl. Math. 152, No. 1--2, 133--146 (2003; Zbl 1025.65035) Full Text: DOI OpenURL
Mongeau, M.; Karsenty, H.; Rouzé, V.; Hiriart-Urruty, J.-B. Comparison of public-domain software for black box global optimization. (English) Zbl 0963.90062 Optim. Methods Softw. 13, No. 3, 203-226 (2000). Reviewer: D.Nowack (Berlin) MSC: 90C30 90C29 90-08 PDF BibTeX XML Cite \textit{M. Mongeau} et al., Optim. Methods Softw. 13, No. 3, 203--226 (2000; Zbl 0963.90062) Full Text: DOI OpenURL
Coetzee, Louis; Botha, Elizabeth C. The parallel downhill simplex algorithm for unconstrained optimisation. (English) Zbl 0907.65055 Concurrency Pract. Exp. 10, No. 2, 121-137 (1998). MSC: 65K05 65Y05 90C05 PDF BibTeX XML Cite \textit{L. Coetzee} and \textit{E. C. Botha}, Concurrency Pract. Exp. 10, No. 2, 121--137 (1998; Zbl 0907.65055) Full Text: DOI OpenURL
Deng, Naiyang; Yu, Wenci On Powell’s (1964) method and its modifications. (English) Zbl 0664.90078 Operational Research, Proc. 11th IFORS int. Conf., Buenos Aires 1987, 863-874 (1988). MSC: 90C30 65K05 PDF BibTeX XML OpenURL
Crisfield, M. A. Accelerating and damping the modified Newton-Raphson method. (English) Zbl 0526.65039 Comput. Struct. 18, 395-407 (1984). MSC: 65H10 PDF BibTeX XML Cite \textit{M. A. Crisfield}, Comput. Struct. 18, 395--407 (1984; Zbl 0526.65039) Full Text: DOI OpenURL
Gomulka, J. Decomposition algorithms for smooth unconstrained optimisation problems. (English) Zbl 0454.90064 Numerical optimisation of dynamic systems, 269-276 (1980). MSC: 90C30 65K05 PDF BibTeX XML OpenURL
McKeown, J. J. An approach to sensitivity analysis. (English) Zbl 0441.90099 Numerical optimisation of dynamic systems, 349-362 (1980). MSC: 90C30 65K05 PDF BibTeX XML OpenURL