A method for minimizing convex functions based on continuous approximations to the subdifferential (Q4391285): Difference between revisions

@@ Property / author @@
-Adil M. Bagirov
@@ Property / author: Adil M. Bagirov / rank @@
-Normal rank
@@ Property / author @@
+Adil M. Bagirov
@@ Property / author: Adil M. Bagirov / rank @@
+Normal rank
@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1080/10556789808805683
+Normal rank
@@ Property / OpenAlex ID @@
+W2014786863
@@ Property / OpenAlex ID: W2014786863 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4051509
@@ Property / cites work: Q4051509 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4744875
@@ Property / cites work: Q4744875 / rank @@
+Normal rank
@@ Property / cites work @@
+Algorithm Models for Nondifferentiable Optimization
+Normal rank
@@ Property / cites work @@
+Q5187067
@@ Property / cites work: Q5187067 / 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
@@ links / mardi / name / links / mardi / name @@
+Publication:4391285