Pages that link to "Item:Q1905961"
From MaRDI portal
The following pages link to A reformulation-convexification approach for solving nonconvex quadratic programming problems (Q1905961):
Displayed 18 items.
- On generalized geometric programming problems with non-positive variables (Q857357) (← links)
- A new global optimization algorithm for signomial geometric programming via Lagrangian relaxation (Q879567) (← links)
- Box-constrained quadratic programs with fixed charge variables (Q933786) (← links)
- Utility function programs and optimization over the efficient set in multiple-objective decision making (Q1356096) (← links)
- New reformulation linearization/convexification relaxations for univariate and multivariate polynomial programming problems (Q1371947) (← links)
- Global optimization of signomial geometric programming using linear relaxation. (Q1428180) (← links)
- Linearization method of global optimization for generalized geometric programming (Q1763283) (← links)
- A rigorous global filtering algorithm for quadratic constraints (Q1774519) (← links)
- A new two-level linear relaxed bound method for geometric programming problems (Q1774846) (← links)
- On the finite convergence of successive SDP relaxation methods (Q1848385) (← links)
- A robust algorithm for quadratic optimization under quadratic constraints (Q2385494) (← links)
- A global optimization using linear relaxation for generalized geometric programming (Q2427180) (← links)
- Inventory and investment in setup and quality operations under return on investment maximization (Q2455619) (← links)
- A finite branch-and-bound algorithm for nonconvex quadratic programming via semidefinite relaxations (Q2476994) (← links)
- Recovery of primal solutions when using subgradient optimization methods to solve Lagrangian duals of linear programs (Q2564623) (← links)
- Accelerating branch-and-bound through a modeling language construct for relaxation-specific constraints (Q2576448) (← links)
- A global optimization RLT-based approach for solving the hard clustering problem (Q2576449) (← links)
- Quadratic 0–1 programming: Tightening linear or quadratic convex reformulation by use of relaxations (Q3539803) (← links)