A Branch and Bound Algorithm for Low Rank Multiplicative Nonconvex Minimization Problem

Du, Tingsong; Fei, Pusheng; Jian, Jigui

doi:10.1109/icnc.2009.144

Search citation statements

Order By: Relevance

Paper Sections

Select...

Introduction1

Citation Types

Supporting

Mentioning

Contrasting

Year Published

2010

2013

Publication Types

Select...

Other3

Relationship

Self Cite0

Independent3

Authors

Journals

Cited by 3 publications

(1 citation statement)

References 8 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Le and Pham [6] proposed a branch and bound method based on D.C. optimization and ellipsoidal technique. About the application of the branch and bound algorithm, see references [7,8]. In this paper, a new branch and bound method is presented.…”

Section: Introductionmentioning

confidence: 99%

A new branch and bound algorithm for noncovex quadratic programming with box constraints

2013

2013 10th International Conference on Fuzzy Systems and Knowledge Discovery (FSKD)

View full text Add to dashboard Cite

In this paper, we investigate a class of nonconvex quadratic programming with box constrains. A new branch and bound algorithm is proposed. The improvement of the new method is how to determine the lower bound. We put nonconvex quadratic programming into convex quadratic programming, and get an optimal solution as lower bound of original problem. Meanwhile, an upper bound is got by existing methods. Moreover, by used of the branch and bound algorithm, we can solve the original problem by solved a series of subproblems. Finally, the convergence of the proposed new algorithm is proved. Keywords-nonconvex quadratic programming; box constrainted; branch and bound algorithm

show abstract

Section: Introductionmentioning

confidence: 99%

A new branch and bound algorithm for noncovex quadratic programming with box constraints

2013

2013 10th International Conference on Fuzzy Systems and Knowledge Discovery (FSKD)

View full text Add to dashboard Cite

show abstract

A Branch and Bound algorithm for solving nonconvex minimization problem based on reducing duality gap

Yang

2010

2010 Sixth International Conference on Natural Computation

View full text Add to dashboard Cite

Global minimization simplicial algorithm for concave minorant optimization problem

2012

2012 8th International Conference on Natural Computation

View full text Add to dashboard Cite

A Branch and Bound Algorithm for Low Rank Multiplicative Nonconvex Minimization Problem

Cited by 3 publications

References 8 publications

A new branch and bound algorithm for noncovex quadratic programming with box constraints

A new branch and bound algorithm for noncovex quadratic programming with box constraints

A Branch and Bound algorithm for solving nonconvex minimization problem based on reducing duality gap

Global minimization simplicial algorithm for concave minorant optimization problem

Contact Info

Product

Resources

About