Optimal Quadratic Programming Algorithms: With Applications to Variational Inequalities

By Zdenek Dostl. 2009

219 citations recorded by the source corpus.

View Paper: https://www.semanticscholar.org/paper/0e7b1bf9c5b23eee57f9537b0bfad7bd4ff45c06

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

1. Zhigang Li
2. Wenchuan Wu
3. Boming Zhang
4. Xin-She Yang
5. Arpan Kumar Kar
6. Iztok Fister
7. Seyed Mohammad Mirjalili
8. Amir H. Gandomi

Citations in the corpus

• Nature-Inspired Optimization Algorithms: Challenges and Open Problems (2020, methodology): “For traditional algorithms such as quasi-Newton methods, the tuning of a single parameter can have rigorous mathematical foundations (Boyd and Vandenberghe, 2004; Bertsekas et al., 2003; Chabert, 1999; Zdenek, 2009).”
• Decentralized Multi-Area Dynamic Economic Dispatch Using Modified Generalized Benders Decomposition (2016, background): “Note that SP and SP-B have identical optimal solutions; however SP-B is an equality constrained quadratic programming problem, the optimal value of which can be explicitly expressed by solving the KKT system directly [25].”