Pages that link to "Item:Q1572673"
From MaRDI portal
The following pages link to Approximating quadratic programming with bound and quadratic constraints (Q1572673):
Displaying 50 items.
- New semidefinite programming relaxations for box constrained quadratic program (Q365811) (← links)
- Global optimization of bilinear programs with a multiparametric disaggregation technique (Q386453) (← links)
- Relaxing the optimality conditions of box QP (Q538311) (← links)
- Approximation algorithms for homogeneous polynomial optimization with quadratic constraints (Q607501) (← links)
- An improved lower bound and approximation algorithm for binary constrained quadratic programming problem (Q609569) (← links)
- Approximation algorithms for indefinite complex quadratic maximization problems (Q625875) (← links)
- Convex relaxations for nonconvex quadratically constrained quadratic programming: matrix cone decomposition and polyhedral approximation (Q644906) (← links)
- Semidefinite programming for discrete optimization and matrix completion problems (Q697582) (← links)
- Semi-definite relaxation algorithm of multiple knapsack problem (Q698390) (← links)
- Convex relaxations for mixed integer predictive control (Q710707) (← links)
- A generalization of the Karush-Kuhn-Tucker theorem for approximate solutions of mathematical programming problems based on quadratic approximation (Q722399) (← links)
- A new branch-and-cut algorithm for non-convex quadratic programming via alternative direction method and semidefinite relaxation (Q820743) (← links)
- On box-constrained total least squares problem (Q827567) (← links)
- On approximating complex quadratic optimization problems via semidefinite programming relaxations (Q877200) (← links)
- A \({\mathsf{D}}\)-induced duality and its applications (Q925269) (← links)
- Lower-order penalization approach to nonlinear semidefinite programming (Q995945) (← links)
- Complexity results for some global optimization problems (Q1024247) (← links)
- Semidefinite programming versus the reformulation-linearization technique for nonconvex quadratically constrained quadratic programming (Q1029700) (← links)
- Algorithms for bound constrained quadratic programming problems (Q1122320) (← links)
- Approximating global quadratic optimization with convex quadratic constraints (Q1304392) (← links)
- Approximation algorithms for quadratic programming (Q1386484) (← links)
- A proportioning based algorithm with rate of convergence for bound constrained quadratic programming (Q1418846) (← links)
- Polynomial-time approximation of largest simplices in \(V\)-polytopes. (Q1421471) (← links)
- Strengthened semidefinite relaxations via a second lifting for the Max-Cut problem (Q1602704) (← links)
- On the Slater condition for the SDP relaxations of nonconvex sets (Q1604046) (← links)
- Approximating the weighted maximin dispersion problem over an \(\ell _p\)-ball: SDP relaxation is misleading (Q1653283) (← links)
- Completely positive and completely positive semidefinite tensor relaxations for polynomial optimization (Q1704915) (← links)
- Some results for quadratic problems with one or two quadratic constraints (Q1785624) (← links)
- On approximation of max-vertex-cover (Q1848386) (← links)
- An implementation of the QSPLINE method for solving convex quadratic programming problems with simple bound constraints. (Q1875003) (← links)
- Approximation algorithm for a class of global optimization problems (Q1937958) (← links)
- Euclidean minimum spanning trees with independent and dependent geometric uncertainties (Q1984604) (← links)
- Penalized semidefinite programming for quadratically-constrained quadratic optimization (Q2022173) (← links)
- An efficient global algorithm for worst-case linear optimization under uncertainties based on nonlinear semidefinite relaxation (Q2044572) (← links)
- Cheaper relaxation and better approximation for multi-ball constrained quadratic optimization and extension (Q2045012) (← links)
- Statistical quality assessment of Ising-based annealer outputs (Q2101593) (← links)
- On the tightness of SDP relaxations of QCQPs (Q2133408) (← links)
- Exact semidefinite formulations for a class of (random and non-random) nonconvex quadratic programs (Q2188238) (← links)
- On the complexity of quadratic programming with two quadratic constraints (Q2364486) (← links)
- Hidden conic quadratic representation of some nonconvex quadratic optimization problems (Q2436648) (← links)
- Approximation bounds for quadratic maximization and max-cut problems with semidefinite programming relaxation (Q2475315) (← links)
- A finite branch-and-bound algorithm for nonconvex quadratic programming via semidefinite relaxations (Q2476994) (← links)
- Lower bound improvement and forcing rule for quadratic binary programming (Q2506180) (← links)
- Computable representations for convex hulls of low-dimensional quadratic forms (Q2638365) (← links)
- Computational methods for solving nonconvex block-separable constrained quadratic problems (Q2810546) (← links)
- A note on approximating quadratic programming with rank constraint (Q2903138) (← links)
- (Q2941669) (← links)
- Maximization of Matrix Trace Function of Product Stiefel Manifolds (Q3456868) (← links)
- On semidefinite bounds for maximization of a non-convex quadratic objective over the<i>l<sub>1</sub></i>unit ball (Q3635701) (← links)
- (Q4011538) (← links)
