On the choice of step size in subgradient optimization (Q1149883): Difference between revisions

@@ Property / MaRDI profile type @@
+Publication
@@ Property / MaRDI profile type: Publication / rank @@
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1016/0377-2217(81)90096-5
+Normal rank
@@ Property / OpenAlex ID @@
+W2064986600
@@ Property / OpenAlex ID: W2064986600 / rank @@
+Normal rank
@@ Property / cites work @@
+Solution of a Large-Scale Traveling-Salesman Problem
+Normal rank
@@ Property / cites work @@
+A Dynamic Programming Approach to Sequencing Problems
+Normal rank
@@ Property / cites work @@
+Validation of subgradient optimization
@@ Property / cites work: Validation of subgradient optimization / rank @@
+Normal rank
@@ Property / cites work @@
+The Traveling-Salesman Problem and Minimum Spanning Trees
+Normal rank
@@ Property / cites work @@
+The traveling-salesman problem and minimum spanning trees: Part II
+Normal rank
@@ Property / cites work @@
+Q5566712
@@ Property / cites work: Q5566712 / rank @@
+Normal rank
@@ Property / cites work @@
+Minimization of unsmooth functionals
@@ Property / cites work: Minimization of unsmooth functionals / rank @@
+Normal rank
@@ Property / cites work @@
+Q5638112
@@ Property / cites work: Q5638112 / rank @@
+Normal rank
@@ links / mardi / name / links / mardi / name @@
+Publication:1149883