Solving nonlinear programming problems with very many constraints (Q4327941): 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.1080/02331939208843818
+Normal rank
@@ Property / OpenAlex ID @@
+W2019128690
@@ Property / OpenAlex ID: W2019128690 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3337235
@@ Property / cites work: Q3337235 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4739659
@@ Property / cites work: Q4739659 / rank @@
+Normal rank
@@ Property / cites work @@
+A numerically stable dual method for solving strictly convex quadratic programs
+Normal rank
@@ Property / cites work @@
+Combined lp and quasi-Newton methods for minimax optimization
+Normal rank
@@ Property / cites work @@
+Superlinearly convergent variable metric algorithms for general nonlinear programming problems
+Normal rank
@@ Property / cites work @@
+A globally convergent method for nonlinear programming
+Normal rank
@@ Property / cites work @@
+Algorithms for nonlinear constraints that use lagrangian functions
+Normal rank
@@ Property / cites work @@
+On the quadratic programming algorithm of Goldfarb and Idnani
+Normal rank
@@ Property / cites work @@
+On the convergence of a sequential quadratic programming method with an augmented lagrangian line search function
+Normal rank
@@ Property / cites work @@
+A comparative study of several semi-infinite nonlinear programming algorithms
+Normal rank