An aggregate subgradient method for nonsmooth convex minimization (Q3039046): Difference between revisions

@@ Property / cites work @@
+Quasi-Newton Methods, Motivation and Theory
@@ Property / cites work: Quasi-Newton Methods, Motivation and Theory / rank @@
+Normal rank
@@ Property / cites work @@
+The Cutting-Plane Method for Solving Convex Programs
+Normal rank
@@ Property / cites work @@
+Q5630824
@@ Property / cites work: Q5630824 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4182272
@@ Property / cites work: Q4182272 / rank @@
+Normal rank
@@ Property / cites work @@
+The B<scp>oxstep</scp> Method for Large-Scale Optimization
+Normal rank
@@ Property / cites work @@
+An Algorithm for Constrained Optimization with Semismooth Functions
+Normal rank
@@ Property / cites work @@
+A modification and an extension of Lemarechal’s algorithm for nonsmooth minimization
+Normal rank
@@ Property / cites work @@
+Q4739675
@@ Property / cites work: Q4739675 / rank @@
+Normal rank
@@ Property / cites work @@
+Finding the nearest point in A polytope
@@ Property / cites work: Finding the nearest point in A polytope / rank @@
+Normal rank
@@ Property / cites work @@
+Q4199833
@@ Property / cites work: Q4199833 / rank @@
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1007/bf02591907
+Normal rank
@@ Property / OpenAlex ID @@
+W2039110678
@@ Property / OpenAlex ID: W2039110678 / rank @@
+Normal rank