Outer and Inner iterations #222
-
Hello, |
Beta Was this translation helpful? Give feedback.
Replies: 2 comments 1 reply
-
Thanks @simone-contorno for using ProxSuite. |
Beta Was this translation helpful? Give feedback.
-
Hi @simone-contorno, Thanks also for using ProxSuite! ProxQP is based on a proximal point algorithm (PPA). In this context, max_iter corresponds to the maximum number of iterations allocated for running this PPA. As the QPs considered involve linear inequalities, the evaluation of the proximal operator requires running an inner loop (ProxQP runs precisely a Newton semi-smooth method with exact line-search for minimizing a strongly convex sub-problem). max_iter_in sets up the maximum number of inner loops for solving each proximal sub-problems. You can find more details in our paper if needs be. Feel free to ask other questions if you want |
Beta Was this translation helpful? Give feedback.
Hi @simone-contorno,
Thanks also for using ProxSuite!
ProxQP is based on a proximal point algorithm (PPA). In this context, max_iter corresponds to the maximum number of iterations allocated for running this PPA. As the QPs considered involve linear inequalities, the evaluation of the proximal operator requires running an inner loop (ProxQP runs precisely a Newton semi-smooth method with exact line-search for minimizing a strongly convex sub-problem). max_iter_in sets up the maximum number of inner loops for solving each proximal sub-problems.
You can find more details in our paper if needs be. Feel free to ask other questions if you want