Very large scale optimization by sequential convex programming

DOI10.1080/10556780410001647195zbMath1074.90028OpenAlexW2024435613MaRDI QIDQ4673327

Klaus Schittkowski, K. Moritzen, Christian Zillober

Publication date: 29 April 2005

Published in: Optimization Methods and Software (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/10556780410001647195

zbMATH Keywords

semilinear elliptic equationstopology optimizationsequential convex programminglarge scale nonlinear programmingoptimal control of partial differential equations

Mathematics Subject Classification ID

Convex programming (90C25) Large-scale problems in mathematical programming (90C06)

Related Items (4)

First-order sequential convex programming using approximate diagonal QP subproblems ⋮ An algorithm for the topology optimization of geometrically nonlinear structures ⋮ EXPLOITING SEMI-ANALYTICAL SENSITIVITIES FROM LINEAR AND NON-LINEAR FINITE ELEMENT ANALYSES FOR COMPOSITE PANEL OPTIMIZATION ⋮ A linear programming-based optimization algorithm for solving nonlinear programming problems

Uses Software

• AMPL
• CONLIN

Cites Work

• Unnamed Item
• An interior-point algorithm for nonconvex nonlinear programming
• Optimization techniques for solving elliptic control problems with control and state constraints. I: Boundary control
• On the convergence of a sequential quadratic programming method with an augmented lagrangian line search function
• Structural optimization: A new dual method using mixed variables
• The method of moving asymptotes—a new method for structural optimization
• Augemented Lagrangian Techniques for Elliptic State Constrained Optimal Control Problems
• Augmented Lagrangian-SQP-Methods in Hilbert Spaces and Application to Control in the Coefficients Problems
• Augmented Lagrange Multiplier Functions and Duality in Nonconvex Programming
• Optimization techniques for solving elliptic control problems with control and state constraints. II: Distributed control
• Global convergence of a nonlinear programming method using convex approximations
• A combined convex approximation -- interior point approach for large scale nonlinear programming

This page was built for publication: Very large scale optimization by sequential convex programming