Abstract

<p style='text-indent:20px;'>By virtue of the Nesterov's acceleration technique, we establish an accelerated augmented Lagrangian method for solving linearly constrained multi-criteria optimization problem. For this method, we establish its global convergence under suitable condition. Further, we show that its iteration-complexity is <inline-formula><tex-math id="M1">\begin{document}$O(1/k^2)$\end{document}</tex-math></inline-formula> which improves the original ALM whose iteration-complexity is <inline-formula><tex-math id="M2">\begin{document}$O(1/k)$\end{document}</tex-math></inline-formula>.

Full Text
Paper version not known

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.