First-order sequential convex programming using approximate diagonal QP subproblems
From MaRDI portal
Recommendations
- scientific article; zbMATH DE number 775098
- Nonlinear programming: algorithms, software, and application. From small to very large scale optimization
- Performance of some SQP algorithms on structural design problems
- Very large scale optimization by sequential convex programming
- A combined convex approximation -- interior point approach for large scale nonlinear programming
Cites work
- scientific article; zbMATH DE number 3993295 (Why is no real title available?)
- scientific article; zbMATH DE number 5060482 (Why is no real title available?)
- A class of globally convergent optimization methods based on conservative convex separable approximations
- A combined convex approximation -- interior point approach for large scale nonlinear programming
- A modification of convex approximation methods for structural optimization
- A quadratic approximation for structural topology optimization
- Algorithm 778: L-BFGS-B
- Approximated approximations for SAO
- Efficient approximation concepts using second order information
- Enhanced two-point diagonal quadratic approximation methods for design optimization
- GALAHAD, a library of thread-safe Fortran 90 packages for large-scale nonlinear optimization
- Incomplete series expansion for function approximation
- Lagrange multipliers and nonlinear programming
- Large-scale topology optimization in 3D using parallel computing
- Numerical methods for large-scale nonlinear optimization
- Review of options for structural design sensitivity analysis. I: Linear systems
- Sequential approximate optimization using dual subproblems based on incomplete series expansions
- Structural optimization: A new dual method using mixed variables
- Structural weight optimization by dual methods of convex programming
- The method of moving asymptotes—a new method for structural optimization
- Trust Region Methods
- Very large scale optimization by sequential convex programming
Cited in
(11)- A new method for optimizing the topology of hinge-free and fully decoupled compliant mechanisms with multiple inputs and multiple outputs
- Machine learning based topology optimization of fiber orientation for variable stiffness composite structures
- Second-order design sensitivity analysis using diagonal hyper-dual numbers
- Continuum structural topological optimizations with stress constraints based on an active constraint technique
- An algorithm for the topology optimization of geometrically nonlinear structures
- On sequential approximate simultaneous analysis and design in classical topology optimization
- Enhanced sequential approximate programming using second order reliability method for accurate and efficient structural reliability-based design optimization
- Explicit model of dual programming and solving method for a class of separable convex programming problems
- Approximated approximations for SAO
- Positive definite separable quadratic programs for non-convex problems
- The Lagrange method and SAO with bounds on the dual variables
This page was built for publication: First-order sequential convex programming using approximate diagonal QP subproblems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q381733)
