Pages that link to "Item:Q977327"

The following pages link to Optimizing a polyhedral-semidefinite relaxation of completely positive programs (Q977327):

Displaying 31 items.

• A Lagrangian-DNN relaxation: a fast method for computing tight lower bounds for a class of quadratic optimization problems (Q263189) (← links)
• Conic relaxations for semi-supervised support vector machines (Q289094) (← links)
• On conic QPCCs, conic QCQPs and completely positive programs (Q312665) (← links)
• Semidefinite relaxations for non-convex quadratic mixed-integer programming (Q378112) (← links)
• Doubly nonnegative relaxation method for solving multiple objective quadratic programming problems (Q380592) (← links)
• An eigenvalue decomposition based branch-and-bound algorithm for nonconvex quadratic programming problems with convex quadratic constraints (Q513160) (← links)
• Monomial-wise optimal separable underestimators for mixed-integer polynomial optimization (Q522270) (← links)
• A robust Lagrangian-DNN method for a class of quadratic optimization problems (Q523570) (← links)
• Alternating direction augmented Lagrangian methods for semidefinite programming (Q621749) (← links)
• DC decomposition based branch-and-bound algorithms for box-constrained quadratic programs (Q723488) (← links)
• Modularity maximization using completely positive programming (Q1620447) (← links)
• Globally solving nonconvex quadratic programming problems with box constraints via integer programming methods (Q1621692) (← links)
• A spatial branch-and-cut method for nonconvex QCQP with bounded complex variables (Q1675255) (← links)
• A fresh CP look at mixed-binary QPs: new formulations and relaxations (Q1683686) (← links)
• Globally solving quadratic programs with convex objective and complementarity constraints via completely positive programming (Q1716972) (← links)
• Globally solving nonconvex quadratic programming problems via completely positive programming (Q1762459) (← links)
• Separating doubly nonnegative and completely positive matrices (Q1942269) (← links)
• Notoriously hard (mixed-)binary QPs: empirical evidence on new completely positive approaches (Q2010370) (← links)
• Outer space branch and bound algorithm for solving linear multiplicative programming problems (Q2022174) (← links)
• Tight compact extended relaxations for nonconvex quadratic programming problems with box constraints (Q2089865) (← links)
• Doubly nonnegative relaxations for quadratic and polynomial optimization problems with binary and box constraints (Q2144550) (← links)
• Mining for diamonds -- matrix generation algorithms for binary quadratically constrained quadratic problems (Q2146997) (← links)
• Simulated annealing for convex optimization: rigorous complexity analysis and practical perspectives (Q2156386) (← links)
• Outer-product-free sets for polynomial optimization and oracle-based cuts (Q2196293) (← links)
• Constraint selection in a build-up interior-point cutting-plane method for solving relaxations of the stable-set problem (Q2391873) (← links)
• Conic approximation to quadratic optimization with linear complementarity constraints (Q2397094) (← links)
• \texttt{EXPEDIS}: an exact penalty method over discrete sets (Q2673244) (← links)
• Copositive Programming (Q2802526) (← links)
• Block Coordinate Descent Methods for Semidefinite Programming (Q2802537) (← links)
• Globally Solving Nonconvex Quadratic Programs via Linear Integer Programming Techniques (Q5139846) (← links)
• Conic optimization: a survey with special focus on copositive optimization and binary quadratic problems (Q6114924) (← links)