Pages that link to "Item:Q700712"
From MaRDI portal
The following pages link to Convergence and application of a decomposition method using duality bounds for nonconvex global optimization (Q700712):
Displayed 11 items.
- Decomposition branch-and-bound based algorithm for linear programs with additional multiplicative constraints (Q813372) (← links)
- A simplicial branch and bound duality-bounds algorithm for the linear sum-of-ratios problem (Q881518) (← links)
- A convex analysis approach for convex multiplicative programming (Q934807) (← links)
- A robust solution approach for nonconvex quadratic programs with additional multiplicative constraints (Q945281) (← links)
- On duality bound methods for nonconvex global optimization (Q995944) (← links)
- Combination between global and local methods for solving an optimization problem over the efficient set (Q1848362) (← links)
- A duality-bounds algorithm for non-convex quadratic programs with additional multiplicative constraints (Q2425955) (← links)
- On a decomposition method for nonconvex global optimization (Q2463828) (← links)
- On optimization over the efficient set in linear multicriteria programming (Q2471110) (← links)
- A continuous approch for globally solving linearly constrained quadratic (Q2767579) (← links)
- Duality bound method for the general quadratic programming problem with quadratic constraints (Q5925726) (← links)
