Global optimality conditions for nonlinear programming problems with bounds via quadratic underestimators
From MaRDI portal
Publication:3553760
Recommendations
- Global optimality conditions for mixed integer nonlinear programming problems
- Necessary global optimality conditions for nonlinear programming problems
- Second-order sufficient optimality conditions for local and global nonlinear programming
- Global optimality conditions for nonlinear programming problems with linear equality constraints
- Global optimality conditions for nonconvex minimization problems with quadratic constraints
Cites work
- CONDITIONS FOR GLOBAL OPTIMALITY OF QUADRATIC MINIMIZATION PROBLEMS WITH LMI CONSTRAINTS
- Characterization of convexifiable functions
- Conditions for global optimality. II
- Global optimality conditions for quadratic optimization problems with binary constraints
- Global optimality conditions in maximizing a convex quadratic function under convex quadratic constraints
- Non-convex quadratic minimization problems with quadratic constraints: global optimality conditions
- Sufficient conditions for global optimality of bivalent nonconvex quadratic programs with inequality constraints
- Sufficient global optimality conditions for bivalent quadratic optimization
- Sufficient global optimality conditions for multi-extremal smooth minimisation problems with bounds and linear matrix inequality constraints
- Sufficient global optimality conditions for non-convex quadratic minimization problems with box constraints
This page was built for publication: Global optimality conditions for nonlinear programming problems with bounds via quadratic underestimators
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3553760)