Pages that link to "Item:Q721146"
From MaRDI portal
The following pages link to Successive Lagrangian relaxation algorithm for nonconvex quadratic optimization (Q721146):
Displaying 6 items.
- A Lagrangian-DNN relaxation: a fast method for computing tight lower bounds for a class of quadratic optimization problems (Q263189) (← links)
- A robust Lagrangian-DNN method for a class of quadratic optimization problems (Q523570) (← links)
- Parallel implementation of successive convex relaxation methods for quadratic optimization problems (Q1812077) (← links)
- Achieving fairness with a simple ridge penalty (Q2080355) (← links)
- A survey of hidden convex optimization (Q2176821) (← links)
- Discretization and localization in successive convex relaxation methods for nonconvex quadratic optimization. (Q5926332) (← links)