Pages that link to "Item:Q523570"
From MaRDI portal
The following pages link to A robust Lagrangian-DNN method for a class of quadratic optimization problems (Q523570):
Displaying 8 items.
- Equivalences and differences in conic relaxations of combinatorial quadratic optimization problems (Q1756793) (← links)
- Polyhedral approximations of the semidefinite cone and their application (Q2028478) (← links)
- Doubly nonnegative relaxations for quadratic and polynomial optimization problems with binary and box constraints (Q2144550) (← links)
- Doubly nonnegative relaxations are equivalent to completely positive reformulations of quadratic optimization problems with block-clique graph structures (Q2182857) (← links)
- Amenable cones: error bounds without constraint qualifications (Q2227528) (← links)
- Algorithm 996 (Q4960955) (← links)
- A Newton-bracketing method for a simple conic optimization problem (Q4999334) (← links)
- A Geometrical Analysis on Convex Conic Reformulations of Quadratic and Polynomial Optimization Problems (Q5110556) (← links)
