Decomposition branch and bound method for globally solving linearly constrained indefinite quadratic minimization problems

From MaRDI portal
Publication:1924614

DOI10.1016/0167-6377(95)00014-BzbMath0858.90102MaRDI QIDQ1924614

Thai Quynh Phong, Hoai An Le Thi, Tao Pham Dinh

Publication date: 23 March 1997

Published in: Operations Research Letters (Search for Journal in Brave)




Related Items (24)

DC programming techniques for solving a class of nonlinear bilevel programsA continuous DC programming approach for resource allocation in OFDMA/TDD wireless networksConvex optimization approaches to maximally predictable portfolio selectionA maximal predictability portfolio using absolute deviation reformulationA branch-bound cut technique for non-linear fractional multi-objective optimization problemsAn efficient combined DCA and B\&B using DC/SDP relaxation for globally solving binary quadratic programsSolving a class of low rank d.c. programs via a branch and bound approach: a computational experienceA MAXIMAL PREDICTABILITY PORTFOLIO MODEL: ALGORITHM AND PERFORMANCE EVALUATIONMINIMAL COST INDEX TRACKING UNDER NONLINEAR TRANSACTION COSTS AND MINIMAL TRANSACTION UNIT CONSTRAINTSA branch-and-bound algorithm embedded with DCA for DC programmingPORTFOLIO OPTIMIZATION OF SMALL SCALE FUND USING MEAN-ABSOLUTE DEVIATION MODELA computational comparison of some branch and bound methods for indefinite quadratic programsAn efficient algorithm for solving convex-convex quadratic fractional programsMinimization of the ratio of functions defined as sums of the absolute valuesMean-variance portfolio optimal problem under concave transaction costMinimal ellipsoid circumscribing a polytope defined by a system of linear inequalitiesA branch and bound algorithm for solving a class of D-C programmingA branch and reduce approach for solving a class of low rank d.c. programsDC programming approach for portfolio optimization under step increasing transaction costsComparative studies on dynamic programming and integer programming approaches for concave cost production/inventory control problemsStability of lagrangian duality for nonconvex quadratic programming. Solution methods and applications in computer visionOptimization of a long-short portfolio under nonconvex transaction costGlobal optimization versus integer programming in portfolio optimization under nonconvex transaction costsDecomposition methods for solving nonconvex quadratic programs via branch and bound



Cites Work


This page was built for publication: Decomposition branch and bound method for globally solving linearly constrained indefinite quadratic minimization problems