Pages that link to "Item:Q1810525"
From MaRDI portal
The following pages link to Difference of convex solution of quadratically constrained optimization problems. (Q1810525):
Displaying 12 items.
- A global optimization algorithm using parametric linearization relaxation (Q876659) (← links)
- Difference of convex functions optimization algorithms (DCA) for globally minimizing nonconvex quadratic forms on Euclidean balls and spheres (Q1362986) (← links)
- Demyanov difference of two sets and optimality conditions of Lagrange multiplier type for constrained quasidifferential optimization. (Q1579660) (← links)
- DC decomposition of nonconvex polynomials with algebraic techniques (Q1749445) (← links)
- SUSPECT: MINLP special structure detector for Pyomo (Q2182769) (← links)
- Sequential difference-of-convex programming (Q2198538) (← links)
- Solving polyhedral d.c. optimization problems via concave minimization (Q2200081) (← links)
- Error minimization with global optimization for difference of convex functions (Q2321661) (← links)
- An algorithm for global solution to bi-parametric linear complementarity constrained linear programs (Q2349521) (← links)
- A deterministic global optimization algorithm based on a linearizing method for nonconvex quadratically constrained programs (Q2389836) (← links)
- A new accelerating method for global non-convex quadratic optimization with non-convex quadratic constraints (Q2479256) (← links)
- A global optimization algorithm using linear relaxation (Q2507847) (← links)
