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):
Displaying 50 items.
- Global optimization with spline constraints: a new branch-and-bound method based on B-splines (Q300751) (← links)
- Global optimization advances in mixed-integer nonlinear programming, MINLP, and constrained derivative-free optimization, CDFO (Q322958) (← 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)
- Reduced RLT representations for nonconvex polynomial programming problems (Q427362) (← links)
- A canonical dual approach for solving linearly constrained quadratic programs (Q439448) (← links)
- Enhancing RLT-based relaxations for polynomial programming problems via a new class of \(v\)-semidefinite cuts (Q453612) (← links)
- RLT: A unified approach for discrete and continuous nonconvex optimization (Q537611) (← links)
- Separable relaxation for nonconvex quadratic integer programming: Integer diagonalization approach (Q604257) (← links)
- Convex relaxations for nonconvex quadratically constrained quadratic programming: matrix cone decomposition and polyhedral approximation (Q644906) (← links)
- Conic mixed-integer rounding cuts (Q847842) (← links)
- 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)
- A parametric linear relaxation algorithm for globally solving nonconvex quadratic programming (Q902804) (← links)
- Box-constrained quadratic programs with fixed charge variables (Q933786) (← links)
- Semidefinite programming versus the reformulation-linearization technique for nonconvex quadratically constrained quadratic programming (Q1029700) (← 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)
- Globally solving nonconvex quadratic programming problems with box constraints via integer programming methods (Q1621692) (← links)
- A parametric linearizing approach for quadratically inequality constrained quadratic programs (Q1644881) (← links)
- A global optimization algorithm for signomial geometric programming problem (Q1722230) (← links)
- A novel optimization method for nonconvex quadratically constrained quadratic programs (Q1724769) (← links)
- A note on representations of linear inequalities in non-convex mixed-integer quadratic programs (Q1728372) (← links)
- New global algorithms for quadratic programming with a few negative eigenvalues based on alternative direction method and convex relaxation (Q1741128) (← 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)
- Global optimization of mixed-integer quadratically-constrained quadratic programs (MIQCQP) through piecewise-linear and edge-concave relaxations (Q1925777) (← links)
- Branch and cut algorithms for detecting critical nodes in undirected graphs (Q1935569) (← links)
- Dynamic Lagrangian dual and reduced RLT constructs for solving \(0-1\) mixed-integer programs (Q1935886) (← links)
- Multi-objective geometric programming problem with \(\epsilon\)-constraint method (Q1991380) (← links)
- A novel convex dual approach to three-dimensional assignment problem: theoretical analysis (Q2007830) (← links)
- A new algorithm for concave quadratic programming (Q2010088) (← links)
- Sharp upper and lower bounds for maximum likelihood solutions to random Gaussian bilateral inequality systems (Q2010090) (← links)
- QPALM: a proximal augmented Lagrangian method for nonconvex quadratic programs (Q2088967) (← links)
- ANTIGONE: algorithms for coNTinuous/Integer global optimization of nonlinear equations (Q2250093) (← links)
- Global optimization of general nonconvex problems with intermediate polynomial substructures (Q2250104) (← links)
- A robust algorithm for quadratic optimization under quadratic constraints (Q2385494) (← links)
- Branch-delete-bound algorithm for globally solving quadratically constrained quadratic programs (Q2409582) (← links)
- A global optimization using linear relaxation for generalized geometric programming (Q2427180) (← links)
- Nonlinear robust optimization via sequential convex bilevel programming (Q2434994) (← 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)
- Computable representations for convex hulls of low-dimensional quadratic forms (Q2638365) (← links)
