A Lagrangian-DNN relaxation: a fast method for computing tight lower bounds for a class of quadratic optimization problems
From MaRDI portal
(Redirected from Publication:263189)
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
Cites work
- scientific article; zbMATH DE number 1818892 (Why is no real title available?)
- scientific article; zbMATH DE number 3121281 (Why is no real title available?)
- scientific article; zbMATH DE number 3982880 (Why is no real title available?)
- scientific article; zbMATH DE number 3177945 (Why is no real title available?)
- scientific article; zbMATH DE number 3574917 (Why is no real title available?)
- scientific article; zbMATH DE number 729680 (Why is no real title available?)
- A Fast Iterative Shrinkage-Thresholding Algorithm for Linear Inverse Problems
- A Newton-CG augmented Lagrangian method for semidefinite programming
- A Quadratically Constrained Quadratic Optimization Model for Completely Positive Cone Programming
- A convergent 3-block semiproximal alternating direction method of multipliers for conic programming with 4-type constraints
- A dual algorithm for the solution of nonlinear variational problems via finite element approximation
- Alternating direction augmented Lagrangian methods for semidefinite programming
- An adaptive linear approximation algorithm for copositive programs
- Approximation of the stability number of a graph via copositive programming
- CSDP, A C library for semidefinite programming
- Cone-valued maps in optimization
- Copositive and semidefinite relaxations of the quadratic assignment problem
- Erratum to: ``On the set-semidefinite representation of nonconvex quadratic programs over arbitrary feasible sets
- Extension of completely positive cone relaxation to moment cone relaxation for polynomial optimization
- Hankel matrix rank minimization with applications to system identification and realization
- Interior points of the completely positive cone
- On doubly positive semidefinite programming relaxations
- On the copositive representation of binary and continuous nonconvex quadratic programs
- Optimizing a polyhedral-semidefinite relaxation of completely positive programs
- Rigorous Error Bounds for the Optimal Value in Semidefinite Programming
- SDPT3 — A Matlab software package for semidefinite programming, Version 1.3
- Simplified copositive and Lagrangian relaxations for linearly constrained quadratic optimization problems in continuous and binary variables
- Solving Max-cut to optimality by intersecting semidefinite and polyhedral relaxations
- Some NP-complete problems in quadratic and nonlinear programming
- The direct extension of ADMM for multi-block convex minimization problems is not necessarily convergent
- Using SeDuMi 1.02, A Matlab toolbox for optimization over symmetric cones
Cited in
(33)- Copositive relaxation beats Lagrangian dual bounds in quadratically and linearly constrained quadratic optimization problems
- 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
- Completely positive tensors: properties, easily checkable subclasses, and tractable relaxations
- On construction of upper and lower bounds for the HOMO-LUMO spectral gap
- Doubly nonnegative relaxations for quadratic and polynomial optimization problems with binary and box constraints
- Lagrangian-conic relaxations. I: A unified framework and its applications to quadratic optimization problems
- An alternative perspective on copositive and convex relaxations of nonconvex quadratic programs
- A proximal DC approach for quadratic assignment problem
- Facial reduction and partial polyhedrality
- Amenable cones: error bounds without constraint qualifications
- Misspecified nonconvex statistical optimization for sparse phase retrieval
- ADMM for the SDP relaxation of the QAP
- Simplified copositive and Lagrangian relaxations for linearly constrained quadratic optimization problems in continuous and binary variables
- \(L_p\)-norm regularization algorithms for optimization over permutation matrices
- Globally solving quadratic programs with convex objective and complementarity constraints via completely positive programming
- SDP-based branch-and-bound for non-convex quadratic integer optimization
- Equivalences and differences in conic relaxations of combinatorial quadratic optimization problems
- A geometrical analysis on convex conic reformulations of quadratic and polynomial optimization problems
- A matrix nonconvex relaxation approach to unconstrained binary polynomial programs
- Conic formulation of QPCCs applied to truly sparse QPs
- Exactness conditions for an SDP relaxation of the extended trust region problem
- On degenerate doubly nonnegative projection problems
- Completely positive reformulations for polynomial optimization
- Global solutions of nonconvex standard quadratic programs via mixed integer linear programming reformulations
- A robust Lagrangian-DNN method for a class of quadratic optimization problems
- Doubly nonnegative relaxations are equivalent to completely positive reformulations of quadratic optimization problems with block-clique graph structures
- An eigenvalue decomposition based branch-and-bound algorithm for nonconvex quadratic programming problems with convex quadratic constraints
- A Newton-bracketing method for a simple conic optimization problem
- Binary quadratic optimization problems that are difficult to solve by conic relaxations
- Algorithm 996
- Polyhedral approximations of the semidefinite cone and their application
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)
