Dual support method for solving convex quadratic programs-Reference-Cited by-同舟云学术

Dual support method for solving convex quadratic programs

Published:2009-06-29 Issue:6 Volume:59 Page:851-872
ISSN:0233-1934
Container-title:Optimization
language:en
Short-container-title:Optimization

Author:

Brahmi Belkacem¹,Bibi Mohand Ouamer¹²

Affiliation:

1. a LAMOS Laboratory , University of Bejaia , 06000 Bejaia , Algeria

2. b Department of Operations Research , University of Bejaia , 06000 Bejaia , Algeria

Publisher

Informa UK Limited

Subject

Applied Mathematics,Management Science and Operations Research,Control and Optimization

Link

https://www.tandfonline.com/doi/pdf/10.1080/02331930902878341

Reference15 articles.

1. QPSchur: A dual, active-set, Schur-complement method for large-scale and structured convex quadratic programming

2. Support method for solving a linear-quadratic problem with polythedral with polyhedral constraints on control

3. B. Brahmi and M.O. Bibi, Méthode duale de support pour la résolution des problèmes quadratiques convexes à variables bornées, Actes du colloque International COSI'07, 11–13 June, Université USTO d'Oran, Algérie, 2007, pp. 365–376

4. Linear Programming and Extensions

Cited by 12 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. An efficient primal simplex method for solving large-scale support vector machines;Neurocomputing;2024-09

2. An Algorithm for Solving A MinMax Problem With Bounded Constraints;2022 8th International Conference on Control, Decision and Information Technologies (CoDIT);2022-05-17

3. Adaptive Global Algorithm for Solving Box-Constrained Non-convex Quadratic Minimization Problems;Journal of Optimization Theory and Applications;2022-01

4. A new method with hybrid direction for linear programming;Concurrency and Computation: Practice and Experience;2020-06-11

5. Primal-dual method for solving a linear-quadratic multi-input optimal control problem;Optimization Letters;2019-01-01