A local convergence analysis of bilevel decomposition algorithms

DOI10.1007/s11081-006-6835-3zbMath1176.90566OpenAlexW2026315925MaRDI QIDQ833417

Walter Murray, Victor DeMiguel

Publication date: 12 August 2009

Published in: Optimization and Engineering (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s11081-006-6835-3

zbMATH Keywords

decomposition algorithmsnonlinear programmingbilevel programmingmultidisciplinary design optimization (MDO)

Mathematics Subject Classification ID

Nonlinear programming (90C30)

Related Items

Novel collaborative optimization framework with a negotiation model for satellite system design, Comparing problem formulations for coupled sets of components, Benchmarking multidisciplinary design optimization algorithms, Block-separable linking constraints in augmented Lagrangian coordination, A classification of methods for distributed system optimization based on formulation structure, Multi-modality in augmented Lagrangian coordination for distributed optimal design, New approximation assisted multi-objective collaborative robust optimization (new AA-mcRO) under interval uncertainty, Multilevel decomposition based nondeterministic design optimization for structural systems, Efficiency for multiobjective multidisciplinary optimization problems with quasiseparable subproblems, Bilevel Optimization: Theory, Algorithms, Applications and a Bibliography

Uses Software

• NPSOL
• SLPTESTSET

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Introduction to sensitivity and stability analysis in nonlinear programming
• Computational study of the nonhierarchical decomposition algorithm
• Superlinear and quadratic convergence of some primal - dual interior point methods for constrained optimization
• Foundations of bilevel programming
• Multidisciplinary design optimization with quasiseparable subsystems
• Scenarios and Policy Aggregation in Optimization Under Uncertainty
• Numerical Optimization
• Problem Formulation for Multidisciplinary Optimization
• Generating quadratic bilevel programming test problems
• A Sequential Quadratic Programming Algorithm Using an Incomplete Solution of the Subproblem