A simple decomposition based SQP algorithm for large scale nonlinear programming

MaRDI QIDQ3539527zbMATH OpenFDO

Authors Mehdi Lachiheb, Hichem Smaoui

Publication date 18 November 2008

Full work available at URL http://www.ici.ro/camo/journal/v10n1.htm

zbMATH Keywords

extreme pointstructural optimization.

Mathematics Subject Classification ID

Methods of successive quadratic programming type (90C55) Large-scale problems in mathematical programming (90C06) Nonlinear programming (90C30)

Recommendations

• A decomposition algorithm for solving large-scale quadratic programming problems
• A Practical Algorithm for General Large Scale Nonlinear Optimization Problems
• A new SQP algorithm for large-scale nonlinear programming
• Two-level decomposition in sequential quadratic programming with penalty functions
• SQP methods for large-scale nonlinear programming

Cited in

(5)

• Two-level decomposition in sequential quadratic programming with penalty functions
• A decomposition procedure based on approximate Newton directions
• A feasible descent decomposition algorithm for large-scale quadratic programming
• A decomposition algorithm for solving large-scale quadratic programming problems
• A combined SQP-IPM algorithm for solving large-scale nonlinear optimization problems

Describes a project that uses

Uses Software

• NLPQLP

This page was built for publication: A simple decomposition based SQP algorithm for large scale nonlinear programming

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3539527)