A first order method for finding minimal norm-like solutions of convex optimization problems (Q463716): Difference between revisions

@@ Property / author @@
+Amir Beck
@@ Property / author: Amir Beck / rank @@
+Normal rank
@@ Property / Mathematics Subject Classification ID @@
+C05
@@ Property / Mathematics Subject Classification ID: 90C05 / rank @@
+Normal rank
@@ Property / Mathematics Subject Classification ID @@
+C25
@@ Property / Mathematics Subject Classification ID: 90C25 / rank @@
+Normal rank
@@ Property / Mathematics Subject Classification ID @@
+C30
@@ Property / Mathematics Subject Classification ID: 90C30 / rank @@
+Normal rank
@@ Property / Mathematics Subject Classification ID @@
+K05
@@ Property / Mathematics Subject Classification ID: 65K05 / rank @@
+Normal rank
@@ Property / Mathematics Subject Classification ID @@
+F22
@@ Property / Mathematics Subject Classification ID: 65F22 / rank @@
+Normal rank
@@ Property / zbMATH DE Number @@
+6357712
@@ Property / zbMATH DE Number: 6357712 / rank @@
+Normal rank
@@ Property / zbMATH Keywords @@
+bilevel optimization
@@ Property / zbMATH Keywords: bilevel optimization / rank @@
+Normal rank
@@ Property / zbMATH Keywords @@
+complexity analysis
@@ Property / zbMATH Keywords: complexity analysis / rank @@
+Normal rank
@@ Property / zbMATH Keywords @@
+convex minimization
@@ Property / zbMATH Keywords: convex minimization / rank @@
+Normal rank
@@ Property / zbMATH Keywords @@
+minimal norm solution
@@ Property / zbMATH Keywords: minimal norm solution / rank @@
+Normal rank

Revision as of 13:26, 30 June 2023