( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
Interior-point methods for linear optimization based on a kernel function with a trigonometric barrier term.

, , , и . J. Comput. Appl. Math., 236 (15): 3613-3623 (2012)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed.

Trond Lyngbø

Trond Stokke

Trond Ryberg

Markus Tröndle

Louise Trondl

 

Другие публикации лиц с тем же именем

Computational science in the eighteenth century. Test cases for the methods of Newton, Raphson, and Halley: 1685 to 1745.. Numer. Algorithms, 83 (4): 1259-1275 (2020)Data structures in Java for matrix computations., и . Concurr. Pract. Exp., 16 (8): 799-815 (2004)A generic primal-dual interior-point method for semidefinite optimization based on a new class of kernel functions., , и . Optim. Methods Softw., 25 (3): 387-403 (2010)Algorithm for forming derivative-free optimal methods., и . Numer. Algorithms, 65 (4): 809-824 (2014)Interior-point methods for linear optimization based on a kernel function with a trigonometric barrier term., , , и . J. Comput. Appl. Math., 236 (15): 3613-3623 (2012)A Test Problem Generator for Large-Scale Unconstrained Optimization., и . ACM Trans. Math. Softw., 11 (2): 97-102 (1985)An Analytical Model for a Class of Architectures under Master-Slave Paradigm., и . HPCN Europe, том 1823 из Lecture Notes in Computer Science, стр. 601-604. Springer, (2000)On The Use of Java Arrays for Sparse Matrix Computations., и . PARCO, том 13 из Advances in Parallel Computing, стр. 119-126. Elsevier, (2003)Solving trust-region subproblem augmented with linear inequality constraints., и . Optim. Methods Softw., 28 (1): 26-36 (2013)Sparsity in higher order methods for unconstrained optimization., и . Optim. Methods Softw., 27 (2): 275-294 (2012)