A trajectory-based method for mixed integer nonlinear programming problems
From MaRDI portal
Recommendations
- A trajectory-based method for constrained nonlinear optimization problems
- A trust-region-based derivative free algorithm for mixed integer programming
- An optimal control approach to nonlinear mixed integer programming problems
- A dynamic convexized method for nonconvex mixed integer nonlinear programming
- An approximate method for local optima for nonlinear mixed integer programming problems
Cites work
- A global optimization algorithm for linear fractional and bilinear programs
- A new and dynamic method for unconstrained minimization
- A note on convex reformulation schemes for mixed integer quadratic programs
- A tree-search algorithm for mixed integer programming problems
- An exact penalty global optimization approach for mixed-integer programming problems
- An improved version of the original leap-frog dynamic method for unconstrained minimization: LFOP1(b)
- An interior point cutting plane heuristic for mixed integer programming
- An outer-approximation algorithm for a class of mixed-integer nonlinear programs
- Augmented Lagrangian method with nonmonotone penalty parameters for constrained optimization
- FilMINT: an outer approximation-based solver for convex mixed-integer nonlinear programs
- Handbook of test problems in local and global optimization
- scientific article; zbMATH DE number 976325 (Why is no real title available?)
- scientific article; zbMATH DE number 2002582 (Why is no real title available?)
- Integrating SQP and branch-and-bound for mixed integer nonlinear programming
- Linear transformation based solution methods for non-convex mixed integer quadratic programs
- Nonlinear optimization with engineering applications
- Numerical Optimization
- Optimal Order and Stepsize Sequences
- Optimization Methods in Finance
- Solving mixed integer nonlinear programs by outer approximation
- Solving pseudo-convex mixed integer optimization problems by cutting plane techniques
- The boundedness of penalty parameters in an augmented Lagrangian method with constrained subproblems
- Transformation-based preprocessing for mixed-integer quadratic programs
This page was built for publication: A trajectory-based method for mixed integer nonlinear programming problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1704918)
