On solving nonconvex optimization problems by reducing the duality gap (Q2494287): Difference between revisions

@@ Property / full work available at URL @@
+https://doi.org/10.1007/s10898-004-1947-9
+Normal rank
@@ Property / OpenAlex ID @@
+W2026753148
@@ Property / OpenAlex ID: W2026753148 / rank @@
+Normal rank
@@ Property / cites work @@
+A relaxation method for nonconvex quadratically constrained quadratic programs
+Normal rank
@@ Property / cites work @@
+Global minimization by reducing the duality gap
@@ Property / cites work: Global minimization by reducing the duality gap / rank @@
+Normal rank
@@ Property / cites work @@
+Lagrange Multipliers and Nonconvex Programs
@@ Property / cites work: Lagrange Multipliers and Nonconvex Programs / rank @@
+Normal rank
@@ Property / cites work @@
+An Algorithm for Separable Nonconvex Programming Problems
+Normal rank
@@ Property / cites work @@
+Q4251073
@@ Property / cites work: Q4251073 / rank @@
+Normal rank
@@ Property / cites work @@
+Nondifferentiable optimization and polynomial problems
+Normal rank
@@ Property / cites work @@
+Lagrangian bounds in multiextremal polynomial and discrete optimization problems
+Normal rank
@@ Property / cites work @@
+Duality bound method for the general quadratic programming problem with quadratic constraints
+Normal rank
@@ Property / cites work @@
+Convergence of duality bound method in partly convex programming
+Normal rank
@@ Property / cites work @@
+Q4498100
@@ Property / cites work: Q4498100 / rank @@
+Normal rank
@@ Property / cites work @@
+Convex analysis and global optimization
@@ Property / cites work: Convex analysis and global optimization / rank @@
+Normal rank
@@ Property / cites work @@
+Q4495147
@@ Property / cites work: Q4495147 / rank @@
+Normal rank