An active set strategy for solving optimization problems with up to 200,000,000 nonlinear constraints (Q731965): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: An algorithm for nonlinear optimization using linear programming and equality constrained subproblems / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q3517228 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: A numerically stable dual method for solving strictly convex quadratic programs / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: A computational study of active set strategies in nonlinear programming with linear constraints / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: On the convergence of a sequential quadratic programming method with an augmented lagrangian line search function / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Solving nonlinear programming problems with very many constraints / rank | |||
Normal rank | |||
Revision as of 00:12, 2 July 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | An active set strategy for solving optimization problems with up to 200,000,000 nonlinear constraints |
scientific article |
Statements
An active set strategy for solving optimization problems with up to 200,000,000 nonlinear constraints (English)
0 references
9 October 2009
0 references
sequential quadratic programming
0 references
nonlinear programming
0 references
many constraints
0 references
active set strategy
0 references
line search
0 references
convergence
0 references
numerical results
0 references
0 references
0 references
0 references
