Pages that link to "Item:Q811889"

The following pages link to Decomposition methods for solving nonconvex quadratic programs via branch and bound (Q811889):

Displaying 28 items.

• Global optimization advances in mixed-integer nonlinear programming, MINLP, and constrained derivative-free optimization, CDFO (Q322958) (← links)
• GLOMIQO: global mixed-integer quadratic optimizer (Q367170) (← links)
• Linear convergence of a type of iterative sequences in nonconvex quadratic programming (Q472338) (← links)
• Branch-and-bound approaches to standard quadratic optimization problems (Q598585) (← links)
• Solving a class of low rank d.c. programs via a branch and bound approach: a computational experience (Q613323) (← links)
• Properties of two DC algorithms in quadratic programming (Q628748) (← links)
• Nonconvex quadratically constrained quadratic programming: Best D.C. Decompositions and their SDP representations (Q645557) (← links)
• DC decomposition based branch-and-bound algorithms for box-constrained quadratic programs (Q723488) (← links)
• A branch and reduce approach for solving a class of low rank d.c. programs (Q732158) (← links)
• An accelerating algorithm for globally solving nonconvex quadratic programming (Q824677) (← links)
• Global maximization of a generalized concave multiplicative function (Q927239) (← links)
• A computational comparison of some branch and bound methods for indefinite quadratic programs (Q940829) (← links)
• A robust solution approach for nonconvex quadratic programs with additional multiplicative constraints (Q945281) (← links)
• Branch-and-bound decomposition approach for solving quasiconvex-concave programs (Q1333350) (← links)
• Undominated d.c. decompositions of quadratic functions and applications to branch-and-bound approaches (Q1876594) (← links)
• Decomposition methods for solving a class of nonconvex programming problems dealing with bilinear and quadratic functions (Q1892595) (← links)
• Global optimization of mixed-integer quadratically-constrained quadratic programs (MIQCQP) through piecewise-linear and edge-concave relaxations (Q1925777) (← links)
• Optimal portfolio deleveraging under market impact and margin restrictions (Q2240011) (← links)
• Boundedness of a type of iterative sequences in two-dimensional quadratic programming (Q2260662) (← links)
• Global optimization method for linear multiplicative programming (Q2355349) (← links)
• Solving the Karush-Kuhn-Tucker system of a nonconvex programming problem on an unbounded set (Q2518117) (← links)
• A sensitive-eigenvector based global algorithm for quadratically constrained quadratic programming (Q2633541) (← links)
• Computational methods for solving nonconvex block-separable constrained quadratic problems (Q2810546) (← links)
• On globally solving linearly constrained indefinite quadratic minimization problems by decomposition branch and bound method (Q4888148) (← links)
• (Q4980087) (← links)
• Solving linear multiplicative programs via branch-and-bound: a computational experience (Q6060545) (← links)
• A graph-based decomposition method for convex quadratic optimization with indicators (Q6102761) (← links)
• Steering exact penalty DCA for nonsmooth DC optimisation problems with equality and inequality constraints (Q6113525) (← links)