The following pages link to Zhi-bin Deng (Q489091):
Displaying 32 items.
- (Q380505) (redirect page) (← links)
- Computable representation of the cone of nonnegative quadratic forms over a general second-order cone and its application to completely positive programming (Q380506) (← links)
- Exact computable representation of some second-order cone constrained quadratic programming problems (Q384217) (← links)
- Quadratic optimization over a second-order cone with linear equality constraints (Q489094) (← links)
- An eigenvalue decomposition based branch-and-bound algorithm for nonconvex quadratic programming problems with convex quadratic constraints (Q513160) (← links)
- Argument division based branch-and-bound algorithm for unit-modulus constrained complex quadratic programming (Q683728) (← links)
- DC decomposition based branch-and-bound algorithms for box-constrained quadratic programs (Q723488) (← links)
- Cardinality constrained portfolio selection problem: a completely positive programming approach (Q898723) (← links)
- (Q1716970) (redirect page) (← links)
- Globally solving quadratic programs with convex objective and complementarity constraints via completely positive programming (Q1716972) (← links)
- Conic approximation to nonconvex quadratic programming with convex quadratic constraints (Q2018510) (← links)
- Fast computation of global solutions to the single-period unit commitment problem (Q2082175) (← links)
- Globally solving extended trust region subproblems with two intersecting cuts (Q2228371) (← links)
- A branch-and-bound algorithm for solving max-\(k\)-cut problem (Q2231324) (← links)
- A low-dimensional SDP relaxation based spatial branch and bound method for nonconvex quadratic programs (Q2244199) (← links)
- An intuitionistic fuzzy set based \(S^3\)VM model for binary classification with mislabeled information (Q2272418) (← links)
- Detecting copositivity of a symmetric matrix by an adaptive ellipsoid-based approximation scheme (Q2355798) (← links)
- Quadratic optimization over one first-order cone (Q2438413) (← links)
- Quadratic optimization over a polyhedral cone (Q2515280) (← links)
- Fuzzy quadratic surface support vector machine based on Fisher discriminant analysis (Q2515290) (← links)
- A sensitive-eigenvector based global algorithm for quadratically constrained quadratic programming (Q2633541) (← links)
- A fast global algorithm for singly linearly constrained separable binary quadratic program with partially identical parameters (Q2693785) (← links)
- A semidefinite relaxation based global algorithm for two-level graph partition problem (Q2698612) (← links)
- (Q2813613) (← links)
- On linear conic relaxation of discrete quadratic programs (Q2829559) (← links)
- (Q2928420) (← links)
- Soft Quadratic Surface Support Vector Machine for Binary Classification (Q2956867) (← links)
- A branch-and-cut algorithm using polar cuts for solving nonconvex quadratic programming problems (Q4639134) (← links)
- A new global algorithm for max-cut problem with chordal sparsity (Q6103705) (← links)
- New semidefinite relaxations for a class of complex quadratic programming problems (Q6166105) (← links)
- A graphic structure based branch-and-bound algorithm for complex quadratic optimization and applications to magnitude least-square problem (Q6183088) (← links)
- A new global algorithm for homogeneous complex quadratic programming problems and applications (Q6664319) (← links)
