A class of programming problems whose objective function contains a norm (Q1254496): Difference between revisions

@@ 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.1016/0021-9045(78)90091-6
+Normal rank
@@ Property / OpenAlex ID @@
+W2011986332
@@ Property / OpenAlex ID: W2011986332 / rank @@
+Normal rank
@@ Property / cites work @@
+On an algorithm for best approximate solutions to Av=b in normed linear spaces
+Normal rank
@@ Property / cites work @@
+Algorithms for solving the dual problem for Av = b with varying norms
+Normal rank
@@ Property / cites work @@
+Q5543516
@@ Property / cites work: Q5543516 / rank @@
+Normal rank
@@ Property / cites work @@
+Q5588268
@@ Property / cites work: Q5588268 / rank @@
+Normal rank
@@ Property / cites work @@
+Q5543004
@@ Property / cites work: Q5543004 / rank @@
+Normal rank
@@ Property / cites work @@
+A class of nondifferentiable mathematical programming problems
+Normal rank
@@ Property / cites work @@
+A programming problem with an <i>L<sub>p</sub></i> norm in the objective function
+Normal rank
@@ Property / cites work @@
+Symmetric duality, and a convergent subgradient method for discrete, linear, constrained approximation problems with arbitrary norms appearing in the objective function and in the constraints
+Normal rank
@@ Property / cites work @@
+Q5638112
@@ Property / cites work: Q5638112 / rank @@
+Normal rank
@@ Property / cites work @@
+Solutions of overdetermined linear equations which minimize error in an abstract norm
+Normal rank
@@ Property / cites work @@
+Least squares algorithms for finding solutions of overdetermined linear equations which minimize error in an abstract norm
+Normal rank