Skip to main content
Log in

COAP 2021 Best Paper Prize

  • Published:
Computational Optimization and Applications Aims and scope Submit manuscript

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

References

  1. Beck, A.: First-order methods in optimization. Society for Industrial and Applied Mathematics, MOS-SIAM Series on Optimization (2017)

  2. Becker, S., Fadili, J., Ochs, P.: On quasi-Newton forward-backward splitting: proximal calculus and convergence. SIAM J. Optim. 29(4), 2445–2481 (2019)

    Article  MathSciNet  MATH  Google Scholar 

  3. Byrd, R.H., Nocedal, J., Schnabel, R.B.: Representations of quasi-Newton matrices and their use in limited memory methods. Math. Program. 63(1), 129–156 (1994)

    Article  MathSciNet  MATH  Google Scholar 

  4. De Marchi, A., Jia, X., Kanzow, C., Mehlitz, P.: Constrained composite optimization and augmented Lagrangian methods (2022). https://doi.org/10.48550/arXiv.2203.05276

  5. Jia, X., Kanzow, C., Mehlitz, P., Wachsmuth, G.: An augmented Lagrangian method for optimization problems with structured geometric constraints. Math. Program. (2022). https://doi.org/10.1007/s10107-022-01870-z

  6. Kanzow, C., Lechner, T.: Globalized inexact proximal Newton-type methods for nonconvex composite functions. Comput. Optim. Appl. 78(2), 377–410 (2021)

    Article  MathSciNet  MATH  Google Scholar 

  7. Kanzow, C., Lechner, T.: Efficient regularized proximal quasi-Newton methods for large-scale nonconvex composite optimization problems (2022). https://doi.org/10.48550/arXiv.2210.07644

  8. Lechner, T.: Proximal methods for nonconvex composite optimization problems. PhD thesis, University of Würzburg, (2022)

  9. Lee, J.D., Sun, Y., Saunders, M.A.: Proximal Newton-type methods for minimizing composite functions. SIAM J. Optim. 24(3), 1420–1443 (2014)

    Article  MathSciNet  MATH  Google Scholar 

  10. Liu, R., Pan, S., Wu, Y., Yang, X.: An inexact regularized proximal Newton method for nonconvex and nonsmooth optimization (2022). https://doi.org/10.48550/arXiv.2209.09119

  11. Mordukhovich, B.S., Yuan, X., Zeng, S., Zhang, J.: A globally convergent proximal Newton-type method in nonsmooth convex optimization. Math. Program. (2022). https://doi.org/10.1007/s10107-022-01797-5

  12. Ouyang, W., Milzarek, A.: A trust region-type normal map-based semismooth Newton method for nonsmooth nonconvex composite optimization (2021). https://doi.org/10.48550/arXiv.2106.09340

  13. Patrinos, P., Bemporad, A.: Proximal Newton methods for convex composite optimization. In 52nd IEEE Conference on Decision and Control, pp 2358–2363. IEEE (2013)

  14. Pötzl, B., Schiela, A., Jaap, P.: Inexact proximal Newton methods in Hilbert spaces(2022). https://doi.org/10.48550/arXiv.2204.12168

  15. Scheinberg, K., Tang, X.: Practical inexact proximal quasi-Newton method with global complexity analysis. Math. Program. 160(1–2), 495–529 (2016)

    Article  MathSciNet  MATH  Google Scholar 

  16. Yuqia, W.U., Shaohua, P., Yang, X.: A globally convergent regularized Newton method for \(\ell _q\)-norm composite optimization problems (2022). arxiv:2203.02957

Download references

Author information

Authors

Additional information

Publisher's Note

Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Kanzow, C., Lechner, T. COAP 2021 Best Paper Prize. Comput Optim Appl 83, 723–726 (2022). https://doi.org/10.1007/s10589-022-00426-3

Download citation

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10589-022-00426-3

Navigation