First-order sequential convex programming using approximate diagonal QP subproblems

DOI10.1007/s00158-011-0739-3zbMath1274.90378OpenAlexW2126966989MaRDI QIDQ381733

Albert A. Groenwold, L. F. P. Etman, Jacobus E. Rooda

Publication date: 15 November 2013

Published in: Structural and Multidisciplinary Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00158-011-0739-3

zbMATH Keywords

trust region methoddiagonal quadratic approximationsequential approximate optimization (SAO)reciprocal intervening variablessequential convex programming (SCP)sequential quadratic programming (SQP)

Mathematics Subject Classification ID

Nonlinear programming (90C30) Methods of successive quadratic programming type (90C55)

Related Items (6)

Explicit model of dual programming and solving method for a class of separable convex programming problems ⋮ Positive definite separable quadratic programs for non-convex problems ⋮ An algorithm for the topology optimization of geometrically nonlinear structures ⋮ The Lagrange method and SAO with bounds on the dual variables ⋮ Enhanced sequential approximate programming using second order reliability method for accurate and efficient structural reliability-based design optimization ⋮ On sequential approximate simultaneous analysis and design in classical topology optimization

Uses Software

• L-BFGS-B
• GALAHAD
• SCPIP

Cites Work

• Unnamed Item
• Unnamed Item
• Incomplete series expansion for function approximation
• Sequential approximate optimization using dual subproblems based on incomplete series expansions
• Approximated approximations for SAO
• Enhanced two-point diagonal quadratic approximation methods for design optimization
• Review of options for structural design sensitivity analysis. I: Linear systems
• Lagrange multipliers and nonlinear programming
• A Class of Globally Convergent Optimization Methods Based on Conservative Convex Separable Approximations
• Numerical methods for large-scale nonlinear optimization
• A quadratic approximation for structural topology optimization
• Structural optimization: A new dual method using mixed variables
• The method of moving asymptotes—a new method for structural optimization
• Structural weight optimization by dual methods of convex programming
• Algorithm 778: L-BFGS-B
• A modification of convex approximation methods for structural optimization
• Trust Region Methods
• Very large scale optimization by sequential convex programming
• GALAHAD, a library of thread-safe Fortran 90 packages for large-scale nonlinear optimization
• Efficient approximation concepts using second order information
• Large-scale topology optimization in 3D using parallel computing
• A combined convex approximation -- interior point approach for large scale nonlinear programming

This page was built for publication: First-order sequential convex programming using approximate diagonal QP subproblems