Pages that link to "Item:Q3978620"
From MaRDI portal
The following pages link to Domain Contraction in Nonlinear Programming: Minimizing a Quadratic Concave Objective Over a Polyhedron (Q3978620):
Displaying 9 items.
- Maximizing strictly convex quadratic functions with bounded perturbations (Q639197) (← links)
- Domain reduction techniques for global NLP and MINLP optimization (Q1699520) (← links)
- Nonconvex optimization over a polytope using generalized capacity improvement (Q1904646) (← links)
- A branch-and-reduce approach to global optimization (Q1924068) (← links)
- A geometric branch and bound method for robust maximization of convex functions (Q2052396) (← links)
- Enhancing the normalized multiparametric disaggregation technique for mixed-integer quadratic programming (Q2423782) (← links)
- An algorithm for indefinite integer quadratic programming (Q2641219) (← links)
- (Q4261216) (← links)
- Quasiconvex relaxations based on interval arithmetic (Q5929744) (← links)
