A branch and bound algorithm for nonconvex quadratic optimization with ball and linear constraints
From MaRDI portal
Publication:1679484
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
Cites work
- scientific article; zbMATH DE number 1818892 (Why is no real title available?)
- scientific article; zbMATH DE number 5060482 (Why is no real title available?)
- A Fast Iterative Shrinkage-Thresholding Algorithm for Linear Inverse Problems
- Computing Optimal Locally Constrained Steps
- Computing a Trust Region Step
- Constraint Integer Programming: A New Approach to Integrate CP and MIP
- Cutting-Planes for Optimization of Convex Functions over Nonconvex Sets
- Exact and Approximate Solutions of Source Localization Problems
- From Sparse Solutions of Systems of Equations to Sparse Modeling of Signals and Images
- Globally solving nonconvex quadratic programming problems via completely positive programming
- Graph implementations for nonsmooth convex programs
- Local Minimizers of Quadratic Functions on Euclidean Balls and Spheres
- New Results on Quadratic Minimization
- Newton’s Method with a Model Trust Region Modification
- On Cones of Nonnegative Quadratic Functions
- Second-order-cone constraints for extended trust-region subproblems
- Strong Duality in Nonconvex Quadratic Optimization with Two Quadratic Constraints
- The trust region subproblem with non-intersecting linear constraints
- Trust-region problems with linear inequality constraints: exact SDP relaxation, global optimality and robust optimization
Cited in
(15)- On indefinite quadratic optimization over the intersection of balls and linear constraints
- Branch-and-bound method for the minimization problem for a nonconvex quadratic function under convex quadratic constraints
- On Local Minimizers of Nonconvex Homogeneous Quadratically Constrained Quadratic Optimization with at Most Two Constraints
- Cheaper relaxation and better approximation for multi-ball constrained quadratic optimization and extension
- On box-constrained total least squares problem
- A trust region method for finding second-order stationarity in linearly constrained nonconvex optimization
- An efficient algorithm for the extended trust-region subproblem with two linear constraints
- Finding second-order stationary points in constrained minimization: a feasible direction approach
- An SOCP relaxation based branch-and-bound method for generalized trust-region subproblem
- KKT-based primal-dual exactness conditions for the Shor relaxation
- On the branch and bound algorithm for the extended trust-region subproblem
- The optimal ball algorithm for nonlinear equations of quasi-strongly monotone operators
- New results on eliminating the duality gap of the second-order-cone reformulation for extended trust-region subproblem with two intersecting cuts
- Closing the gap between necessary and sufficient conditions for local nonglobal minimizer of trust region subproblem
- Exact semidefinite formulations for a class of (random and non-random) nonconvex quadratic programs
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)
