Global convergence analysis of algorithms for finding feasible points in norm-relaxed MFD (Q1280097): Difference between revisions

@@ Property / cites work @@
+Q3277015
@@ Property / cites work: Q3277015 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4721081
@@ Property / cites work: Q4721081 / rank @@
+Normal rank
@@ Property / cites work @@
+An efficient algorithm for solving inequalities
@@ Property / cites work: An efficient algorithm for solving inequalities / rank @@
+Normal rank
@@ Property / cites work @@
+Methods for finding feasible points in constrained optimization
+Normal rank
@@ Property / cites work @@
+On the Convergence of Some Feasible Direction Algorithms for Nonlinear Programming
+Normal rank
@@ Property / cites work @@
+Rate of Convergence of a Class of Methods of Feasible Directions
+Normal rank
@@ Property / cites work @@
+Norm-relaxed method of feasible directions for solving nonlinear programming problems
+Normal rank
@@ Property / cites work @@
+Convergence analysis of norm-relaxed method of feasible directions
+Normal rank
@@ Property / cites work @@
+Self-tuning norm-relaxed method of feasible directions
+Normal rank
@@ Property / cites work @@
+Test examples for nonlinear programming codes
@@ Property / cites work: Test examples for nonlinear programming codes / rank @@
+Normal rank
@@ Property / cites work @@
+More test examples for nonlinear programming codes
+Normal rank
@@ Property / cites work @@
+Generalization of Murty's direct algorithm to linear and convex quadratic programming
+Normal rank