A new fast method to compute saddle-points in constrained optimization and applications (Q427575): Difference between revisions

@@ Property / Mathematics Subject Classification ID @@
+K05
@@ Property / Mathematics Subject Classification ID: 65K05 / rank @@
+Normal rank
@@ Property / Mathematics Subject Classification ID @@
+C30
@@ Property / Mathematics Subject Classification ID: 90C30 / rank @@
+Normal rank
@@ Property / zbMATH DE Number @@
+6046280
@@ Property / zbMATH DE Number: 6046280 / rank @@
+Normal rank
@@ Property / zbMATH Keywords @@
+constrained optimization
@@ Property / zbMATH Keywords: constrained optimization / rank @@
+Normal rank
@@ Property / zbMATH Keywords @@
+saddle-point problems
@@ Property / zbMATH Keywords: saddle-point problems / rank @@
+Normal rank
@@ Property / zbMATH Keywords @@
+augmented Lagrangian
@@ Property / zbMATH Keywords: augmented Lagrangian / rank @@
+Normal rank
@@ Property / zbMATH Keywords @@
+penalty method
@@ Property / zbMATH Keywords: penalty method / rank @@
+Normal rank
@@ Property / zbMATH Keywords @@
+splitting prediction
@@ Property / zbMATH Keywords: splitting prediction / rank @@
+Normal rank
@@ Property / zbMATH Keywords @@
+correction scheme
@@ Property / zbMATH Keywords: correction scheme / rank @@
+Normal rank
@@ Property / zbMATH Keywords @@
+vector penalty-projection methods
@@ Property / zbMATH Keywords: vector penalty-projection methods / rank @@
+Normal rank

Revision as of 23:07, 29 June 2023