Outer approximation for pseudo-convex mixed-integer nonlinear program problems
From MaRDI portal
Recommendations
- Convex mixed integer nonlinear programming problems and an outer approximation algorithm
- An outer approximation method for a class of minimax convex MINLP problems
- Outer-approximation algorithms for nonsmooth convex MINLP problems
- Solving mixed integer nonlinear programs by outer approximation
- Outer approximation algorithm for one class of convex mixed-integer nonlinear programming problems with partial differentiability
Cites work
- A branch-and-cut method for 0-1 mixed convex programming
- A polyhedral branch-and-cut approach to global optimization
- A survey of subdifferential calculus with applications
- Abadie's Constraint Qualification, Metric Regularity, and Error Bounds for Differentiable Convex Inequalities
- An algorithmic framework for convex mixed integer nonlinear programs
- An outer-approximation algorithm for a class of mixed-integer nonlinear programs
- Computational aspects of alternative portfolio selection models in the presence of discrete asset choice constraints
- Convex mixed integer nonlinear programming problems and an outer approximation algorithm
- Convexification and global optimization in continuous and mixed-integer nonlinear programming. Theory, algorithms, software, and applications
- Decomposition in general mathematical programming
- Generalized Benders decomposition
- Generalized Benders decomposition for one class of MINLPs with vector conic constraint
- scientific article; zbMATH DE number 976325 (Why is no real title available?)
- scientific article; zbMATH DE number 5066287 (Why is no real title available?)
- scientific article; zbMATH DE number 3291743 (Why is no real title available?)
- Integrating SQP and branch-and-bound for mixed integer nonlinear programming
- Large-Scale Network Topological Optimization
- Noncommercial software for mixed-integer linear programming
- On the generalization of ECP and OA methods to nonsmooth convex MINLP problems
- Optimization and nonsmooth analysis
- Outer approximation algorithm for one class of convex mixed-integer nonlinear programming problems with partial differentiability
- Outer-approximation algorithms for nonsmooth convex MINLP problems
- Review of nonlinear mixed-integer and disjunctive programming techniques
- Solving mixed integer nonlinear programs by outer approximation
- Solving pseudo-convex mixed integer optimization problems by cutting plane techniques
- Strong Abadie CQ, ACQ, calmness and linear regularity
- Subgradient based outer approximation for mixed integer second order cone programming
- Variational Analysis
This page was built for publication: Outer approximation for pseudo-convex mixed-integer nonlinear program problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6494309)
