Pages that link to "Item:Q1273054"

The following pages link to A branch and bound method via d. c. optimization algorithms and ellipsoidal technique for box constrained nonconvex quadratic problems (Q1273054):

Displaying 50 items.

• An efficient DC programming approach for portfolio decision with higher moments (Q409263) (← links)
• Exact penalty and error bounds in DC programming (Q427389) (← links)
• An exact solution method for unconstrained quadratic 0--1 programming: a geometric approach (Q427399) (← links)
• A global optimization algorithm for sum of quadratic ratios problem with coefficients (Q440994) (← links)
• Optimizing a multi-stage production/inventory system by DC programming based approaches (Q461449) (← 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)
• Separable relaxation for nonconvex quadratic integer programming: Integer diagonalization approach (Q604257) (← 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)
• A class of differential quadratic programming problems (Q670795) (← links)
• Extensions on ellipsoid bounds for quadratic integer programming (Q721161) (← links)
• DC decomposition based branch-and-bound algorithms for box-constrained quadratic programs (Q723488) (← links)
• Static response analysis of structures with interval parameters using the second-order Taylor series expansion and the DCA for QB (Q739978) (← links)
• A new branch-and-cut algorithm for non-convex quadratic programming via alternative direction method and semidefinite relaxation (Q820743) (← links)
• A successive linear approximation algorithm for the global minimization of a concave quadratic program (Q827382) (← links)
• Globally solving box-constrained nonconvex quadratic programs with semidefinite-based finite branch-and-bound (Q839489) (← links)
• A conic trust-region method for optimization with nonlinear equality and inequality constrains via active-set strategy (Q864760) (← links)
• New and efficient DCA based algorithms for minimum sum-of-squares clustering (Q898299) (← links)
• Solving sum of quadratic ratios fractional programs via monotonic function (Q1026289) (← links)
• A combined d.c. optimization--ellipsoidal branch-and-bound algorithm for solving nonconvex quadratic programming problems (Q1386483) (← links)
• Best ellipsoidal relaxation to solve a nonconvex problem. (Q1421225) (← links)
• Ellipsoidal approach to box-constrained quadratic problems (Q1424957) (← links)
• Globally solving nonconvex quadratic programming problems with box constraints via integer programming methods (Q1621692) (← links)
• A branch and bound algorithm for nonconvex quadratic optimization with ball and linear constraints (Q1679484) (← links)
• Convergence analysis of difference-of-convex algorithm with subanalytic data (Q1730802) (← links)
• New global algorithms for quadratic programming with a few negative eigenvalues based on alternative direction method and convex relaxation (Q1741128) (← links)
• DC programming and DCA: thirty years of developments (Q1749443) (← links)
• Visualizing data as objects by DC (difference of convex) optimization (Q1749447) (← links)
• The DC (Difference of convex functions) programming and DCA revisited with DC models of real world nonconvex optimization problems (Q1772961) (← links)
• A polyhedral study of nonconvex quadratic programs with box constraints (Q1774169) (← links)
• Convergence of Pham Dinh-Le Thi's algorithm for the trust-region subproblem (Q1941028) (← links)
• The exact extreme response and the confidence extreme response analysis of structures subjected to uncertain-but-bounded excitations (Q1988812) (← links)
• New LP-based local and global algorithms for continuous and mixed-integer nonconvex quadratic programming (Q2124794) (← links)
• New quadratic lower bound for multivariate functions in global optimization (Q2228598) (← 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)
• Eigenvalue analysis of structures with interval parameters using the second-order Taylor series expansion and the DCA for QB (Q2294012) (← links)
• A binarisation heuristic for non-convex quadratic programming with box constraints (Q2294229) (← links)
• An efficient algorithm for globally minimizing sum of quadratic ratios problem with nonconvex quadratic constraints (Q2383678) (← links)
• A trust-region method by active-set strategy for general nonlinear optimization (Q2460581) (← links)
• A global optimization algorithm using linear relaxation (Q2507847) (← links)
• A sensitive-eigenvector based global algorithm for quadratically constrained quadratic programming (Q2633541) (← links)
• Branch-and-bound method for the minimization problem for a nonconvex quadratic function under convex quadratic constraints (Q2713937) (← links)
• A continuous approch for globally solving linearly constrained quadratic (Q2767579) (← links)
• Convex relaxation and Lagrangian decomposition for indefinite integer quadratic programming (Q2786313) (← links)
• Convex quadratic underestimation and Branch and Bound for univariate global optimization with one nonconvex constraint (Q3635703) (← links)
• Global Convergence of a Trust Region Algorithm for Nonlinear Inequality Constrained Optimization Problems (Q4678767) (← links)
• (Q4980087) (← links)
• A New Approach for Optimizing Traffic Signals in Networks Considering Rerouting (Q5356979) (← links)