A branch and bound method via d. c. optimization algorithms and ellipsoidal technique for box constrained nonconvex quadratic problems
From MaRDI portal
Publication:1273054
DOI10.1023/A:1008240227198zbMath0912.90233OpenAlexW1530146942MaRDI QIDQ1273054
Publication date: 25 May 1999
Published in: Journal of Global Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1023/a:1008240227198
DCAdifference of convex functionsbranch-and-boundd.c. optimizationball constrained quadratic problembox constrained quadratic problemellipsoidal technique
Related Items
A new branch-and-cut algorithm for non-convex quadratic programming via alternative direction method and semidefinite relaxation ⋮ New LP-based local and global algorithms for continuous and mixed-integer nonconvex quadratic programming ⋮ A successive linear approximation algorithm for the global minimization of a concave quadratic program ⋮ Globally solving nonconvex quadratic programming problems with box constraints via integer programming methods ⋮ Globally solving box-constrained nonconvex quadratic programs with semidefinite-based finite branch-and-bound ⋮ A sensitive-eigenvector based global algorithm for quadratically constrained quadratic programming ⋮ An efficient algorithm for globally minimizing sum of quadratic ratios problem with nonconvex quadratic constraints ⋮ A conic trust-region method for optimization with nonlinear equality and inequality constrains via active-set strategy ⋮ Separable relaxation for nonconvex quadratic integer programming: Integer diagonalization approach ⋮ An efficient DC programming approach for portfolio decision with higher moments ⋮ Steering exact penalty DCA for nonsmooth DC optimisation problems with equality and inequality constraints ⋮ A New Approach for Optimizing Traffic Signals in Networks Considering Rerouting ⋮ New and efficient DCA based algorithms for minimum sum-of-squares clustering ⋮ Convergence of Pham Dinh-Le Thi's algorithm for the trust-region subproblem ⋮ Properties of two DC algorithms in quadratic programming ⋮ On a solution method in indefinite quadratic programming under linear constraints ⋮ An iDCA with sieving strategy for PDE-constrained optimization problems with \(L^{1-2}\)-control cost ⋮ Exact penalty and error bounds in DC programming ⋮ An exact solution method for unconstrained quadratic 0--1 programming: a geometric approach ⋮ A global optimization algorithm for sum of quadratic ratios problem with coefficients ⋮ Best ellipsoidal relaxation to solve a nonconvex problem. ⋮ Optimizing a multi-stage production/inventory system by DC programming based approaches ⋮ Linear convergence of a type of iterative sequences in nonconvex quadratic programming ⋮ Convergence analysis of difference-of-convex algorithm with subanalytic data ⋮ New quadratic lower bound for multivariate functions in global optimization ⋮ A trust-region method by active-set strategy for general nonlinear optimization ⋮ A class of differential quadratic programming problems ⋮ New global algorithms for quadratic programming with a few negative eigenvalues based on alternative direction method and convex relaxation ⋮ Optimal portfolio deleveraging under market impact and margin restrictions ⋮ The exact extreme response and the confidence extreme response analysis of structures subjected to uncertain-but-bounded excitations ⋮ DC programming and DCA: thirty years of developments ⋮ Visualizing data as objects by DC (difference of convex) optimization ⋮ Boundedness of a type of iterative sequences in two-dimensional quadratic programming ⋮ A continuous approch for globally solving linearly constrained quadratic ⋮ The DC (Difference of convex functions) programming and DCA revisited with DC models of real world nonconvex optimization problems ⋮ A polyhedral study of nonconvex quadratic programs with box constraints ⋮ Global Convergence of a Trust Region Algorithm for Nonlinear Inequality Constrained Optimization Problems ⋮ Convex relaxation and Lagrangian decomposition for indefinite integer quadratic programming ⋮ Extensions on ellipsoid bounds for quadratic integer programming ⋮ DC decomposition based branch-and-bound algorithms for box-constrained quadratic programs ⋮ A global optimization algorithm using linear relaxation ⋮ A new algorithm for the general quadratic programming problems with box constraints ⋮ Eigenvalue analysis of structures with interval parameters using the second-order Taylor series expansion and the DCA for QB ⋮ A binarisation heuristic for non-convex quadratic programming with box constraints ⋮ Static response analysis of structures with interval parameters using the second-order Taylor series expansion and the DCA for QB ⋮ On Algorithms for Difference of Monotone Operators ⋮ On Algorithms for Difference of Monotone Operators ⋮ Convex quadratic underestimation and Branch and Bound for univariate global optimization with one nonconvex constraint ⋮ Solving sum of quadratic ratios fractional programs via monotonic function
This page was built for publication: A branch and bound method via d. c. optimization algorithms and ellipsoidal technique for box constrained nonconvex quadratic problems
