Successive Lagrangian relaxation algorithm for nonconvex quadratic optimization

DOI10.1007/S10898-018-0617-2zbMath1402.90112OpenAlexW2788980057MaRDI QIDQ721146

Akiko Takeda, Shinji Yamada

Publication date: 18 July 2018

Published in: Journal of Global Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10898-018-0617-2

zbMATH Keywords

subgradient methodquasi-convex functionnonconvex quadratically constrained quadratic programLagrangian dual optimizationsemidefinite program relaxation

Mathematics Subject Classification ID

Nonconvex programming, global optimization (90C26) Quadratic programming (90C20)

Related Items (2)

A survey of hidden convex optimization ⋮ Achieving fairness with a simple ridge penalty

Uses Software

• GQTPAR
• Biq Mac

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Enhancing RLT relaxations via a new class of semidefinite cuts
• Convex relaxations for nonconvex quadratically constrained quadratic programming: matrix cone decomposition and polyhedral approximation
• Nonconvex quadratically constrained quadratic programming: Best D.C. Decompositions and their SDP representations
• Faster, but weaker, relaxations for quadratically constrained quadratic programs
• Solving Max-cut to optimality by intersecting semidefinite and polyhedral relaxations
• Semidefinite programming versus the reformulation-linearization technique for nonconvex quadratically constrained quadratic programming
• Quadratic programming with one negative eigenvalue is NP-hard
• Semidefinite programming relaxation for nonconvex quadratic programs
• Semidefinite programming in combinatorial optimization
• A global optimization algorithm using Lagrangian underestimates and the interval Newton method
• A relaxation method for nonconvex quadratically constrained quadratic programs
• A branch and cut algorithm for nonconvex quadratically constrained quadratic programming
• Using quadratic convex reformulation to tighten the convex relaxation of a quadratic program with complementarity constraints
• On solving nonconvex optimization problems by reducing the duality gap
• Minimization of functions having Lipschitz continuous first partial derivatives
• Inexact subgradient methods for quasi-convex optimization problems
• Second order cone programming relaxation of nonconvex quadratic optimization problems
• Solving the Trust-Region Subproblem By a Generalized Eigenvalue Problem
• KKT Solution and Conic Relaxation for Solving Quadratically Constrained Quadratic Programming Problems
• Computing a Trust Region Step
• Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming
• Semidefinite Programming
• On Cones of Nonnegative Quadratic Functions
• Dual bounds and optimality cuts for all-quadratic programs with convex constraints

This page was built for publication: Successive Lagrangian relaxation algorithm for nonconvex quadratic optimization