Successive Lagrangian relaxation algorithm for nonconvex quadratic optimization
From MaRDI portal
Recommendations
- A new convex relaxation for quadratically constrained quadratic programming
- scientific article; zbMATH DE number 1560353
- Second order cone programming relaxation of nonconvex quadratic optimization problems
- Convex relaxations for nonconvex quadratically constrained quadratic programming: matrix cone decomposition and polyhedral approximation
- Faster, but weaker, relaxations for quadratically constrained quadratic programs
Cites work
- scientific article; zbMATH DE number 2107836 (Why is no real title available?)
- scientific article; zbMATH DE number 5060482 (Why is no real title available?)
- A branch and cut algorithm for nonconvex quadratically constrained quadratic programming
- A global optimization algorithm using Lagrangian underestimates and the interval Newton method
- A relaxation method for nonconvex quadratically constrained quadratic programs
- Computing a Trust Region Step
- Convex relaxations for nonconvex quadratically constrained quadratic programming: matrix cone decomposition and polyhedral approximation
- Dual bounds and optimality cuts for all-quadratic programs with convex constraints
- Enhancing RLT relaxations via a new class of semidefinite cuts
- Faster, but weaker, relaxations for quadratically constrained quadratic programs
- Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming
- Inexact subgradient methods for quasi-convex optimization problems
- KKT solution and conic relaxation for solving quadratically constrained quadratic programming problems
- Minimization of functions having Lipschitz continuous first partial derivatives
- Nonconvex quadratically constrained quadratic programming: Best D.C. Decompositions and their SDP representations
- On Cones of Nonnegative Quadratic Functions
- On solving nonconvex optimization problems by reducing the duality gap
- Quadratic programming with one negative eigenvalue is NP-hard
- Second order cone programming relaxation of nonconvex quadratic optimization problems
- Semidefinite Programming
- Semidefinite programming in combinatorial optimization
- Semidefinite programming relaxation for nonconvex quadratic programs
- Semidefinite programming versus the reformulation-linearization technique for nonconvex quadratically constrained quadratic programming
- Solving Max-cut to optimality by intersecting semidefinite and polyhedral relaxations
- Solving the trust-region subproblem by a generalized eigenvalue problem
- Stochastic subgradient method for quasi-convex optimization problems
- Using quadratic convex reformulation to tighten the convex relaxation of a quadratic program with complementarity constraints
Cited in
(7)- A Lagrangian-DNN relaxation: a fast method for computing tight lower bounds for a class of quadratic optimization problems
- Parallel implementation of successive convex relaxation methods for quadratic optimization problems
- A survey of hidden convex optimization
- scientific article; zbMATH DE number 1560353 (Why is no real title available?)
- Achieving fairness with a simple ridge penalty
- Discretization and localization in successive convex relaxation methods for nonconvex quadratic optimization.
- A robust Lagrangian-DNN method for a class of quadratic optimization problems
This page was built for publication: Successive Lagrangian relaxation algorithm for nonconvex quadratic optimization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q721146)
