A branch and bound algorithm for nonconvex quadratic optimization with ball and linear constraints
DOI10.1007/S10898-017-0521-1zbMATH Open1382.90082OpenAlexW2606666012MaRDI QIDQ1679484FDOQ1679484
Publication date: 9 November 2017
Published in: Journal of Global Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10898-017-0521-1
Recommendations
- A global optimization approach for quadratic programs with nonconvex quadratic constraints
- Branch-and-bound method for the minimization problem for a nonconvex quadratic function under convex quadratic constraints
- A branch and bound algorithm for nonconvex quadratic programming with quadratic constraints
- An eigenvalue decomposition based branch-and-bound algorithm for nonconvex quadratic programming problems with convex quadratic constraints
- A branch and bound method via d. c. optimization algorithms and ellipsoidal technique for box constrained nonconvex quadratic problems
nonconvex programmingbranch and boundtrust region subproblemquadratically constrained quadratic problemssparse source localization
Quadratic programming (90C20) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Nonconvex programming, global optimization (90C26)
Cites Work
- Computing a Trust Region Step
- A Fast Iterative Shrinkage-Thresholding Algorithm for Linear Inverse Problems
- Title not available (Why is that?)
- From Sparse Solutions of Systems of Equations to Sparse Modeling of Signals and Images
- Graph implementations for nonsmooth convex programs
- Title not available (Why is that?)
- New Results on Quadratic Minimization
- Trust-region problems with linear inequality constraints: exact SDP relaxation, global optimality and robust optimization
- On Cones of Nonnegative Quadratic Functions
- Strong Duality in Nonconvex Quadratic Optimization with Two Quadratic Constraints
- The trust region subproblem with non-intersecting linear constraints
- Second-order-cone constraints for extended trust-region subproblems
- Local Minimizers of Quadratic Functions on Euclidean Balls and Spheres
- Globally solving nonconvex quadratic programming problems via completely positive programming
- Computing Optimal Locally Constrained Steps
- Cutting-Planes for Optimization of Convex Functions over Nonconvex Sets
- Newton’s Method with a Model Trust Region Modification
- Constraint Integer Programming: A New Approach to Integrate CP and MIP
- Exact and Approximate Solutions of Source Localization Problems
Cited In (15)
- Branch-and-bound method for the minimization problem for a nonconvex quadratic function under convex quadratic constraints
- On box-constrained total least squares problem
- On the branch and bound algorithm for the extended trust-region subproblem
- An efficient algorithm for the extended trust-region subproblem with two linear constraints
- On Local Minimizers of Nonconvex Homogeneous Quadratically Constrained Quadratic Optimization with at Most Two Constraints
- Exact semidefinite formulations for a class of (random and non-random) nonconvex quadratic programs
- An SOCP relaxation based branch-and-bound method for generalized trust-region subproblem
- The optimal ball algorithm for nonlinear equations of quasi-strongly monotone operators
- Cheaper relaxation and better approximation for multi-ball constrained quadratic optimization and extension
- Closing the Gap between Necessary and Sufficient Conditions for Local Nonglobal Minimizer of Trust Region Subproblem
- A Trust Region Method for Finding Second-Order Stationarity in Linearly Constrained Nonconvex Optimization
- On indefinite quadratic optimization over the intersection of balls and linear constraints
- New results on eliminating the duality gap of the second-order-cone reformulation for extended trust-region subproblem with two intersecting cuts
- KKT-based primal-dual exactness conditions for the Shor relaxation
- Finding second-order stationary points in constrained minimization: a feasible direction approach
Uses Software
This page was built for publication: A branch and bound algorithm for nonconvex quadratic optimization with ball and linear constraints
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1679484)
