Pages that link to "Item:Q1810869"
From MaRDI portal
The following pages link to A global optimization algorithm using Lagrangian underestimates and the interval Newton method (Q1810869):
Displaying 15 items.
- Using conical regularization in calculating Lagrangian estimates in quadratic optimization problems (Q681722) (← links)
- Semidefinite relaxations for quadratically constrained quadratic programming: A review and comparisons (Q717135) (← links)
- Successive Lagrangian relaxation algorithm for nonconvex quadratic optimization (Q721146) (← links)
- Interval branch and bound with local sampling for constrained global optimization (Q811876) (← links)
- A global optimization algorithm using parametric linearization relaxation (Q876659) (← links)
- A fast memoryless interval-based algorithm for global optimization (Q975771) (← links)
- A novel optimization method for nonconvex quadratically constrained quadratic programs (Q1724769) (← links)
- An efficient algorithm for globally minimizing sum of quadratic ratios problem with nonconvex quadratic constraints (Q2383678) (← links)
- A deterministic global optimization algorithm based on a linearizing method for nonconvex quadratically constrained programs (Q2389836) (← links)
- Branch-delete-bound algorithm for globally solving quadratically constrained quadratic programs (Q2409582) (← links)
- Enhancing the normalized multiparametric disaggregation technique for mixed-integer quadratic programming (Q2423782) (← links)
- Facets of a mixed-integer bilinear covering set with bounds on variables (Q2423814) (← links)
- Nonlinear robust optimization via sequential convex bilevel programming (Q2434994) (← links)
- A global optimization algorithm using linear relaxation (Q2507847) (← links)
- A New Global Optimization Scheme for Quadratic Programs with Low-Rank Nonconvexity (Q5084603) (← links)
