A dual approach to solving nonlinear programming problems by unconstrained optimization (Q4767127): Difference between revisions

@@ Property / cites work @@
+A general saddle point result for constrained optimization
+Normal rank
@@ Property / cites work @@
+Q5588268
@@ Property / cites work: Q5588268 / rank @@
+Normal rank
@@ Property / cites work @@
+Q5675557
@@ Property / cites work: Q5675557 / rank @@
+Normal rank
@@ Property / cites work @@
+A new method for the optimization of a nonlinear function subject to nonlinear constraints
+Normal rank
@@ Property / cites work @@
+Multiplier and gradient methods
@@ Property / cites work: Multiplier and gradient methods / rank @@
+Normal rank
@@ Property / cites work @@
+Q5677294
@@ Property / cites work: Q5677294 / rank @@
+Normal rank
@@ Property / cites work @@
+Q5650526
@@ Property / cites work: Q5650526 / rank @@
+Normal rank
@@ Property / cites work @@
+Use of the augmented penalty function in mathematical programming problems. I
+Normal rank
@@ Property / cites work @@
+Q5686600
@@ Property / cites work: Q5686600 / rank @@
+Normal rank
@@ Property / cites work @@
+On the method of multipliers for mathematical programming problems
+Normal rank
@@ Property / cites work @@
+Q5590418
@@ Property / cites work: Q5590418 / rank @@
+Normal rank
@@ Property / cites work @@
+Convex Analysis
@@ Property / cites work: Convex Analysis / rank @@
+Normal rank
@@ Property / cites work @@
+Ordinary convex programs without a duality gap
@@ Property / cites work: Ordinary convex programs without a duality gap / rank @@
+Normal rank
@@ Property / cites work @@
+The multiplier method of Hestenes and Powell applied to convex programming
+Normal rank