Optimizing a polyhedral-semidefinite relaxation of completely positive programs
From MaRDI portal
Publication:977327
DOI10.1007/s12532-010-0010-8zbMath1190.90135OpenAlexW2169053534MaRDI QIDQ977327
Publication date: 21 June 2010
Published in: Mathematical Programming Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s12532-010-0010-8
Semidefinite programming (90C22) Nonconvex programming, global optimization (90C26) Linear programming (90C05)
Related Items
Modularity maximization using completely positive programming, Globally solving nonconvex quadratic programming problems with box constraints via integer programming methods, Conic relaxations for semi-supervised support vector machines, On conic QPCCs, conic QCQPs and completely positive programs, Doubly nonnegative relaxations for quadratic and polynomial optimization problems with binary and box constraints, Mining for diamonds -- matrix generation algorithms for binary quadratically constrained quadratic problems, Simulated annealing for convex optimization: rigorous complexity analysis and practical perspectives, Constraint selection in a build-up interior-point cutting-plane method for solving relaxations of the stable-set problem, Conic approximation to quadratic optimization with linear complementarity constraints, Cutting Plane Generation through Sparse Principal Component Analysis, Semidefinite relaxations for non-convex quadratic mixed-integer programming, A spatial branch-and-cut method for nonconvex QCQP with bounded complex variables, Doubly nonnegative relaxation method for solving multiple objective quadratic programming problems, \texttt{EXPEDIS}: an exact penalty method over discrete sets, A fresh CP look at mixed-binary QPs: new formulations and relaxations, Semidefinite Approaches for MIQCP: Convex Relaxations and Practical Methods, Alternating direction augmented Lagrangian methods for semidefinite programming, Conic optimization: a survey with special focus on copositive optimization and binary quadratic problems, Outer-product-free sets for polynomial optimization and oracle-based cuts, Separating doubly nonnegative and completely positive matrices, Globally solving quadratic programs with convex objective and complementarity constraints via completely positive programming, Globally Solving Nonconvex Quadratic Programs via Linear Integer Programming Techniques, Solving Quadratic Programming by Cutting Planes, An eigenvalue decomposition based branch-and-bound algorithm for nonconvex quadratic programming problems with convex quadratic constraints, Monomial-wise optimal separable underestimators for mixed-integer polynomial optimization, A robust Lagrangian-DNN method for a class of quadratic optimization problems, Globally solving nonconvex quadratic programming problems via completely positive programming, Notoriously hard (mixed-)binary QPs: empirical evidence on new completely positive approaches, Outer space branch and bound algorithm for solving linear multiplicative programming problems, DC decomposition based branch-and-bound algorithms for box-constrained quadratic programs, Copositive Programming, Block Coordinate Descent Methods for Semidefinite Programming, Tight compact extended relaxations for nonconvex quadratic programming problems with box constraints, A Lagrangian-DNN relaxation: a fast method for computing tight lower bounds for a class of quadratic optimization problems
Uses Software
Cites Work
- Unnamed Item
- Alternating direction augmented Lagrangian methods for semidefinite programming
- QAPLIB-A quadratic assignment problem library
- Copositive and semidefinite relaxations of the quadratic assignment problem
- Globally solving box-constrained nonconvex quadratic programs with semidefinite-based finite branch-and-bound
- Exploiting group symmetry in semidefinite programming relaxations of the quadratic assignment problem
- A note on the computation of the CP-rank
- A boundary point method to solve semidefinite programs
- The quadratic knapsack problem -- a survey
- Semidefinite programming relaxations for the quadratic assignment problem
- Recent advances in the solution of quadratic assignment problems
- A semidefinite programming approach to the quadratic knapsack problem
- A branch-and-cut algorithm for nonconvex quadratic programs with box constraints
- Solving standard quadratic optimization problems via linear, semidefinite and copositive pro\-gramming
- BARON: A general purpose global optimization software package
- On the copositive representation of binary and continuous nonconvex quadratic programs
- Approximation of the Stability Number of a Graph via Copositive Programming
- Solution of Large Quadratic Knapsack Problems Through Aggressive Reduction
- A Newton-CG Augmented Lagrangian Method for Semidefinite Programming
- Rigorous Error Bounds for the Optimal Value in Semidefinite Programming
- Some NP-complete problems in quadratic and nonlinear programming
- Exact Solution of the Quadratic Knapsack Problem
- Using SeDuMi 1.02, A Matlab toolbox for optimization over symmetric cones
- Solving Lift-and-Project Relaxations of Binary Integer Programs
- On copositive programming and standard quadratic optimization problems
