Mathematical Research Data Initiative
Main page
Recent changes
Random page
SPARQL
MaRDI@GitHub
New item
In other projects
MaRDI portal item
Discussion
View source
View history
English
Log in

A filter-free sequential quadratic programming algorithm with infeasibility detection

From MaRDI portal
Publication:3176022
Jump to:navigation, search

zbMATH Open1399.90294MaRDI QIDQ3176022FDOQ3176022

Xinwei Liu, Dongmei Liu, Ailing Yan

Publication date: 18 July 2018





Recommendations

  • An infeasible QP-free algorithm without a penalty function or a filter for nonlinear inequality-constrained optimization
  • The SQP filter algorithm for solving inequality constrained optimization problems
  • scientific article; zbMATH DE number 5669751
  • A sequential quadratic programming algorithm without a penalty function, a filter or a constraint qualification for inequality constrained optimization
  • An SQP-filter method without restoration process


zbMATH Keywords

sequential quadratic programmingnonlinear constrained optimizationinfeasibility detection


Mathematics Subject Classification ID

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



Cited In (2)

  • Title not available (Why is that?)
  • A filter SQP algorithm without a feasibility restoration phase





This page was built for publication: A filter-free sequential quadratic programming algorithm with infeasibility detection

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

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:3176022&oldid=16411567"
Tools
What links here
Related changes
Printable version
Permanent link
Page information
This page was last edited on 4 February 2024, at 05:00. Warning: Page may not contain recent updates.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki