Pages that link to "Item:Q945281"
From MaRDI portal
The following pages link to A robust solution approach for nonconvex quadratic programs with additional multiplicative constraints (Q945281):
Displaying 11 items.
- An accelerating algorithm for globally solving nonconvex quadratic programming (Q824677) (← links)
- A parametric linear relaxation algorithm for globally solving nonconvex quadratic programming (Q902804) (← links)
- A parametric linearizing approach for quadratically inequality constrained quadratic programs (Q1644881) (← links)
- A linearized relaxing algorithm for the specific nonlinear optimization problem (Q1669202) (← links)
- Global optimization for generalized linear multiplicative programming using convex relaxation (Q1721616) (← links)
- A novel optimization method for nonconvex quadratically constrained quadratic programs (Q1724769) (← links)
- An out space accelerating algorithm for generalized affine multiplicative programs problem (Q1794179) (← links)
- Inner approximation algorithm for generalized linear multiplicative programming problems (Q2061502) (← links)
- Branch-delete-bound algorithm for globally solving quadratically constrained quadratic programs (Q2409582) (← links)
- Global optimization algorithm for a generalized linear multiplicative programming (Q2511121) (← links)
- Globally minimizing a class of linear multiplicative forms via simplicial branch-and-bound (Q6162508) (← links)
