Pages that link to "Item:Q721170"
From MaRDI portal
The following pages link to Reformulations for utilizing separability when solving convex MINLP problems (Q721170):
Displaying 21 items.
- Preface to the special issue ``GOW'16'' (Q721158) (← links)
- Two new reformulation convexification based hierarchies for 0-1 MIPs (Q1748458) (← links)
- A proximal-point outer approximation algorithm (Q2023688) (← links)
- Partially distributed outer approximation (Q2046262) (← links)
- Alternative regularizations for outer-approximation algorithms for convex MINLP (Q2089881) (← links)
- Linearization and parallelization schemes for convex mixed-integer nonlinear optimization (Q2114818) (← links)
- On refinement strategies for solving \(\textsc{MINLP}\)s by piecewise linear relaxations: a generalized red refinement (Q2115319) (← links)
- Polyhedral approximation strategies for nonconvex mixed-integer nonlinear programming in SHOT (Q2124807) (← links)
- A disjunctive cut strengthening technique for convex MINLP (Q2129197) (← links)
- Pyomo.GDP: an ecosystem for logic based modeling and optimization development (Q2138322) (← links)
- The supporting hyperplane optimization toolkit for convex MINLP (Q2162510) (← links)
- Using regularization and second order information in outer approximation for convex MINLP (Q2297649) (← links)
- Strengthening the sequential convex MINLP technique by perspective reformulations (Q2311102) (← links)
- A note on solving MINLP's using formulation space search (Q2448189) (← links)
- Reducing Separable Convex Programs with Tree Constraints (Q3351145) (← links)
- Using projected cutting planes in the extended cutting plane method (Q5057972) (← links)
- A New Combinatorial Algorithm for Separable Convex Resource Allocation with Nested Bound Constraints (Q5085487) (← links)
- A reformulation technique to solve polynomial optimization problems with separable objective functions of bounded integer variables (Q6043104) (← links)
- Sparse convex optimization toolkit: a mixed-integer framework (Q6087059) (← links)
- Distributed primal outer approximation algorithm for sparse convex programming with separable structures (Q6173959) (← links)
- Convex mixed-integer nonlinear programs derived from generalized disjunctive programming using cones (Q6498414) (← links)
