On per-iteration complexity of high order Chebyshev methods for sparse functions with banded Hessians (Q403098): Difference between revisions

@@ Property / Mathematics Subject Classification ID @@
+M37
@@ Property / Mathematics Subject Classification ID: 49M37 / rank @@
+Normal rank
@@ Property / Mathematics Subject Classification ID @@
+C30
@@ Property / Mathematics Subject Classification ID: 90C30 / rank @@
+Normal rank
@@ Property / Mathematics Subject Classification ID @@
+C60
@@ Property / Mathematics Subject Classification ID: 90C60 / rank @@
+Normal rank
@@ Property / Mathematics Subject Classification ID @@
+Q25
@@ Property / Mathematics Subject Classification ID: 68Q25 / rank @@
+Normal rank
@@ Property / zbMATH DE Number @@
+6335815
@@ Property / zbMATH DE Number: 6335815 / rank @@
+Normal rank
@@ Property / zbMATH Keywords @@
+optimization
@@ Property / zbMATH Keywords: optimization / rank @@
+Normal rank
@@ Property / zbMATH Keywords @@
+high order Chebyshev methods
@@ Property / zbMATH Keywords: high order Chebyshev methods / rank @@
+Normal rank
@@ Property / zbMATH Keywords @@
+sparse functions
@@ Property / zbMATH Keywords: sparse functions / rank @@
+Normal rank
@@ Property / zbMATH Keywords @@
+banded Hessians
@@ Property / zbMATH Keywords: banded Hessians / rank @@
+Normal rank
@@ Property / zbMATH Keywords @@
+algorithm complexity
@@ Property / zbMATH Keywords: algorithm complexity / rank @@
+Normal rank
@@ Property / zbMATH Keywords @@
+automatic differentiation
@@ Property / zbMATH Keywords: automatic differentiation / rank @@
+Normal rank

Revision as of 17:49, 29 June 2023