A novel global optimization method to solve nonlinear programming problem with bounded variables

DOI10.16183/J.CNKI.JSJTU.2016.06.008MaRDI QIDQ3180962zbMATH OpenFDO

Authors Xia Jin, Fuhai Duan, Xiuhong Jiang

Publication date 6 January 2017

Full work available at URL https://doi.org/10.16183/J.CNKI.JSJTU.2016.06.008

zbMATH Keywords

feasible regionglobal optimizationnonlinear programmingsequential quadratic programming algorithm

Mathematics Subject Classification ID

Numerical optimization and variational techniques (65K10) Quadratic programming (90C20) Nonconvex programming, global optimization (90C26) Nonlinear programming (90C30)

Recommendations

• A new interval approach to global optimization
• Global optimal algorithm for linear programming problems subjected to nonlinear constraints
• Trust-tech-based global optimization methodology for nonlinear programming
• scientific article; zbMATH DE number 4131970
• Calculation of bounds on variables satisfying nonlinear inequality constraints

This page was built for publication: A novel global optimization method to solve nonlinear programming problem with bounded variables

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