Pages that link to "Item:Q1970300"
From MaRDI portal
The following pages link to A branch and cut algorithm for nonconvex quadratically constrained quadratic programming (Q1970300):
Displaying 50 items.
- Global solutions to a class of CEC benchmark constrained optimization problems (Q279808) (← links)
- A generalized global optimization formulation of the pooling problem with processing facilities and composite quality constraints (Q301393) (← links)
- Exact quadratic convex reformulations of mixed-integer quadratically constrained problems (Q304240) (← links)
- Global optimization advances in mixed-integer nonlinear programming, MINLP, and constrained derivative-free optimization, CDFO (Q322958) (← links)
- A model for clustering data from heterogeneous dissimilarities (Q323236) (← links)
- Generating cutting planes for the semidefinite relaxation of quadratic programs (Q337405) (← links)
- GLOMIQO: global mixed-integer quadratic optimizer (Q367170) (← links)
- A framework for globally optimizing mixed-integer signomial programs (Q398656) (← links)
- Copositivity and constrained fractional quadratic problems (Q403649) (← links)
- Range reduction techniques for improving computational efficiency in global optimization of signomial geometric programming problems (Q421696) (← links)
- A reliable affine relaxation method for global optimization (Q496103) (← links)
- Global optimization algorithm for mixed integer quadratically constrained quadratic program (Q515761) (← links)
- New multi-commodity flow formulations for the pooling problem (Q524906) (← links)
- RLT: A unified approach for discrete and continuous nonconvex optimization (Q537611) (← links)
- Remarks on solutions to a nonconvex quadratic programming test problem (Q540711) (← links)
- A note on diameters of point sets (Q601983) (← links)
- The small hexagon and heptagon with maximum sum of distances between vertices (Q628747) (← links)
- Convex relaxations for nonconvex quadratically constrained quadratic programming: matrix cone decomposition and polyhedral approximation (Q644906) (← links)
- Nonconvex quadratically constrained quadratic programming: Best D.C. Decompositions and their SDP representations (Q645557) (← links)
- A working set SQCQP algorithm with simple nonmonotone penalty parameters (Q654747) (← links)
- Successive Lagrangian relaxation algorithm for nonconvex quadratic optimization (Q721146) (← links)
- An accelerating algorithm for globally solving nonconvex quadratic programming (Q824677) (← links)
- The small octagon with longest perimeter (Q857420) (← links)
- A parametric linear relaxation algorithm for globally solving nonconvex quadratic programming (Q902804) (← links)
- A sequential quadratically constrained quadratic programming method with an augmented Lagrangian line search function (Q939555) (← links)
- Exact \(L_{2}\)-norm plane separation (Q941041) (← links)
- A quadratically approximate framework for constrained optimization, global and local convergence (Q943517) (← links)
- Inexact Josephy-Newton framework for generalized equations and its applications to local analysis of Newtonian methods for constrained optimization (Q975356) (← links)
- \({{\mathcal {D}(\mathcal {C})}}\)-optimization and robust global optimization (Q989898) (← links)
- A reformulation-linearization technique (RLT) for semi-infinite and convex programs under mixed 0-1 and general discrete restrictions (Q1025998) (← links)
- Exact and heuristic solutions of the global supply chain problem with transfer pricing (Q1041020) (← links)
- Sequential quadratically constrained quadratic programming norm-relaxed algorithm of strongly sub-feasible directions (Q1044081) (← links)
- The largest small octagon (Q1601419) (← links)
- An optimal approach for the critical node problem using semidefinite programming (Q1620469) (← links)
- A parametric linearizing approach for quadratically inequality constrained quadratic programs (Q1644881) (← links)
- Extra resource allocation: a DEA approach in the view of efficiencies (Q1655921) (← links)
- Piecewise parametric structure in the pooling problem: from sparse strongly-polynomial solutions to NP-hardness (Q1668789) (← links)
- A distributed continuous-time method for non-convex QCQPs (Q1729053) (← links)
- Enhancing semidefinite relaxation for quadratically constrained quadratic programming via penalty methods (Q1730782) (← links)
- Quadratic convex reformulation for nonconvex binary quadratically constrained quadratic programming via surrogate constraint (Q1753128) (← links)
- Pricing and revenue maximization over a multicommodity transportation network: the nonlinear demand case (Q1756575) (← links)
- A rigorous global filtering algorithm for quadratic constraints (Q1774519) (← links)
- A polyhedral branch-and-cut approach to global optimization (Q1780949) (← links)
- A simplicial branch-and-bound algorithm for solving quadratically constrained quadratic programs (Q1780950) (← links)
- The minimum diameter octagon with unit-length sides: Vincze's wife's octagon is suboptimal (Q1881682) (← links)
- Global optimization of mixed-integer quadratically-constrained quadratic programs (MIQCQP) through piecewise-linear and edge-concave relaxations (Q1925777) (← links)
- Decomposition strategy for the stochastic pooling problem (Q1928271) (← links)
- An RLT approach for solving the binary-constrained mixed linear complementarity problem (Q2002841) (← links)
- Conic approximation to nonconvex quadratic programming with convex quadratic constraints (Q2018510) (← links)
- Outer-product-free sets for polynomial optimization and oracle-based cuts (Q2196293) (← links)
