An SQP algorithm for solving semi-infinite programming problem

MaRDI QIDQ3131795zbMATH OpenFDO

Authors

Publication date 29 January 2018

zbMATH Keywords

convergencesemi-infinite programmingSQP algorithm

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Semi-infinite programming (90C34)

Recommendations

• Global convergence of a robust smoothing SQP method for semi-infinite programming
• scientific article; zbMATH DE number 6452999
• On solving convex quadratic semi-infinite programming probelms
• Recursive quadratic methods with the use of consistent approximations for semi-infinite programming problems
• scientific article; zbMATH DE number 48566

Cited in

(6)

• scientific article; zbMATH DE number 16625 (Why is no real title available?)
• scientific article; zbMATH DE number 7338817 (Why is no real title available?)
• scientific article; zbMATH DE number 6452999 (Why is no real title available?)
• scientific article; zbMATH DE number 48566 (Why is no real title available?)
• A non-monotone SQP algorithm with L-BFGS update for solving semi-infinite minimax problem based on active set technique
• Stochastic algorithm for solving convex semi-infinite problem with equality and inequality constraints

This page was built for publication: An SQP algorithm for solving semi-infinite programming problem

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