Pages that link to "Item:Q1730782"
From MaRDI portal
The following pages link to Enhancing semidefinite relaxation for quadratically constrained quadratic programming via penalty methods (Q1730782):
Displaying 6 items.
- A new branch-and-cut algorithm for non-convex quadratic programming via alternative direction method and semidefinite relaxation (Q820743) (← links)
- An efficient global algorithm for worst-case linear optimization under uncertainties based on nonlinear semidefinite relaxation (Q2044572) (← links)
- Review of mathematical methodology for electric power optimization problems (Q2218096) (← links)
- Complexity Results and Effective Algorithms for Worst-Case Linear Optimization Under Uncertainties (Q4995064) (← links)
- Global optimization algorithm for solving linear multiplicative programming problems (Q5085229) (← links)
- An effective global algorithm for worst-case linear optimization under polyhedral uncertainty (Q6166102) (← links)
