An accelerating algorithm for globally solving nonconvex quadratic programming
From MaRDI portal
Recommendations
- scientific article; zbMATH DE number 5630592
- A linearization method for global optimal solution of quadratic programming problem with nonconvex quadratic constraints
- A global optimization algorithm for generalized quadratic programming
- A new accelerating method for solving quadratic programming
- A parametric linear relaxation algorithm for globally solving nonconvex quadratic programming
Cites work
- A branch and cut algorithm for nonconvex quadratically constrained quadratic programming
- A branch-and-cut algorithm for nonconvex quadratic programs with box constraints
- A decomposition algorithm for solving large-scale quadratic programming problems
- A finite branch-and-bound algorithm for nonconvex quadratic programming via semidefinite relaxations
- A global optimization algorithm using parametric linearization relaxation
- A global optimization approach for quadratic programs with nonconvex quadratic constraints
- A global optimization approach for solving the convex multiplicative programming problem
- A globally convergent trust region multidimensional filter SQP algorithm for nonlinear programming
- A new global optimization approach for convex multiplicative programming
- A new rectangle branch-and-reduce approach for solving nonconvex quadratic programming problems
- A nonisolated optimal solution of general linear multiplicative programming problems
- A parametric linear relaxation algorithm for globally solving nonconvex quadratic programming
- A reformulation-linearization technique for solving discrete and continuous nonconvex problems
- A relaxation method for nonconvex quadratically constrained quadratic programs
- A Robust Algorithm for Solving Nonlinear Programming Problems
- A robust solution approach for nonconvex quadratic programs with additional multiplicative constraints
- A simplicial branch-and-bound algorithm for solving quadratically constrained quadratic programs
- A simplicial branch-and-bound method for solving nonconvex all-quadratic programs
- An eigenvalue decomposition based branch-and-bound algorithm for nonconvex quadratic programming problems with convex quadratic constraints
- An infeasible active-set QP-free algorithm for general nonlinear programming
- Decomposition methods for solving nonconvex quadratic programs via branch and bound
- Effective algorithm for solving the generalized linear multiplicative problem with generalized polynomial constraints
- Global minimization of a generalized linear multiplicative programming
- Globally solving box-constrained nonconvex quadratic programs with semidefinite-based finite branch-and-bound
- Linear decomposition approach for a class of nonconvex programming problems
- Preprocessing Nonlinear Functional Constraints with Applications to the Pooling Problem
- Primal-relaxed dual global optimization approach
- Synthesis of globally optimal controllers for robust performance to unstructured uncertainty
Cited in
(11)- A global optimization algorithm for generalized quadratic programming
- A new accelerating method for global non-convex quadratic optimization with non-convex quadratic constraints
- Speeding up IP-based algorithms for constrained quadratic 0-1 optimization
- scientific article; zbMATH DE number 5630592 (Why is no real title available?)
- scientific article; zbMATH DE number 1051015 (Why is no real title available?)
- A new accelerating method for solving quadratic programming
- Globally Solving Nonconvex Quadratic Programs via Linear Integer Programming Techniques
- A linearization method for global optimal solution of quadratic programming problem with nonconvex quadratic constraints
- An efficient DCA algorithm for solving non-monotone affine variational inequality problem
- A parametric linear relaxation algorithm for globally solving nonconvex quadratic programming
- A new accelerating method for globally solving a class of nonconvex programming problems
This page was built for publication: An accelerating algorithm for globally solving nonconvex quadratic programming
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q824677)
