A family of inexact SQA methods for non-smooth convex minimization with provable convergence guarantees based on the Luo–Tseng error bound property

Title
A family of inexact SQA methods for non-smooth convex minimization with provable convergence guarantees based on the Luo–Tseng error bound property
Authors
Keywords
Convex composite minimization, Sequential quadratic approximation, Proximal Newton method, Error bound, Superlinear convergence, 49M15, 65K10, 90C55
Journal
MATHEMATICAL PROGRAMMING
Volume -, Issue -, Pages -
Publisher
Springer Nature
Online
2018-04-30
DOI
10.1007/s10107-018-1280-6

Ask authors/readers for more resources

Reprint

Contact the author

Publish scientific posters with Peeref

Peeref publishes scientific posters from all research disciplines. Our Diamond Open Access policy means free access to content and no publication fees for authors.

Learn More

Find the ideal target journal for your manuscript

Explore over 38,000 international journals covering a vast array of academic fields.

Search