A Lagrangian-DNN relaxation: a fast method for computing tight lower bounds for a class of quadratic optimization problems
From MaRDI portal
Publication:263189
DOI10.1007/S10107-015-0874-5zbMATH Open1342.90123OpenAlexW2083411653MaRDI QIDQ263189FDOQ263189
Kim-Chuan Toh, Masakazu Kojima, Sunyoung Kim
Publication date: 4 April 2016
Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10107-015-0874-5
Recommendations
- A robust Lagrangian-DNN method for a class of quadratic optimization problems
- A Newton-bracketing method for a simple conic optimization problem
- Copositive relaxation beats Lagrangian dual bounds in quadratically and linearly constrained quadratic optimization problems
- Successive Lagrangian relaxation algorithm for nonconvex quadratic optimization
- Simplified copositive and Lagrangian relaxations for linearly constrained quadratic optimization problems in continuous and binary variables
bisection methoditerative solverLagrangian-conic relaxationlinearly constrained quadratic optimization problems with complementarity constraints
Quadratic programming (90C20) Convex programming (90C25) Nonconvex programming, global optimization (90C26)
Cites Work
- CSDP, A C library for semidefinite programming
- SDPT3 — A Matlab software package for semidefinite programming, Version 1.3
- Using SeDuMi 1.02, A Matlab toolbox for optimization over symmetric cones
- A Fast Iterative Shrinkage-Thresholding Algorithm for Linear Inverse Problems
- Solving Max-cut to optimality by intersecting semidefinite and polyhedral relaxations
- A dual algorithm for the solution of nonlinear variational problems via finite element approximation
- Title not available (Why is that?)
- Title not available (Why is that?)
- A Newton-CG Augmented Lagrangian Method for Semidefinite Programming
- Hankel matrix rank minimization with applications to system identification and realization
- A Convergent 3-Block SemiProximal Alternating Direction Method of Multipliers for Conic Programming with 4-Type Constraints
- The direct extension of ADMM for multi-block convex minimization problems is not necessarily convergent
- Some NP-complete problems in quadratic and nonlinear programming
- Title not available (Why is that?)
- Title not available (Why is that?)
- On the copositive representation of binary and continuous nonconvex quadratic programs
- Approximation of the stability number of a graph via copositive programming
- Extension of completely positive cone relaxation to moment cone relaxation for polynomial optimization
- Simplified copositive and Lagrangian relaxations for linearly constrained quadratic optimization problems in continuous and binary variables
- Cone-valued maps in optimization
- Title not available (Why is that?)
- Interior points of the completely positive cone
- Erratum to: ``On the set-semidefinite representation of nonconvex quadratic programs over arbitrary feasible sets
- Rigorous Error Bounds for the Optimal Value in Semidefinite Programming
- Title not available (Why is that?)
- On Doubly Positive Semidefinite Programming Relaxations
- An Adaptive Linear Approximation Algorithm for Copositive Programs
- A Quadratically Constrained Quadratic Optimization Model for Completely Positive Cone Programming
- Alternating direction augmented Lagrangian methods for semidefinite programming
- Copositive and semidefinite relaxations of the quadratic assignment problem
- Optimizing a polyhedral-semidefinite relaxation of completely positive programs
Cited In (31)
- Second order cone constrained convex relaxations for nonconvex quadratically constrained quadratic programming
- A regularization-patching dual quaternion optimization method for solving the hand-eye calibration problem
- Conic approximation to quadratic optimization with linear complementarity constraints
- Amenable cones: error bounds without constraint qualifications
- Polyhedral approximations of the semidefinite cone and their application
- On Degenerate Doubly Nonnegative Projection Problems
- Global solutions of nonconvex standard quadratic programs via mixed integer linear programming reformulations
- Binary quadratic optimization problems that are difficult to solve by conic relaxations
- A Geometrical Analysis on Convex Conic Reformulations of Quadratic and Polynomial Optimization Problems
- Completely positive tensors: properties, easily checkable subclasses, and tractable relaxations
- Equivalences and differences in conic relaxations of combinatorial quadratic optimization problems
- Doubly nonnegative relaxations for quadratic and polynomial optimization problems with binary and box constraints
- A proximal DC approach for quadratic assignment problem
- Facial Reduction and Partial Polyhedrality
- Exactness conditions for an SDP relaxation of the extended trust region problem
- Copositive Relaxation Beats Lagrangian Dual Bounds in Quadratically and Linearly Constrained Quadratic Optimization Problems
- \(L_p\)-norm regularization algorithms for optimization over permutation matrices
- Algorithm 996
- Misspecified nonconvex statistical optimization for sparse phase retrieval
- Completely positive reformulations for polynomial optimization
- An alternative perspective on copositive and convex relaxations of nonconvex quadratic programs
- A Newton-bracketing method for a simple conic optimization problem
- On construction of upper and lower bounds for the HOMO-LUMO spectral gap
- Doubly nonnegative relaxations are equivalent to completely positive reformulations of quadratic optimization problems with block-clique graph structures
- SDP-based branch-and-bound for non-convex quadratic integer optimization
- An eigenvalue decomposition based branch-and-bound algorithm for nonconvex quadratic programming problems with convex quadratic constraints
- A matrix nonconvex relaxation approach to unconstrained binary polynomial programs
- Conic formulation of QPCCs applied to truly sparse QPs
- ADMM for the SDP relaxation of the QAP
- Globally solving quadratic programs with convex objective and complementarity constraints via completely positive programming
- A robust Lagrangian-DNN method for a class of quadratic optimization problems
Uses Software
This page was built for publication: A Lagrangian-DNN relaxation: a fast method for computing tight lower bounds for a class of quadratic optimization problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q263189)
