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

Mathematics

• Quadratic Approximation 100%
• Convex Minimization 95%
• Approximation Methods 74%
• Error Bounds 69%
• Family 36%
• Competitiveness 27%
• Proximal Methods 25%
• Linear Convergence 22%
• Superlinear Convergence 22%
• Classification Problems 21%
• Logistic Regression 20%
• Local Convergence 20%
• Iterate 18%
• Newton Methods 18%
• Strong Convergence 17%
• Efficient Algorithms 16%
• Convex function 16%
• Optimal Solution 16%
• Convergence Rate 16%
• High-dimensional 15%
• Regression 14%
• Knowledge 14%
• Experiment 14%
• First-order 13%
• Converge 12%
• Closed 11%

Engineering & Materials Science

• Logistic regression 28%
• Newton-Raphson method 28%
• Experiments 9%