Pages that link to "Item:Q1372558"
From MaRDI portal
The following pages link to Lagrange duality and partitioning techniques in nonconvex global optimization (Q1372558):
Displaying 14 items.
- On the relation between concavity cuts and the surrogate dual for convex maximization problems (Q427376) (← links)
- Convergence and application of a decomposition method using duality bounds for nonconvex global optimization (Q700712) (← links)
- Decomposition branch-and-bound based algorithm for linear programs with additional multiplicative constraints (Q813372) (← links)
- A new global optimization algorithm for signomial geometric programming via Lagrangian relaxation (Q879567) (← links)
- A simplicial branch and bound duality-bounds algorithm for the linear sum-of-ratios problem (Q881518) (← links)
- Convergence-order analysis of branch-and-bound algorithms for constrained problems (Q1668796) (← links)
- A new algorithm for concave quadratic programming (Q2010088) (← links)
- A scalable global optimization algorithm for stochastic nonlinear programs (Q2274886) (← links)
- An efficient algorithm for globally minimizing sum of quadratic ratios problem with nonconvex quadratic constraints (Q2383678) (← links)
- On a decomposition method for nonconvex global optimization (Q2463828) (← links)
- Solving sum-of-ratios fractional programs using efficient points (Q2743661) (← links)
- Duality bound method for the general quadratic programming problem with quadratic constraints (Q5925726) (← links)
- Biconvex programming approach to optimization over the weakly efficient set of a multiple objective affine fractional problem (Q5940038) (← links)
- Comparison of MINLP formulations for global superstructure optimization (Q6173771) (← links)
