A trust region SQP algorithm for mixed-integer nonlinear programming
From MaRDI portal
Publication:2463830
Recommendations
- A comparative study of SQP-type algorithms for nonlinear and nonconvex mixed-integer optimization
- Integrating SQP and branch-and-bound for mixed integer nonlinear programming
- A trust-region-based derivative free algorithm for mixed integer programming
- An outer-approximation algorithm for a class of mixed-integer nonlinear programs
- scientific article; zbMATH DE number 1264409
Cites work
- A Robust Trust Region Method for Constrained Nonlinear Programming Problems
- A trust region algorithm for equality constrained optimization
- A Trust Region Algorithm for Nonlinearly Constrained Optimization
- An Example of Only Linear Convergence of Trust Region Algorithms for Non-smooth Optimization
- An improved branch and bound algorithm for mixed integer nonlinear programs
- An outer-approximation algorithm for a class of mixed-integer nonlinear programs
- Branch and Bound Experiments in Convex Nonlinear Integer Programming
- Handbook of test problems in local and global optimization
- scientific article; zbMATH DE number 3871040 (Why is no real title available?)
- scientific article; zbMATH DE number 3930730 (Why is no real title available?)
- scientific article; zbMATH DE number 3744430 (Why is no real title available?)
- scientific article; zbMATH DE number 3748332 (Why is no real title available?)
- scientific article; zbMATH DE number 976325 (Why is no real title available?)
- scientific article; zbMATH DE number 1101647 (Why is no real title available?)
- scientific article; zbMATH DE number 3793774 (Why is no real title available?)
- Integrating SQP and branch-and-bound for mixed integer nonlinear programming
- Non-monotone trust-region algorithms for nonlinear optimization subject to convex constraints
- On the convergence of a new trust region algorithm
- On the global convergence of trust region algorithms for unconstrained minimization
- On the superlinear convergence of a trust region algorithm for nonsmooth optimization
- Optimal design of electronic components by mixed-integer nonlinear programming
- Pattern search algorithms for mixed variable programming
- Solving mixed integer nonlinear programs by outer approximation
- Solving pseudo-convex mixed integer optimization problems by cutting plane techniques
- Trust Region Methods
Cited in
(18)- Extended ant colony optimization for non-convex mixed integer nonlinear programming
- MISQP
- Augmented Lagrangian nonlinear programming algorithm that uses SQP and trust region techniques
- Convergence of Pham Dinh-Le Thi's algorithm for the trust-region subproblem
- A comparative study of SQP-type algorithms for nonlinear and nonconvex mixed-integer optimization
- A QCQP-based splitting SQP algorithm for two-block nonconvex constrained optimization problems with application
- A trust-region-based derivative free algorithm for mixed integer programming
- Trust-Region Interior-Point SQP Algorithms for a Class of Nonlinear Programming Problems
- Sequential linear integer programming for integer optimal control with total variation regularization
- A new approach for solving mixed integer DC programs using a continuous relaxation with no integrality gap and smoothing techniques
- A dynamic convexized method for nonconvex mixed integer nonlinear programming
- Integrating SQP and branch-and-bound for mixed integer nonlinear programming
- A new local and global optimization method for mixed integer quadratic programming problems
- Combining gradient information and primitive directions for high-performance bound-constrained mixed-integer optimization
- The mixed integer trust region problem
- Mixed-integer linearity in nonlinear optimization: a trust region approach
- Optimal design of electronic components by mixed-integer nonlinear programming
- The oracle penalty method
This page was built for publication: A trust region SQP algorithm for mixed-integer nonlinear programming
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2463830)
