Pages that link to "Item:Q344963"

The following pages link to Practical inexact proximal quasi-Newton method with global complexity analysis (Q344963):

Displaying 31 items.

• Inexact proximal Newton methods for self-concordant functions (Q522088) (← links)
• A flexible coordinate descent method (Q1639710) (← links)
• Inexact proximal stochastic gradient method for convex composite optimization (Q1694394) (← links)
• A family of inexact SQA methods for non-smooth convex minimization with provable convergence guarantees based on the Luo-Tseng error bound property (Q1739040) (← links)
• Proximal quasi-Newton methods for regularized convex optimization with linear and accelerated sublinear convergence rates (Q1744900) (← links)
• Second-order optimality and beyond: characterization and evaluation complexity in convexly constrained nonlinear optimization (Q1785005) (← links)
• Inexact variable metric stochastic block-coordinate descent for regularized optimization (Q1985280) (← links)
• Optimality of orders one to three and beyond: characterization and evaluation complexity in constrained nonconvex optimization (Q2001208) (← links)
• Inexact proximal memoryless quasi-Newton methods based on the Broyden family for minimizing composite functions (Q2028458) (← links)
• Globalized inexact proximal Newton-type methods for nonconvex composite functions (Q2028488) (← links)
• An inexact successive quadratic approximation method for a class of difference-of-convex optimization problems (Q2125070) (← links)
• Second order semi-smooth proximal Newton methods in Hilbert spaces (Q2141359) (← links)
• Global convergence of a family of modified BFGS methods under a modified weak-Wolfe-Powell line search for nonconvex functions (Q2190800) (← links)
• Global complexity analysis of inexact successive quadratic approximation methods for regularized optimization under mild assumptions (Q2200083) (← links)
• Forward-backward quasi-Newton methods for nonsmooth optimization problems (Q2364124) (← links)
• Performance of first- and second-order methods for \(\ell_1\)-regularized least squares problems (Q2374363) (← links)
• Inexact successive quadratic approximation for regularized optimization (Q2419525) (← links)
• A globally convergent proximal Newton-type method in nonsmooth convex optimization (Q2687066) (← links)
• A proximal quasi-Newton method based on memoryless modified symmetric rank-one formula (Q2691372) (← links)
• FaRSA for ℓ₁-regularized convex optimization: local convergence and numerical experience (Q4638928) (← links)
• Optimization Methods for Large-Scale Machine Learning (Q4641709) (← links)
• A Unified Adaptive Tensor Approximation Scheme to Accelerate Composite Convex Optimization (Q5131958) (← links)
• An Inexact Variable Metric Proximal Point Algorithm for Generic Quasi-Newton Acceleration (Q5231671) (← links)
• Fused Multiple Graphical Lasso (Q5254994) (← links)
• A Reduced-Space Algorithm for Minimizing $\ell_1$-Regularized Convex Functions (Q5348467) (← links)
• One-Step Estimation with Scaled Proximal Methods (Q5868961) (← links)
• COAP 2021 best paper prize (Q6043127) (← links)
• Inexact proximal DC Newton-type method for nonconvex composite functions (Q6155059) (← links)
• Accelerating inexact successive quadratic approximation for regularized optimization through manifold identification (Q6165598) (← links)
• Minimizing oracle-structured composite functions (Q6173766) (← links)
• Inexact proximal Newton methods in Hilbert spaces (Q6179871) (← links)