Pages that link to "Item:Q1177910"
From MaRDI portal
The following pages link to Quadratic programming with one negative eigenvalue is NP-hard (Q1177910):
Displayed 50 items.
- Theoretical and computational results about optimality-based domain reductions (Q288410) (← links)
- An efficient global algorithm for a class of indefinite separable quadratic programs (Q304230) (← links)
- Trading performance for stability in Markov decision processes (Q340568) (← links)
- An FPTAS for optimizing a class of low-rank functions over a polytope (Q378129) (← links)
- An approximation bound analysis for Lasserre's relaxation in multivariate polynomial optimization (Q384182) (← links)
- Exact computable representation of some second-order cone constrained quadratic programming problems (Q384217) (← links)
- On solving linear complementarity problems by DC programming and DCA (Q409266) (← links)
- On zero duality gap in nonconvex quadratic programming problems (Q421278) (← links)
- An LPCC approach to nonconvex quadratic programs (Q431005) (← links)
- A canonical dual approach for solving linearly constrained quadratic programs (Q439448) (← links)
- A parametric branch and bound approach to suboptimal explicit hybrid MPC (Q463830) (← links)
- Nonlinear optimization problem of interdependent investment projects portfolio (Q507118) (← links)
- Satisfactory fault tolerant control with soft-constraint for discrete time-varying systems: numerical recursive approach (Q509390) (← links)
- An eigenvalue decomposition based branch-and-bound algorithm for nonconvex quadratic programming problems with convex quadratic constraints (Q513160) (← links)
- Linear decomposition approach for a class of nonconvex programming problems (Q523884) (← links)
- Relaxing the optimality conditions of box QP (Q538311) (← links)
- An FPTAS for minimizing the product of two non-negative linear cost functions (Q623370) (← links)
- Nonconvex quadratically constrained quadratic programming: Best D.C. Decompositions and their SDP representations (Q645557) (← links)
- Solving optimization problems on ranks and inertias of some constrained nonlinear matrix functions via an algebraic linearization method (Q651143) (← links)
- A convex relaxation bound for subgraph isomorphism (Q666533) (← links)
- Approximation algorithms for indefinite quadratic programming (Q687094) (← links)
- Open questions in complexity theory for numerical optimization (Q687097) (← links)
- Two-stage robust LP with ellipsoidal right-hand side uncertainty is NP-hard (Q694182) (← links)
- Semidefinite programming for discrete optimization and matrix completion problems (Q697582) (← links)
- Optimization of functions with rank-two variation over a box (Q706945) (← links)
- Successive Lagrangian relaxation algorithm for nonconvex quadratic optimization (Q721146) (← links)
- DC decomposition based branch-and-bound algorithms for box-constrained quadratic programs (Q723488) (← links)
- Minimizing rational functions by exact Jacobian SDP relaxation applicable to finite singularities (Q742119) (← links)
- A new branch-and-cut algorithm for non-convex quadratic programming via alternative direction method and semidefinite relaxation (Q820743) (← links)
- Globally solving box-constrained nonconvex quadratic programs with semidefinite-based finite branch-and-bound (Q839489) (← links)
- Bilinear modeling solution approach for fixed charge network flow problems (Q839798) (← links)
- Optimization and analysis of the profitability of tariff structures with two-part tariffs (Q976514) (← links)
- Quadratic programming and combinatorial minimum weight product problems (Q985315) (← links)
- Solutions to quadratic minimization problems with box and integer constraints (Q989896) (← links)
- Complexity results for some global optimization problems (Q1024247) (← links)
- Solutions and optimality criteria for nonconvex constrained global optimization problems with connections between canonical and Lagrangian duality (Q1037375) (← links)
- Special cases of the quadratic assignment problem (Q1129914) (← links)
- Parametric simplex algorithms for a class of NP-complete problems whose average number of steps is polynomial (Q1203065) (← links)
- Extensions of Dinkelbach's algorithm for solving nonlinear fractional programming problems (Q1304774) (← links)
- A new technique for generating quadratic programming test problems (Q1315416) (← links)
- A finite algorithm for solving general quadratic problems (Q1315437) (← links)
- Strongly polynomial time algorithms for certain concave minimization problems on networks (Q1317011) (← links)
- Optimality conditions and optimization methods for quartic polynomial optimization (Q1646197) (← links)
- Energy-regenerative model predictive control (Q1660463) (← links)
- An extension of Yuan's lemma and its applications in optimization (Q1673911) (← links)
- Completely positive reformulations of polynomial optimization problems with linear constraints (Q1679621) (← links)
- An SR1/BFGS SQP algorithm for nonconvex nonlinear programs with block-diagonal Hessian matrix (Q1694296) (← links)
- A new branch-and-bound approach to semi-supervised support vector machine (Q1699749) (← links)
- Enhancing semidefinite relaxation for quadratically constrained quadratic programming via penalty methods (Q1730782) (← links)
- New global algorithms for quadratic programming with a few negative eigenvalues based on alternative direction method and convex relaxation (Q1741128) (← links)
