Two-point mid-range approximation enhanced recursive quadratic programming method
From MaRDI portal
Recommendations
- Enhanced two-point diagonal quadratic approximation methods for design optimization
- scientific article; zbMATH DE number 7024493
- scientific article; zbMATH DE number 7590223
- Recursive quadratic programming methods based on the augmented lagrangian
- Two-parameters quasi-filled function algorithm for nonlinear integer programming
- scientific article; zbMATH DE number 3908174
- Recursive quadratic methods with the use of consistent approximations for semi-infinite programming problems
- A quasiconcave minimization method for solving linear two-level programs
- An efficient solution method for rank two quasiconcave minimization problems
- The quadratic semi-definite programming problem and its interior point algorithm
Cites work
- scientific article; zbMATH DE number 983169 (Why is no real title available?)
- A hybrid optimization method and its role in computer-aided design
- A recursive quadratic programming method with active set strategy for optimal design
- An active set RQP algorithm for engineering design optimization
- Improved two-point function approximations for design optimization
- Performance of some SQP algorithms on structural design problems
- The nonlinear programming method of Wilson, Han, and Powell with an augmented Lagrangian type line search function. II. An efficient implementation with linear least squares subproblems
This page was built for publication: Two-point mid-range approximation enhanced recursive quadratic programming method
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q438491)
