The vector exact \(l_{1}\) penalty method for nondifferentiable convex multiobjective programming problems (Q440840): Difference between revisions

@@ Property / Mathematics Subject Classification ID @@
+C29
@@ Property / Mathematics Subject Classification ID: 90C29 / rank @@
+Normal rank
@@ Property / Mathematics Subject Classification ID @@
+C25
@@ Property / Mathematics Subject Classification ID: 90C25 / rank @@
+Normal rank
@@ Property / zbMATH DE Number @@
+6068345
@@ Property / zbMATH DE Number: 6068345 / rank @@
+Normal rank
@@ Property / zbMATH Keywords @@
+multiobjective programming
@@ Property / zbMATH Keywords: multiobjective programming / rank @@
+Normal rank
@@ Property / zbMATH Keywords @@
+(Weak) Pareto optimal point
@@ Property / zbMATH Keywords: (Weak) Pareto optimal point / rank @@
+Normal rank
@@ Property / zbMATH Keywords @@
+vector exact \(l_{1}\) penalty function
@@ Property / zbMATH Keywords: vector exact \(l_{1}\) penalty function / rank @@
+Normal rank
@@ Property / zbMATH Keywords @@
+penalized vector optimization problem
@@ Property / zbMATH Keywords: penalized vector optimization problem / rank @@
+Normal rank
@@ Property / zbMATH Keywords @@
+convex function
@@ Property / zbMATH Keywords: convex function / rank @@
+Normal rank

Revision as of 02:00, 30 June 2023