Non-Euclidean restricted memory level method for large-scale convex optimization (Q1774171): Difference between revisions

@@ Property / full work available at URL @@
+https://doi.org/10.1007/s10107-004-0553-4
+Normal rank
@@ Property / OpenAlex ID @@
+W2006118023
@@ Property / OpenAlex ID: W2006118023 / rank @@
+Normal rank
@@ Property / Wikidata QID @@
+Q57392923
@@ Property / Wikidata QID: Q57392923 / rank @@
+Normal rank
@@ Property / cites work @@
+The Ordered Subsets Mirror Descent Optimization Method with Applications to Tomography
+Normal rank
@@ Property / cites work @@
+Q3840357
@@ Property / cites work: Q3840357 / rank @@
+Normal rank
@@ Property / cites work @@
+An aggregate subgradient method for nonsmooth convex minimization
+Normal rank
@@ Property / cites work @@
+Proximal level bundle methods for convex nondifferentiable optimization, saddle-point problems and variational inequalities
+Normal rank
@@ Property / cites work @@
+The Efficiency of Ballstep Subgradient Level Methods for Convex Optimization
+Normal rank
@@ Property / cites work @@
+Q3316093
@@ Property / cites work: Q3316093 / rank @@
+Normal rank
@@ Property / cites work @@
+New variants of bundle methods
@@ Property / cites work: New variants of bundle methods / rank @@
+Normal rank
@@ Property / cites work @@
+A modification and an extension of Lemarechal’s algorithm for nonsmooth minimization
+Normal rank
@@ Property / cites work @@
+Complexity estimates of some cutting plane methods based on the analytic barrier
+Normal rank
@@ Property / cites work @@
+Q5566712
@@ Property / cites work: Q5566712 / rank @@
+Normal rank
@@ Property / cites work @@
+A Version of the Bundle Idea for Minimizing a Nonsmooth Function: Conceptual Idea, Convergence Analysis, Numerical Results
+Normal rank