Descending dimension algorithm for nonlinear optimization problem with linear equality constraints

DOI10.11721/CQNUJ20160413MaRDI QIDQ5276702zbMATH OpenFDO

Authors Heshuai Shen, Zemin Li

Publication date 14 July 2017

Full work available at URL https://doi.org/10.11721/CQNUJ20160413

zbMATH Keywords

linear equality constraintnonlinear least squares problemnonlinear programming

Mathematics Subject Classification ID

Existence of optimal solutions belonging to restricted classes (Lipschitz controls, bang-bang controls, etc.) (49J30) Nonlinear programming (90C30)

Recommendations

• Descending dimension algorithm for nonlinear optimization problem with mixed linear constraints
• A nonmonotonic trust region method for constrained optimization problems
• Sequential equality-constrained optimization for nonlinear programming
• scientific article; zbMATH DE number 883157
• A feasible equality constrained SQP algorithm for nonlinear optimization

Cited in

(3)

• Decoupling linear and nonlinear regimes: an evaluation of efficiency for nonlinear multidimensional optimization
• A derivative-free algorithm for non-linear optimization with linear equality constraints
• Descending dimension algorithm for nonlinear optimization problem with mixed linear constraints

This page was built for publication: Descending dimension algorithm for nonlinear optimization problem with linear equality constraints

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