Pages that link to "Item:Q2463830"
From MaRDI portal
The following pages link to A trust region SQP algorithm for mixed-integer nonlinear programming (Q2463830):
Displaying 14 items.
- MISQP (Q18399) (← links)
- A dynamic convexized method for nonconvex mixed integer nonlinear programming (Q547132) (← links)
- A new local and global optimization method for mixed integer quadratic programming problems (Q606807) (← links)
- Optimal design of electronic components by mixed-integer nonlinear programming (Q959485) (← links)
- The oracle penalty method (Q975775) (← links)
- Extended ant colony optimization for non-convex mixed integer nonlinear programming (Q1013399) (← links)
- Augmented Lagrangian nonlinear programming algorithm that uses SQP and trust region techniques (Q1905035) (← links)
- Convergence of Pham Dinh-Le Thi's algorithm for the trust-region subproblem (Q1941028) (← links)
- A comparative study of SQP-type algorithms for nonlinear and nonconvex mixed-integer optimization (Q1946925) (← links)
- A QCQP-based splitting SQP algorithm for two-block nonconvex constrained optimization problems with application (Q2226311) (← links)
- A trust-region-based derivative free algorithm for mixed integer programming (Q2515071) (← links)
- Trust-Region Interior-Point SQP Algorithms for a Class of Nonlinear Programming Problems (Q4210186) (← links)
- Sequential linear integer programming for integer optimal control with total variation regularization (Q5043062) (← links)
- A new approach for solving mixed integer DC programs using a continuous relaxation with no integrality gap and smoothing techniques (Q5151528) (← links)
